./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:46:41,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:46:41,161 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:46:41,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:46:41,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:46:41,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:46:41,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:46:41,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:46:41,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:46:41,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:46:41,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:46:41,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:46:41,195 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:46:41,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:46:41,196 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:46:41,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:46:41,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:46:41,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:46:41,199 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:46:41,199 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:46:41,200 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:46:41,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:46:41,201 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:46:41,202 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:46:41,202 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:46:41,203 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:46:41,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:46:41,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:46:41,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:46:41,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:41,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:46:41,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:46:41,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:46:41,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:46:41,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:46:41,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:46:41,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:46:41,209 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:46:41,209 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_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/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_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2023-11-06 22:46:41,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:46:41,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:46:41,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:46:41,530 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:46:41,530 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:46:41,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-11-06 22:46:44,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:46:45,030 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:46:45,031 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-11-06 22:46:45,055 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/data/c2ae8df26/a9c45854677c48529d639d70eba35a51/FLAG425dd223b [2023-11-06 22:46:45,073 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/data/c2ae8df26/a9c45854677c48529d639d70eba35a51 [2023-11-06 22:46:45,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:46:45,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:46:45,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:45,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:46:45,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:46:45,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4156a2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45, skipping insertion in model container [2023-11-06 22:46:45,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,166 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:46:45,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:45,553 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:46:45,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:45,634 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:46:45,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45 WrapperNode [2023-11-06 22:46:45,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:45,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:45,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:46:45,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:46:45,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,688 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 147 [2023-11-06 22:46:45,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:45,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:46:45,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:46:45,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:46:45,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:46:45,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:46:45,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:46:45,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:46:45,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45" (1/1) ... [2023-11-06 22:46:45,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:45,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:45,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:46:45,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:46:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:46:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:46:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:46:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:46:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:46:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:46:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:46:45,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:46:45,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:46:45,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:46:45,944 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:46:45,946 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:46:46,542 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:46:46,550 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:46:46,550 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-06 22:46:46,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:46 BoogieIcfgContainer [2023-11-06 22:46:46,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:46:46,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:46:46,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:46:46,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:46:46,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:46:45" (1/3) ... [2023-11-06 22:46:46,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ebbeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:46, skipping insertion in model container [2023-11-06 22:46:46,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:45" (2/3) ... [2023-11-06 22:46:46,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ebbeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:46, skipping insertion in model container [2023-11-06 22:46:46,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:46" (3/3) ... [2023-11-06 22:46:46,585 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2023-11-06 22:46:46,605 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:46:46,605 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2023-11-06 22:46:46,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:46:46,663 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;@135c095a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:46:46,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2023-11-06 22:46:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 82 states have (on average 2.097560975609756) internal successors, (172), 154 states have internal predecessors, (172), 0 states have call successors, (0), 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-06 22:46:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:46:46,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:46,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:46:46,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:46,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-11-06 22:46:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:46,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519482035] [2023-11-06 22:46:46,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:46,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:46,954 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-06 22:46:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:46,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519482035] [2023-11-06 22:46:46,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519482035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:46,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:46,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:46:46,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754020414] [2023-11-06 22:46:46,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:46,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:46,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:46,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:46,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:46,996 INFO L87 Difference]: Start difference. First operand has 155 states, 82 states have (on average 2.097560975609756) internal successors, (172), 154 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:47,229 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2023-11-06 22:46:47,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:47,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-06 22:46:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:47,246 INFO L225 Difference]: With dead ends: 153 [2023-11-06 22:46:47,246 INFO L226 Difference]: Without dead ends: 151 [2023-11-06 22:46:47,249 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-06 22:46:47,252 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:47,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 88 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:46:47,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-06 22:46:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2023-11-06 22:46:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 83 states have (on average 1.891566265060241) internal successors, (157), 144 states have internal predecessors, (157), 0 states have call successors, (0), 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-06 22:46:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2023-11-06 22:46:47,301 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 3 [2023-11-06 22:46:47,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:47,302 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2023-11-06 22:46:47,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2023-11-06 22:46:47,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:46:47,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:47,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:46:47,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:46:47,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:47,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:47,305 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-11-06 22:46:47,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:47,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132955203] [2023-11-06 22:46:47,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:47,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:47,399 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-06 22:46:47,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:47,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132955203] [2023-11-06 22:46:47,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132955203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:47,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:47,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:46:47,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708048004] [2023-11-06 22:46:47,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:47,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:47,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:47,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:47,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:47,404 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:47,542 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2023-11-06 22:46:47,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-06 22:46:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:47,545 INFO L225 Difference]: With dead ends: 140 [2023-11-06 22:46:47,545 INFO L226 Difference]: Without dead ends: 140 [2023-11-06 22:46:47,545 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-06 22:46:47,547 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 114 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:47,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 101 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:46:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-06 22:46:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2023-11-06 22:46:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.783132530120482) internal successors, (148), 135 states have internal predecessors, (148), 0 states have call successors, (0), 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-06 22:46:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2023-11-06 22:46:47,560 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 3 [2023-11-06 22:46:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:47,561 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2023-11-06 22:46:47,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2023-11-06 22:46:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:46:47,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:47,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:47,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:46:47,563 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:47,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:47,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656077, now seen corresponding path program 1 times [2023-11-06 22:46:47,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:47,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945814511] [2023-11-06 22:46:47,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:47,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:47,859 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-06 22:46:47,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:47,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945814511] [2023-11-06 22:46:47,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945814511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:47,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:47,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:47,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092387169] [2023-11-06 22:46:47,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:47,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:46:47,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:47,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:46:47,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:46:47,866 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:48,165 INFO L93 Difference]: Finished difference Result 181 states and 198 transitions. [2023-11-06 22:46:48,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:46:48,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 22:46:48,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:48,168 INFO L225 Difference]: With dead ends: 181 [2023-11-06 22:46:48,168 INFO L226 Difference]: Without dead ends: 181 [2023-11-06 22:46:48,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:48,170 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 53 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:48,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 334 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:46:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-06 22:46:48,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 135. [2023-11-06 22:46:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 83 states have (on average 1.7710843373493976) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 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-06 22:46:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2023-11-06 22:46:48,182 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 12 [2023-11-06 22:46:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:48,183 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2023-11-06 22:46:48,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2023-11-06 22:46:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:46:48,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:48,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:48,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:46:48,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:48,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:48,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656076, now seen corresponding path program 1 times [2023-11-06 22:46:48,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:48,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300306174] [2023-11-06 22:46:48,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:48,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:48,501 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-06 22:46:48,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:48,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300306174] [2023-11-06 22:46:48,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300306174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:48,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:48,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:48,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150700509] [2023-11-06 22:46:48,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:48,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:46:48,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:48,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:46:48,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:46:48,507 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:48,761 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2023-11-06 22:46:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:46:48,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 22:46:48,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:48,764 INFO L225 Difference]: With dead ends: 134 [2023-11-06 22:46:48,764 INFO L226 Difference]: Without dead ends: 134 [2023-11-06 22:46:48,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:48,765 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 3 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:48,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 370 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:46:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-06 22:46:48,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-11-06 22:46:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 83 states have (on average 1.7590361445783131) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 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-06 22:46:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-11-06 22:46:48,775 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 12 [2023-11-06 22:46:48,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:48,775 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-11-06 22:46:48,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2023-11-06 22:46:48,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:46:48,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:48,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:48,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:46:48,777 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:48,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:48,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115696, now seen corresponding path program 1 times [2023-11-06 22:46:48,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:48,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927311114] [2023-11-06 22:46:48,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:48,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:48,919 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-06 22:46:48,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:48,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927311114] [2023-11-06 22:46:48,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927311114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:48,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:48,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293162852] [2023-11-06 22:46:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:48,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:48,923 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-06 22:46:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:49,144 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2023-11-06 22:46:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:46:49,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-06 22:46:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:49,146 INFO L225 Difference]: With dead ends: 135 [2023-11-06 22:46:49,146 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 22:46:49,147 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-06 22:46:49,148 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 188 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:49,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 76 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:46:49,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 22:46:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2023-11-06 22:46:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 125 states have internal predecessors, (143), 0 states have call successors, (0), 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-06 22:46:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2023-11-06 22:46:49,162 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 13 [2023-11-06 22:46:49,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:49,162 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2023-11-06 22:46:49,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-06 22:46:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2023-11-06 22:46:49,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:46:49,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:49,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:49,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:46:49,165 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:49,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:49,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115697, now seen corresponding path program 1 times [2023-11-06 22:46:49,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:49,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131832257] [2023-11-06 22:46:49,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:49,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:49,356 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-06 22:46:49,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:49,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131832257] [2023-11-06 22:46:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131832257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:49,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:49,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:49,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110968725] [2023-11-06 22:46:49,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:49,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:49,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:49,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:49,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:49,359 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-06 22:46:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:49,584 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2023-11-06 22:46:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:46:49,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-06 22:46:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:49,586 INFO L225 Difference]: With dead ends: 184 [2023-11-06 22:46:49,586 INFO L226 Difference]: Without dead ends: 184 [2023-11-06 22:46:49,586 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-06 22:46:49,587 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 193 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:49,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 120 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:46:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-11-06 22:46:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 157. [2023-11-06 22:46:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 120 states have (on average 1.5333333333333334) internal successors, (184), 156 states have internal predecessors, (184), 0 states have call successors, (0), 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-06 22:46:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 184 transitions. [2023-11-06 22:46:49,595 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 184 transitions. Word has length 13 [2023-11-06 22:46:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:49,595 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 184 transitions. [2023-11-06 22:46:49,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-06 22:46:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 184 transitions. [2023-11-06 22:46:49,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:46:49,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:49,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:49,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:46:49,598 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:49,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash -288943149, now seen corresponding path program 1 times [2023-11-06 22:46:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:49,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025848281] [2023-11-06 22:46:49,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:49,745 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-06 22:46:49,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:49,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025848281] [2023-11-06 22:46:49,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025848281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:49,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:49,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:49,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520891483] [2023-11-06 22:46:49,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:49,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:46:49,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:49,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:46:49,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:46:49,749 INFO L87 Difference]: Start difference. First operand 157 states and 184 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-06 22:46:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:49,927 INFO L93 Difference]: Finished difference Result 156 states and 182 transitions. [2023-11-06 22:46:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:46:49,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-11-06 22:46:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:49,929 INFO L225 Difference]: With dead ends: 156 [2023-11-06 22:46:49,929 INFO L226 Difference]: Without dead ends: 156 [2023-11-06 22:46:49,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:49,933 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 10 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:49,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 312 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:46:49,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-06 22:46:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2023-11-06 22:46:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 120 states have (on average 1.5166666666666666) internal successors, (182), 155 states have internal predecessors, (182), 0 states have call successors, (0), 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-06 22:46:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 182 transitions. [2023-11-06 22:46:49,941 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 182 transitions. Word has length 16 [2023-11-06 22:46:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:49,942 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 182 transitions. [2023-11-06 22:46:49,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-06 22:46:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 182 transitions. [2023-11-06 22:46:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:46:49,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:49,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:49,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:46:49,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:49,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash -288943148, now seen corresponding path program 1 times [2023-11-06 22:46:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:49,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216770157] [2023-11-06 22:46:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:50,228 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-06 22:46:50,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:50,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216770157] [2023-11-06 22:46:50,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216770157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:50,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:50,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:50,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741293985] [2023-11-06 22:46:50,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:50,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:46:50,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:50,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:46:50,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:46:50,231 INFO L87 Difference]: Start difference. First operand 156 states and 182 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-06 22:46:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:50,453 INFO L93 Difference]: Finished difference Result 155 states and 180 transitions. [2023-11-06 22:46:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:46:50,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-11-06 22:46:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:50,455 INFO L225 Difference]: With dead ends: 155 [2023-11-06 22:46:50,455 INFO L226 Difference]: Without dead ends: 155 [2023-11-06 22:46:50,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:50,457 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 5 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:50,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 303 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:46:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-06 22:46:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2023-11-06 22:46:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 120 states have (on average 1.5) internal successors, (180), 154 states have internal predecessors, (180), 0 states have call successors, (0), 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-06 22:46:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2023-11-06 22:46:50,462 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 180 transitions. Word has length 16 [2023-11-06 22:46:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:50,463 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 180 transitions. [2023-11-06 22:46:50,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-06 22:46:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 180 transitions. [2023-11-06 22:46:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:46:50,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:50,465 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-06 22:46:50,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:46:50,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:50,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1504578714, now seen corresponding path program 1 times [2023-11-06 22:46:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158798119] [2023-11-06 22:46:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:50,514 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-06 22:46:50,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:50,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158798119] [2023-11-06 22:46:50,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158798119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:50,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:50,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:50,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922915865] [2023-11-06 22:46:50,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:50,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:50,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:50,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:50,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:50,518 INFO L87 Difference]: Start difference. First operand 155 states and 180 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:50,670 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2023-11-06 22:46:50,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:46:50,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-06 22:46:50,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:50,672 INFO L225 Difference]: With dead ends: 175 [2023-11-06 22:46:50,673 INFO L226 Difference]: Without dead ends: 175 [2023-11-06 22:46:50,673 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-06 22:46:50,674 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 179 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:50,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 170 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:46:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-06 22:46:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 155. [2023-11-06 22:46:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 120 states have (on average 1.4833333333333334) internal successors, (178), 154 states have internal predecessors, (178), 0 states have call successors, (0), 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-06 22:46:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2023-11-06 22:46:50,680 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 18 [2023-11-06 22:46:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:50,681 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2023-11-06 22:46:50,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2023-11-06 22:46:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 22:46:50,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:50,682 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] [2023-11-06 22:46:50,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:46:50,683 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:50,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:50,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394517, now seen corresponding path program 1 times [2023-11-06 22:46:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:50,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154802349] [2023-11-06 22:46:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:51,079 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-06 22:46:51,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:51,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154802349] [2023-11-06 22:46:51,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154802349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:51,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:51,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:46:51,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604669440] [2023-11-06 22:46:51,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:51,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:46:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:51,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:46:51,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:46:51,082 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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-06 22:46:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:51,466 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2023-11-06 22:46:51,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:46:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-11-06 22:46:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:51,470 INFO L225 Difference]: With dead ends: 156 [2023-11-06 22:46:51,470 INFO L226 Difference]: Without dead ends: 156 [2023-11-06 22:46:51,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:46:51,472 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 181 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:51,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 219 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:46:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-06 22:46:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2023-11-06 22:46:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 120 states have (on average 1.475) internal successors, (177), 153 states have internal predecessors, (177), 0 states have call successors, (0), 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-06 22:46:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2023-11-06 22:46:51,478 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 20 [2023-11-06 22:46:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:51,478 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2023-11-06 22:46:51,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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-06 22:46:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2023-11-06 22:46:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 22:46:51,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:51,480 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] [2023-11-06 22:46:51,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:46:51,480 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:51,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:51,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394518, now seen corresponding path program 1 times [2023-11-06 22:46:51,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:51,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450990937] [2023-11-06 22:46:51,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:51,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:51,927 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-06 22:46:51,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:51,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450990937] [2023-11-06 22:46:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450990937] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:51,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:51,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:46:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920926663] [2023-11-06 22:46:51,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:51,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:46:51,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:51,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:46:51,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:46:51,930 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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-06 22:46:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:52,642 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2023-11-06 22:46:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:46:52,642 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-11-06 22:46:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:52,644 INFO L225 Difference]: With dead ends: 147 [2023-11-06 22:46:52,644 INFO L226 Difference]: Without dead ends: 147 [2023-11-06 22:46:52,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:46:52,645 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 179 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:52,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 314 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:46:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-06 22:46:52,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2023-11-06 22:46:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 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-06 22:46:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2023-11-06 22:46:52,650 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 20 [2023-11-06 22:46:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:52,650 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2023-11-06 22:46:52,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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-06 22:46:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2023-11-06 22:46:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:46:52,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:52,652 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-06 22:46:52,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:46:52,653 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:52,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1737058081, now seen corresponding path program 1 times [2023-11-06 22:46:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:52,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695161482] [2023-11-06 22:46:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:52,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:52,703 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-06 22:46:52,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:52,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695161482] [2023-11-06 22:46:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695161482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:52,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:52,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:52,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174658219] [2023-11-06 22:46:52,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:52,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:52,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:52,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:52,706 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:52,732 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2023-11-06 22:46:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:46:52,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-06 22:46:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:52,734 INFO L225 Difference]: With dead ends: 161 [2023-11-06 22:46:52,734 INFO L226 Difference]: Without dead ends: 161 [2023-11-06 22:46:52,735 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-06 22:46:52,736 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 21 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:52,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 319 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:46:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-11-06 22:46:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2023-11-06 22:46:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 138 states have internal predecessors, (161), 0 states have call successors, (0), 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-06 22:46:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2023-11-06 22:46:52,745 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 21 [2023-11-06 22:46:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:52,746 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2023-11-06 22:46:52,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2023-11-06 22:46:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 22:46:52,747 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:52,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:52,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:46:52,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:52,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462334, now seen corresponding path program 1 times [2023-11-06 22:46:52,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:52,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749831] [2023-11-06 22:46:52,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:52,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:52,949 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-06 22:46:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:52,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749831] [2023-11-06 22:46:52,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:52,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:52,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:46:52,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714557444] [2023-11-06 22:46:52,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:52,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:46:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:52,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:46:52,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:52,953 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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-06 22:46:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:53,324 INFO L93 Difference]: Finished difference Result 263 states and 306 transitions. [2023-11-06 22:46:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:46:53,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-11-06 22:46:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:53,326 INFO L225 Difference]: With dead ends: 263 [2023-11-06 22:46:53,327 INFO L226 Difference]: Without dead ends: 263 [2023-11-06 22:46:53,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:46:53,328 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 164 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:53,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 340 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:46:53,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-11-06 22:46:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 153. [2023-11-06 22:46:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 130 states have (on average 1.376923076923077) internal successors, (179), 152 states have internal predecessors, (179), 0 states have call successors, (0), 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-06 22:46:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2023-11-06 22:46:53,333 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 23 [2023-11-06 22:46:53,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:53,334 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2023-11-06 22:46:53,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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-06 22:46:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2023-11-06 22:46:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 22:46:53,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:53,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:53,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:46:53,335 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:53,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462335, now seen corresponding path program 1 times [2023-11-06 22:46:53,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:53,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387175652] [2023-11-06 22:46:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:53,534 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-06 22:46:53,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:53,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387175652] [2023-11-06 22:46:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387175652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:53,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:53,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:46:53,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348014657] [2023-11-06 22:46:53,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:53,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:46:53,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:53,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:46:53,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:53,537 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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-06 22:46:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:54,004 INFO L93 Difference]: Finished difference Result 271 states and 317 transitions. [2023-11-06 22:46:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:46:54,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-11-06 22:46:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:54,007 INFO L225 Difference]: With dead ends: 271 [2023-11-06 22:46:54,007 INFO L226 Difference]: Without dead ends: 271 [2023-11-06 22:46:54,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:46:54,008 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 169 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:54,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 476 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:46:54,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-11-06 22:46:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 149. [2023-11-06 22:46:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 126 states have (on average 1.373015873015873) internal successors, (173), 148 states have internal predecessors, (173), 0 states have call successors, (0), 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-06 22:46:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2023-11-06 22:46:54,014 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 23 [2023-11-06 22:46:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:54,015 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2023-11-06 22:46:54,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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-06 22:46:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2023-11-06 22:46:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:46:54,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:54,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:54,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:46:54,017 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:54,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1096320795, now seen corresponding path program 1 times [2023-11-06 22:46:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:54,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321428301] [2023-11-06 22:46:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:54,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:54,059 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-06 22:46:54,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:54,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321428301] [2023-11-06 22:46:54,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321428301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:54,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:54,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:54,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688349142] [2023-11-06 22:46:54,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:54,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:54,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:54,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:54,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:54,062 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-06 22:46:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:54,092 INFO L93 Difference]: Finished difference Result 151 states and 175 transitions. [2023-11-06 22:46:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:54,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 24 [2023-11-06 22:46:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:54,094 INFO L225 Difference]: With dead ends: 151 [2023-11-06 22:46:54,094 INFO L226 Difference]: Without dead ends: 151 [2023-11-06 22:46:54,095 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-06 22:46:54,095 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:54,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:46:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-06 22:46:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2023-11-06 22:46:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 128 states have (on average 1.3671875) internal successors, (175), 150 states have internal predecessors, (175), 0 states have call successors, (0), 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-06 22:46:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2023-11-06 22:46:54,101 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 24 [2023-11-06 22:46:54,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:54,101 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2023-11-06 22:46:54,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-06 22:46:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2023-11-06 22:46:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 22:46:54,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:54,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:54,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:46:54,103 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:54,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:54,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1246771008, now seen corresponding path program 1 times [2023-11-06 22:46:54,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:54,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374586160] [2023-11-06 22:46:54,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:54,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:54,348 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-06 22:46:54,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374586160] [2023-11-06 22:46:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374586160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:54,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:46:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106014895] [2023-11-06 22:46:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:54,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:46:54,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:54,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:46:54,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:54,350 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:54,742 INFO L93 Difference]: Finished difference Result 227 states and 258 transitions. [2023-11-06 22:46:54,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:46:54,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-06 22:46:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:54,744 INFO L225 Difference]: With dead ends: 227 [2023-11-06 22:46:54,744 INFO L226 Difference]: Without dead ends: 227 [2023-11-06 22:46:54,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:46:54,745 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 185 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:54,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 381 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:46:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-11-06 22:46:54,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 157. [2023-11-06 22:46:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 134 states have (on average 1.3582089552238805) internal successors, (182), 156 states have internal predecessors, (182), 0 states have call successors, (0), 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-06 22:46:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2023-11-06 22:46:54,751 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 26 [2023-11-06 22:46:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:54,751 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2023-11-06 22:46:54,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2023-11-06 22:46:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:46:54,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:54,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:54,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:46:54,753 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:54,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash 729704446, now seen corresponding path program 1 times [2023-11-06 22:46:54,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:54,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728483187] [2023-11-06 22:46:54,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:54,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:55,066 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-06 22:46:55,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:55,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728483187] [2023-11-06 22:46:55,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728483187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:55,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:55,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:46:55,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66089848] [2023-11-06 22:46:55,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:55,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:46:55,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:55,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:46:55,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:46:55,069 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-06 22:46:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:55,692 INFO L93 Difference]: Finished difference Result 322 states and 369 transitions. [2023-11-06 22:46:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:46:55,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-06 22:46:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:55,697 INFO L225 Difference]: With dead ends: 322 [2023-11-06 22:46:55,697 INFO L226 Difference]: Without dead ends: 322 [2023-11-06 22:46:55,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:46:55,698 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 368 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:55,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 467 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:46:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-06 22:46:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 170. [2023-11-06 22:46:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.3537414965986394) internal successors, (199), 169 states have internal predecessors, (199), 0 states have call successors, (0), 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-06 22:46:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 199 transitions. [2023-11-06 22:46:55,705 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 199 transitions. Word has length 27 [2023-11-06 22:46:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:55,705 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 199 transitions. [2023-11-06 22:46:55,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-06 22:46:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 199 transitions. [2023-11-06 22:46:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:46:55,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:55,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:55,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:46:55,707 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:55,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:55,707 INFO L85 PathProgramCache]: Analyzing trace with hash 729704447, now seen corresponding path program 1 times [2023-11-06 22:46:55,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:55,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424742965] [2023-11-06 22:46:55,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:55,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:56,236 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-06 22:46:56,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:56,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424742965] [2023-11-06 22:46:56,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424742965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:56,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:56,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:46:56,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643532393] [2023-11-06 22:46:56,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:56,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:46:56,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:56,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:46:56,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:46:56,239 INFO L87 Difference]: Start difference. First operand 170 states and 199 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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-06 22:46:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:56,938 INFO L93 Difference]: Finished difference Result 254 states and 290 transitions. [2023-11-06 22:46:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:46:56,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-06 22:46:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:56,940 INFO L225 Difference]: With dead ends: 254 [2023-11-06 22:46:56,941 INFO L226 Difference]: Without dead ends: 254 [2023-11-06 22:46:56,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:46:56,942 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 226 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:56,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 540 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:46:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-06 22:46:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 170. [2023-11-06 22:46:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.346938775510204) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 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-06 22:46:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2023-11-06 22:46:56,947 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 27 [2023-11-06 22:46:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:56,947 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2023-11-06 22:46:56,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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-06 22:46:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2023-11-06 22:46:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:46:56,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:56,948 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] [2023-11-06 22:46:56,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:46:56,948 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:56,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1236719659, now seen corresponding path program 1 times [2023-11-06 22:46:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:56,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863220154] [2023-11-06 22:46:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:56,999 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-06 22:46:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863220154] [2023-11-06 22:46:57,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863220154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:57,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:57,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:57,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033034631] [2023-11-06 22:46:57,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:57,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:57,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:57,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:57,003 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-06 22:46:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:57,023 INFO L93 Difference]: Finished difference Result 182 states and 211 transitions. [2023-11-06 22:46:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:46:57,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-06 22:46:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:57,025 INFO L225 Difference]: With dead ends: 182 [2023-11-06 22:46:57,025 INFO L226 Difference]: Without dead ends: 182 [2023-11-06 22:46:57,025 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-06 22:46:57,026 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 10 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:57,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 320 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:46:57,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-06 22:46:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2023-11-06 22:46:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 151 states have (on average 1.3311258278145695) internal successors, (201), 173 states have internal predecessors, (201), 0 states have call successors, (0), 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-06 22:46:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 201 transitions. [2023-11-06 22:46:57,031 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 201 transitions. Word has length 27 [2023-11-06 22:46:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:57,032 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 201 transitions. [2023-11-06 22:46:57,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-06 22:46:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 201 transitions. [2023-11-06 22:46:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:46:57,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:57,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:57,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:46:57,033 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:57,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:57,034 INFO L85 PathProgramCache]: Analyzing trace with hash 17756513, now seen corresponding path program 1 times [2023-11-06 22:46:57,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:57,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446809024] [2023-11-06 22:46:57,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:57,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:57,183 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-06 22:46:57,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:57,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446809024] [2023-11-06 22:46:57,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446809024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:57,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:57,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214795061] [2023-11-06 22:46:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:57,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:46:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:57,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:46:57,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:46:57,188 INFO L87 Difference]: Start difference. First operand 174 states and 201 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:57,386 INFO L93 Difference]: Finished difference Result 183 states and 211 transitions. [2023-11-06 22:46:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:46:57,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-06 22:46:57,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:57,388 INFO L225 Difference]: With dead ends: 183 [2023-11-06 22:46:57,388 INFO L226 Difference]: Without dead ends: 183 [2023-11-06 22:46:57,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:57,389 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 11 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:57,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:46:57,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-06 22:46:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 173. [2023-11-06 22:46:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 151 states have (on average 1.3245033112582782) internal successors, (200), 172 states have internal predecessors, (200), 0 states have call successors, (0), 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-06 22:46:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 200 transitions. [2023-11-06 22:46:57,395 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 200 transitions. Word has length 28 [2023-11-06 22:46:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:57,395 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 200 transitions. [2023-11-06 22:46:57,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 200 transitions. [2023-11-06 22:46:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:46:57,396 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:57,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:57,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:46:57,396 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:57,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash 17756514, now seen corresponding path program 1 times [2023-11-06 22:46:57,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:57,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701167126] [2023-11-06 22:46:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:57,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:57,680 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-06 22:46:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:57,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701167126] [2023-11-06 22:46:57,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701167126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:57,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:57,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:57,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431732182] [2023-11-06 22:46:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:57,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:46:57,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:57,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:46:57,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:46:57,683 INFO L87 Difference]: Start difference. First operand 173 states and 200 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:57,866 INFO L93 Difference]: Finished difference Result 172 states and 199 transitions. [2023-11-06 22:46:57,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:46:57,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-06 22:46:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:57,867 INFO L225 Difference]: With dead ends: 172 [2023-11-06 22:46:57,868 INFO L226 Difference]: Without dead ends: 172 [2023-11-06 22:46:57,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:57,869 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 3 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:57,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 286 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:46:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-06 22:46:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2023-11-06 22:46:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 151 states have (on average 1.3178807947019868) internal successors, (199), 171 states have internal predecessors, (199), 0 states have call successors, (0), 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-06 22:46:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2023-11-06 22:46:57,873 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 28 [2023-11-06 22:46:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:57,873 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2023-11-06 22:46:57,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2023-11-06 22:46:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 22:46:57,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:57,874 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-06 22:46:57,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:46:57,874 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:46:57,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:57,875 INFO L85 PathProgramCache]: Analyzing trace with hash 646841882, now seen corresponding path program 1 times [2023-11-06 22:46:57,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:57,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20657502] [2023-11-06 22:46:57,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:57,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:58,242 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-06 22:46:58,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:58,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20657502] [2023-11-06 22:46:58,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20657502] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:46:58,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143814897] [2023-11-06 22:46:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:58,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:46:58,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:58,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:46:58,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:46:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:58,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 22:46:58,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:46:58,489 INFO L351 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-06 22:46:58,494 INFO L351 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-06 22:46:58,529 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:46:58,538 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:46:58,632 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:46:58,633 INFO L351 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 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:46:58,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:46:58,726 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:46:58,726 INFO L351 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 22:46:58,743 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:46:59,111 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-06 22:46:59,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:46:59,842 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:46:59,848 INFO L351 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 14 treesize of output 12 [2023-11-06 22:46:59,857 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:46:59,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:46:59,873 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-06 22:46:59,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143814897] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:46:59,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:46:59,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 14 [2023-11-06 22:46:59,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653419339] [2023-11-06 22:46:59,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:46:59,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:46:59,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:59,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:46:59,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:46:59,876 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:00,686 INFO L93 Difference]: Finished difference Result 237 states and 268 transitions. [2023-11-06 22:47:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:47:00,687 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-06 22:47:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:00,688 INFO L225 Difference]: With dead ends: 237 [2023-11-06 22:47:00,688 INFO L226 Difference]: Without dead ends: 237 [2023-11-06 22:47:00,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:47:00,690 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 355 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:00,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 534 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:47:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-11-06 22:47:00,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 187. [2023-11-06 22:47:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 186 states have internal predecessors, (216), 0 states have call successors, (0), 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-06 22:47:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 216 transitions. [2023-11-06 22:47:00,695 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 216 transitions. Word has length 29 [2023-11-06 22:47:00,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:00,695 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 216 transitions. [2023-11-06 22:47:00,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 216 transitions. [2023-11-06 22:47:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:47:00,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:00,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:00,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:00,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:47:00,897 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:47:00,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:00,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1316889152, now seen corresponding path program 1 times [2023-11-06 22:47:00,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:00,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491862619] [2023-11-06 22:47:00,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:00,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,180 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-06 22:47:01,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:01,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491862619] [2023-11-06 22:47:01,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491862619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:01,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:01,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:47:01,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147625027] [2023-11-06 22:47:01,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:01,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:47:01,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:01,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:47:01,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:47:01,183 INFO L87 Difference]: Start difference. First operand 187 states and 216 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:01,875 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2023-11-06 22:47:01,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:47:01,875 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-06 22:47:01,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:01,877 INFO L225 Difference]: With dead ends: 225 [2023-11-06 22:47:01,877 INFO L226 Difference]: Without dead ends: 225 [2023-11-06 22:47:01,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:47:01,878 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 233 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:01,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 636 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:47:01,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-06 22:47:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 185. [2023-11-06 22:47:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 164 states have (on average 1.298780487804878) internal successors, (213), 184 states have internal predecessors, (213), 0 states have call successors, (0), 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-06 22:47:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 213 transitions. [2023-11-06 22:47:01,883 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 213 transitions. Word has length 30 [2023-11-06 22:47:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:01,883 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 213 transitions. [2023-11-06 22:47:01,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 213 transitions. [2023-11-06 22:47:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:47:01,886 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:01,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:01,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:47:01,887 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:47:01,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1678128637, now seen corresponding path program 1 times [2023-11-06 22:47:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:01,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792016868] [2023-11-06 22:47:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:01,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:02,098 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-06 22:47:02,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:02,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792016868] [2023-11-06 22:47:02,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792016868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:02,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:02,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:47:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676383299] [2023-11-06 22:47:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:02,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:47:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:02,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:47:02,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:47:02,101 INFO L87 Difference]: Start difference. First operand 185 states and 213 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:02,524 INFO L93 Difference]: Finished difference Result 233 states and 264 transitions. [2023-11-06 22:47:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:47:02,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-06 22:47:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:02,526 INFO L225 Difference]: With dead ends: 233 [2023-11-06 22:47:02,526 INFO L226 Difference]: Without dead ends: 233 [2023-11-06 22:47:02,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:47:02,527 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 84 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:02,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 456 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:47:02,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-06 22:47:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 191. [2023-11-06 22:47:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 190 states have internal predecessors, (220), 0 states have call successors, (0), 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-06 22:47:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2023-11-06 22:47:02,534 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 32 [2023-11-06 22:47:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:02,535 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2023-11-06 22:47:02,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2023-11-06 22:47:02,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:47:02,536 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:02,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:02,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:47:02,536 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:47:02,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:02,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1575471623, now seen corresponding path program 1 times [2023-11-06 22:47:02,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:02,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011228182] [2023-11-06 22:47:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:02,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,103 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-06 22:47:03,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:03,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011228182] [2023-11-06 22:47:03,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011228182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:03,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:03,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:47:03,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913383204] [2023-11-06 22:47:03,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:03,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:47:03,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:03,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:47:03,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:47:03,107 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 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-06 22:47:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:04,097 INFO L93 Difference]: Finished difference Result 229 states and 255 transitions. [2023-11-06 22:47:04,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:47:04,097 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 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 35 [2023-11-06 22:47:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:04,099 INFO L225 Difference]: With dead ends: 229 [2023-11-06 22:47:04,099 INFO L226 Difference]: Without dead ends: 229 [2023-11-06 22:47:04,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:47:04,100 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 205 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:04,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 753 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:47:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-06 22:47:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 188. [2023-11-06 22:47:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 167 states have (on average 1.2874251497005988) internal successors, (215), 187 states have internal predecessors, (215), 0 states have call successors, (0), 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-06 22:47:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2023-11-06 22:47:04,106 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 35 [2023-11-06 22:47:04,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:04,106 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2023-11-06 22:47:04,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 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-06 22:47:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2023-11-06 22:47:04,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 22:47:04,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:04,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:04,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 22:47:04,108 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:47:04,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:04,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2071072198, now seen corresponding path program 1 times [2023-11-06 22:47:04,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:04,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640690210] [2023-11-06 22:47:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:47:04,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:04,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640690210] [2023-11-06 22:47:04,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640690210] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:04,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:04,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:47:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628182017] [2023-11-06 22:47:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:04,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:04,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:04,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:04,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:04,187 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-06 22:47:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:04,340 INFO L93 Difference]: Finished difference Result 206 states and 227 transitions. [2023-11-06 22:47:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:04,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-06 22:47:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:04,342 INFO L225 Difference]: With dead ends: 206 [2023-11-06 22:47:04,342 INFO L226 Difference]: Without dead ends: 206 [2023-11-06 22:47:04,342 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-06 22:47:04,343 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 128 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:04,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 138 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:47:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-06 22:47:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 190. [2023-11-06 22:47:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.2840236686390532) internal successors, (217), 189 states have internal predecessors, (217), 0 states have call successors, (0), 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-06 22:47:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 217 transitions. [2023-11-06 22:47:04,356 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 217 transitions. Word has length 36 [2023-11-06 22:47:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:04,356 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 217 transitions. [2023-11-06 22:47:04,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-06 22:47:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2023-11-06 22:47:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 22:47:04,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:04,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:04,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 22:47:04,358 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:47:04,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:04,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2071061213, now seen corresponding path program 1 times [2023-11-06 22:47:04,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:04,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385057864] [2023-11-06 22:47:04,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:04,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:47:04,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:04,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385057864] [2023-11-06 22:47:04,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385057864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:04,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:04,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:47:04,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080725751] [2023-11-06 22:47:04,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:04,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:47:04,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:04,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:47:04,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:47:04,575 INFO L87 Difference]: Start difference. First operand 190 states and 217 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-06 22:47:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:04,842 INFO L93 Difference]: Finished difference Result 236 states and 266 transitions. [2023-11-06 22:47:04,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:47:04,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-06 22:47:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:04,845 INFO L225 Difference]: With dead ends: 236 [2023-11-06 22:47:04,845 INFO L226 Difference]: Without dead ends: 236 [2023-11-06 22:47:04,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:47:04,846 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 215 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:04,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 277 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:47:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-11-06 22:47:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 207. [2023-11-06 22:47:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 186 states have (on average 1.2634408602150538) internal successors, (235), 206 states have internal predecessors, (235), 0 states have call successors, (0), 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-06 22:47:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 235 transitions. [2023-11-06 22:47:04,852 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 235 transitions. Word has length 36 [2023-11-06 22:47:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:04,853 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 235 transitions. [2023-11-06 22:47:04,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-06 22:47:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 235 transitions. [2023-11-06 22:47:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:47:04,854 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:04,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:04,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 22:47:04,855 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:47:04,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash -221611581, now seen corresponding path program 1 times [2023-11-06 22:47:04,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:04,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82780548] [2023-11-06 22:47:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:05,201 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-06 22:47:05,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:05,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82780548] [2023-11-06 22:47:05,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82780548] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:47:05,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529042037] [2023-11-06 22:47:05,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:05,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:47:05,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:05,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:47:05,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:47:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:05,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 22:47:05,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:05,386 INFO L351 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-06 22:47:05,410 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:47:05,606 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-06 22:47:05,606 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:47:06,090 INFO L351 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 20 treesize of output 18 [2023-11-06 22:47:06,100 INFO L351 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 46 treesize of output 42 [2023-11-06 22:47:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:06,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529042037] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:47:06,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:47:06,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 8] total 22 [2023-11-06 22:47:06,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642768112] [2023-11-06 22:47:06,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:06,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:47:06,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:06,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:47:06,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:47:06,139 INFO L87 Difference]: Start difference. First operand 207 states and 235 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 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-06 22:47:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:06,660 INFO L93 Difference]: Finished difference Result 220 states and 248 transitions. [2023-11-06 22:47:06,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:47:06,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-11-06 22:47:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:06,662 INFO L225 Difference]: With dead ends: 220 [2023-11-06 22:47:06,662 INFO L226 Difference]: Without dead ends: 220 [2023-11-06 22:47:06,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2023-11-06 22:47:06,663 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 204 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:06,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 553 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:47:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-06 22:47:06,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 205. [2023-11-06 22:47:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 184 states have (on average 1.2608695652173914) internal successors, (232), 204 states have internal predecessors, (232), 0 states have call successors, (0), 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-06 22:47:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 232 transitions. [2023-11-06 22:47:06,669 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 232 transitions. Word has length 37 [2023-11-06 22:47:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:06,669 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 232 transitions. [2023-11-06 22:47:06,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 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-06 22:47:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 232 transitions. [2023-11-06 22:47:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:47:06,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:06,672 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-06 22:47:06,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:06,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:47:06,877 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:47:06,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:06,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1898858598, now seen corresponding path program 1 times [2023-11-06 22:47:06,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:06,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860336824] [2023-11-06 22:47:06,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:06,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:07,742 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-06 22:47:07,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:07,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860336824] [2023-11-06 22:47:07,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860336824] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:47:07,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904115206] [2023-11-06 22:47:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:07,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:47:07,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:07,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:47:07,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:47:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:07,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-06 22:47:07,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:07,988 INFO L351 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-06 22:47:08,039 INFO L351 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-06 22:47:08,044 INFO L351 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-06 22:47:08,166 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:47:08,166 INFO L351 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-06 22:47:08,273 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-06 22:47:08,273 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2023-11-06 22:47:08,295 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:47:08,295 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:47:08,515 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:47:08,515 INFO L351 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 2 case distinctions, treesize of input 61 treesize of output 54 [2023-11-06 22:47:08,523 INFO L351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-11-06 22:47:08,905 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:47:08,906 INFO L351 Elim1Store]: Elim1 eliminated variable 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 74 treesize of output 57 [2023-11-06 22:47:08,920 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:47:08,920 INFO L351 Elim1Store]: Elim1 eliminated variable 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 81 treesize of output 74 [2023-11-06 22:47:09,144 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:47:09,145 INFO L351 Elim1Store]: Elim1 eliminated variable 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 74 treesize of output 57 [2023-11-06 22:47:09,162 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:47:09,162 INFO L351 Elim1Store]: Elim1 eliminated variable 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 81 treesize of output 74 [2023-11-06 22:47:09,237 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:47:09,237 INFO L351 Elim1Store]: Elim1 eliminated variable 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 74 treesize of output 57 [2023-11-06 22:47:09,251 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:47:09,251 INFO L351 Elim1Store]: Elim1 eliminated variable 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 81 treesize of output 74 [2023-11-06 22:47:09,673 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:47:09,673 INFO L351 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 59 treesize of output 59 [2023-11-06 22:47:10,064 INFO L351 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-06 22:47:10,114 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-06 22:47:10,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:47:10,447 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1040 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= 1 (select |c_#valid| .cse0)) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)))) (or (forall ((v_ArrVal_1040 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1039 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-11-06 22:47:10,542 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1039 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1040 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) 1))) (forall ((v_ArrVal_1040 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (or (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse1)))))) is different from false [2023-11-06 22:47:10,701 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1033))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1040 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) 1)) (forall ((v_ArrVal_1039 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1034) .cse1 v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1033))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1040)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| .cse3) 1)))))) is different from false [2023-11-06 22:47:10,729 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1033))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1040)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| .cse0) 1)))) (forall ((v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1033))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1040 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse4 .cse5 v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 1)) (forall ((v_ArrVal_1039 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1034) .cse5 v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))))))) is different from false [2023-11-06 22:47:10,786 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1033))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1040 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) 1)) (forall ((v_ArrVal_1039 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1034) .cse1 v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1033))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1040)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse4) (= (select |c_#valid| .cse4) 1)))))) is different from false [2023-11-06 22:47:11,433 INFO L322 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-11-06 22:47:11,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 61 [2023-11-06 22:47:11,460 INFO L322 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-11-06 22:47:11,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 68 [2023-11-06 22:47:11,485 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:47:11,486 INFO L351 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 368 treesize of output 246 [2023-11-06 22:47:11,510 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:47:11,510 INFO L351 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 53 treesize of output 53 [2023-11-06 22:47:11,519 INFO L351 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 18 treesize of output 14 [2023-11-06 22:47:11,531 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:47:11,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 59 [2023-11-06 22:47:11,539 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-06 22:47:11,547 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:47:11,601 INFO L322 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-11-06 22:47:11,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 68 [2023-11-06 22:47:11,610 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:47:11,610 INFO L351 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 271 treesize of output 185 [2023-11-06 22:47:11,622 INFO L351 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 32 treesize of output 24 [2023-11-06 22:47:11,631 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:47:11,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 51 [2023-11-06 22:47:11,854 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-06 22:47:11,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904115206] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:47:11,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:47:11,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 17] total 43 [2023-11-06 22:47:11,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609063332] [2023-11-06 22:47:11,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:47:11,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-06 22:47:11,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:11,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-06 22:47:11,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1251, Unknown=10, NotChecked=390, Total=1892 [2023-11-06 22:47:11,873 INFO L87 Difference]: Start difference. First operand 205 states and 232 transitions. Second operand has 44 states, 43 states have (on average 2.4651162790697674) internal successors, (106), 44 states have internal predecessors, (106), 0 states have call successors, (0), 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-06 22:47:14,292 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse4 (select .cse3 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1033))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1040 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) 1)) (forall ((v_ArrVal_1039 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1034) .cse1 v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (= .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 8) 0) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse5 (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1033))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1040)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse5) (= (select |c_#valid| .cse5) 1)))) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) 8) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-11-06 22:47:18,890 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse13 (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= (select |c_#valid| (select .cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) 1) (or (forall ((v_ArrVal_1039 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1040 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|) 0)) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse5 |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_1033))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1040 (Array Int Int))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9| 1) (select (select (store .cse2 .cse3 v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) 1)) (forall ((v_ArrVal_1039 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_1034) .cse3 v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_1040 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse6)))) (let ((.cse7 (select .cse5 .cse1))) (or (= (select |c_#valid| .cse7) 1) (and (= .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_9| Int)) (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse8 (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse5 |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_1033))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1040)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse8) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9| 1) .cse8) 1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|) 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_9| Int)) (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse10 (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_1033))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1040)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9| 1) .cse10) 1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|) 0)))) (forall ((v_ArrVal_1040 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse12) (= (select |c_#valid| .cse12) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|) 0)) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_1033))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1039 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_1034) .cse14 v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1040 (Array Int Int))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9| 1) (select (select (store .cse15 .cse14 v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) 1)))))))) (or (forall ((v_ArrVal_1039 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1040 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) 1)))))) is different from false [2023-11-06 22:47:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:24,921 INFO L93 Difference]: Finished difference Result 584 states and 650 transitions. [2023-11-06 22:47:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-06 22:47:24,922 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.4651162790697674) internal successors, (106), 44 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-11-06 22:47:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:24,925 INFO L225 Difference]: With dead ends: 584 [2023-11-06 22:47:24,925 INFO L226 Difference]: Without dead ends: 584 [2023-11-06 22:47:24,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1283, Invalid=5203, Unknown=22, NotChecked=1148, Total=7656 [2023-11-06 22:47:24,930 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 970 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 182 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 5512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 2832 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:24,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1928 Invalid, 5512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 2459 Invalid, 39 Unknown, 2832 Unchecked, 5.7s Time] [2023-11-06 22:47:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2023-11-06 22:47:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 257. [2023-11-06 22:47:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 236 states have (on average 1.2457627118644068) internal successors, (294), 256 states have internal predecessors, (294), 0 states have call successors, (0), 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-06 22:47:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 294 transitions. [2023-11-06 22:47:24,939 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 294 transitions. Word has length 38 [2023-11-06 22:47:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:24,939 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 294 transitions. [2023-11-06 22:47:24,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.4651162790697674) internal successors, (106), 44 states have internal predecessors, (106), 0 states have call successors, (0), 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-06 22:47:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 294 transitions. [2023-11-06 22:47:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 22:47:24,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:24,941 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-06 22:47:24,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:25,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-06 22:47:25,148 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:47:25,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:25,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2106907816, now seen corresponding path program 1 times [2023-11-06 22:47:25,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:25,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476495531] [2023-11-06 22:47:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:25,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476495531] [2023-11-06 22:47:25,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476495531] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:47:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279962358] [2023-11-06 22:47:25,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:25,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:47:25,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:25,484 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:47:25,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:47:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:25,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-06 22:47:25,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:26,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:47:26,769 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:47:26,769 INFO L351 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 38 treesize of output 41 [2023-11-06 22:47:26,792 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:47:26,793 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2023-11-06 22:47:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:27,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279962358] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:47:27,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:47:27,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2023-11-06 22:47:27,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978023385] [2023-11-06 22:47:27,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:47:27,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 22:47:27,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 22:47:27,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:47:27,376 INFO L87 Difference]: Start difference. First operand 257 states and 294 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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-06 22:47:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:29,156 INFO L93 Difference]: Finished difference Result 336 states and 372 transitions. [2023-11-06 22:47:29,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:47:29,157 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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-06 22:47:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:29,159 INFO L225 Difference]: With dead ends: 336 [2023-11-06 22:47:29,159 INFO L226 Difference]: Without dead ends: 336 [2023-11-06 22:47:29,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2023-11-06 22:47:29,160 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 659 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:29,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 786 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:47:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-11-06 22:47:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 276. [2023-11-06 22:47:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 255 states have (on average 1.2509803921568627) internal successors, (319), 275 states have internal predecessors, (319), 0 states have call successors, (0), 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-06 22:47:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 319 transitions. [2023-11-06 22:47:29,168 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 319 transitions. Word has length 39 [2023-11-06 22:47:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:29,168 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 319 transitions. [2023-11-06 22:47:29,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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-06 22:47:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 319 transitions. [2023-11-06 22:47:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 22:47:29,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:29,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:29,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:29,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:47:29,375 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:47:29,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:29,376 INFO L85 PathProgramCache]: Analyzing trace with hash 889632107, now seen corresponding path program 1 times [2023-11-06 22:47:29,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:29,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091448581] [2023-11-06 22:47:29,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:47:29,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:29,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091448581] [2023-11-06 22:47:29,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091448581] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:47:29,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569159858] [2023-11-06 22:47:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:29,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:47:29,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:29,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:47:29,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:47:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:29,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:47:29,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:29,824 INFO L351 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-06 22:47:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:47:29,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:47:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:47:29,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569159858] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:47:29,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:47:29,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-06 22:47:29,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531791935] [2023-11-06 22:47:29,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:47:29,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:47:29,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:29,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:47:29,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:47:29,997 INFO L87 Difference]: Start difference. First operand 276 states and 319 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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-06 22:47:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:30,403 INFO L93 Difference]: Finished difference Result 282 states and 324 transitions. [2023-11-06 22:47:30,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:30,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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-06 22:47:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:30,405 INFO L225 Difference]: With dead ends: 282 [2023-11-06 22:47:30,405 INFO L226 Difference]: Without dead ends: 252 [2023-11-06 22:47:30,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 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-06 22:47:30,406 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 31 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:30,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 242 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:47:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-11-06 22:47:30,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2023-11-06 22:47:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 231 states have (on average 1.2683982683982684) internal successors, (293), 251 states have internal predecessors, (293), 0 states have call successors, (0), 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-06 22:47:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 293 transitions. [2023-11-06 22:47:30,412 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 293 transitions. Word has length 40 [2023-11-06 22:47:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:30,413 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 293 transitions. [2023-11-06 22:47:30,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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-06 22:47:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 293 transitions. [2023-11-06 22:47:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:47:30,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:30,414 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:30,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:30,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:47:30,614 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:47:30,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:30,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1064649816, now seen corresponding path program 1 times [2023-11-06 22:47:30,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:30,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995210677] [2023-11-06 22:47:30,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:30,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:32,362 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-06 22:47:32,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:32,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995210677] [2023-11-06 22:47:32,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995210677] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:47:32,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360290643] [2023-11-06 22:47:32,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:32,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:47:32,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:32,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:47:32,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:47:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:32,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-06 22:47:32,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:32,556 INFO L351 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-06 22:47:32,662 INFO L351 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-06 22:47:32,676 INFO L351 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-06 22:47:32,883 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:47:32,884 INFO L351 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-06 22:47:32,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:47:32,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:47:33,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:47:33,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:47:33,155 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:47:33,155 INFO L351 Elim1Store]: Elim1 eliminated variable 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 48 treesize of output 43 [2023-11-06 22:47:33,162 INFO L351 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 31 treesize of output 16 [2023-11-06 22:47:33,471 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:47:33,471 INFO L351 Elim1Store]: Elim1 eliminated variable 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 31 treesize of output 22 [2023-11-06 22:47:33,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:47:33,486 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:47:33,644 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:47:33,645 INFO L351 Elim1Store]: Elim1 eliminated variable 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 31 treesize of output 22 [2023-11-06 22:47:33,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:47:33,659 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:47:33,713 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:47:33,713 INFO L351 Elim1Store]: Elim1 eliminated variable 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 48 treesize of output 43 [2023-11-06 22:47:33,724 INFO L351 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 31 treesize of output 16 [2023-11-06 22:47:34,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:47:34,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:47:34,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:47:34,198 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:47:34,198 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 22:47:34,219 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-06 22:47:34,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:47:34,666 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1282 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-11-06 22:47:34,790 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1277) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1276) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1283) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1276))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1282)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-11-06 22:47:34,975 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1276))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1282)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1277) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1276) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1283) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) is different from false [2023-11-06 22:47:37,323 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:47:37,333 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:47:37,334 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2023-11-06 22:47:37,341 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:47:37,355 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:47:37,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2023-11-06 22:47:37,364 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:47:37,365 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2023-11-06 22:47:37,374 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:47:37,379 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:47:37,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 100 [2023-11-06 22:47:37,387 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-06 22:47:37,392 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-06 22:47:37,397 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:47:37,413 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:47:37,414 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:47:37,417 INFO L322 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-06 22:47:37,418 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2023-11-06 22:47:37,512 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-06 22:47:37,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360290643] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:47:37,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:47:37,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 36 [2023-11-06 22:47:37,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231226150] [2023-11-06 22:47:37,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:47:37,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-06 22:47:37,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:37,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-06 22:47:37,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=886, Unknown=30, NotChecked=192, Total=1260 [2023-11-06 22:47:37,515 INFO L87 Difference]: Start difference. First operand 252 states and 293 transitions. Second operand has 36 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 36 states have internal predecessors, (110), 0 states have call successors, (0), 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-06 22:47:39,968 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_14| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_14|) 0)) (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_14|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_14| v_ArrVal_1276))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1282)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.base|)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select .cse3 8) 0) (exists ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (let ((.cse4 (select .cse5 |ULTIMATE.start_main_~x~0#1.offset|))) (and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= .cse4 |c_ULTIMATE.start_main_~head~0#1.base|)) (= .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse3 |ULTIMATE.start_main_~x~0#1.offset|) 0)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select .cse6 8) 0) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_14| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_14|) 0)) (forall ((v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_14| v_ArrVal_1277) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_14|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_14| v_ArrVal_1276) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1283) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= (select .cse1 8) |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1276))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1282)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1277) (select (select (store .cse8 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1276) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1283) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (= (select .cse3 0) 0) (= (select .cse5 8) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-11-06 22:47:40,466 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1283 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1283) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1282 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1282) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1277) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1276) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1283) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1276))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1282)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2023-11-06 22:47:40,744 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1283 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1283) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1282 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1282 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1282) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-11-06 22:47:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:43,854 INFO L93 Difference]: Finished difference Result 686 states and 783 transitions. [2023-11-06 22:47:43,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-06 22:47:43,854 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 36 states have internal predecessors, (110), 0 states have call successors, (0), 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-06 22:47:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:43,858 INFO L225 Difference]: With dead ends: 686 [2023-11-06 22:47:43,858 INFO L226 Difference]: Without dead ends: 686 [2023-11-06 22:47:43,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=647, Invalid=2995, Unknown=42, NotChecked=738, Total=4422 [2023-11-06 22:47:43,861 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 747 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 141 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 3370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 1427 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:43,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1744 Invalid, 3370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1784 Invalid, 18 Unknown, 1427 Unchecked, 4.0s Time] [2023-11-06 22:47:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2023-11-06 22:47:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 270. [2023-11-06 22:47:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 249 states have (on average 1.2730923694779117) internal successors, (317), 269 states have internal predecessors, (317), 0 states have call successors, (0), 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-06 22:47:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 317 transitions. [2023-11-06 22:47:43,870 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 317 transitions. Word has length 41 [2023-11-06 22:47:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:43,871 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 317 transitions. [2023-11-06 22:47:43,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 36 states have internal predecessors, (110), 0 states have call successors, (0), 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-06 22:47:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 317 transitions. [2023-11-06 22:47:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:47:43,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:43,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:43,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:44,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:47:44,078 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:47:44,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:44,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1774808160, now seen corresponding path program 1 times [2023-11-06 22:47:44,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:44,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313758934] [2023-11-06 22:47:44,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:44,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:44,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:44,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313758934] [2023-11-06 22:47:44,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313758934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:44,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:44,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:47:44,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465770420] [2023-11-06 22:47:44,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:44,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:47:44,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:44,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:47:44,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:47:44,561 INFO L87 Difference]: Start difference. First operand 270 states and 317 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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-06 22:47:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:45,506 INFO L93 Difference]: Finished difference Result 299 states and 345 transitions. [2023-11-06 22:47:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:47:45,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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-06 22:47:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:45,509 INFO L225 Difference]: With dead ends: 299 [2023-11-06 22:47:45,509 INFO L226 Difference]: Without dead ends: 294 [2023-11-06 22:47:45,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:47:45,510 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 186 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:45,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 374 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:47:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-11-06 22:47:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 266. [2023-11-06 22:47:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 245 states have (on average 1.273469387755102) internal successors, (312), 265 states have internal predecessors, (312), 0 states have call successors, (0), 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-06 22:47:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 312 transitions. [2023-11-06 22:47:45,517 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 312 transitions. Word has length 42 [2023-11-06 22:47:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:45,517 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 312 transitions. [2023-11-06 22:47:45,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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-06 22:47:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 312 transitions. [2023-11-06 22:47:45,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:47:45,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:45,519 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:45,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-06 22:47:45,519 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:47:45,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:45,520 INFO L85 PathProgramCache]: Analyzing trace with hash 25746790, now seen corresponding path program 1 times [2023-11-06 22:47:45,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:45,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176659283] [2023-11-06 22:47:45,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:46,572 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-06 22:47:46,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:46,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176659283] [2023-11-06 22:47:46,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176659283] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:47:46,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480604126] [2023-11-06 22:47:46,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:46,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:47:46,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:46,574 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:47:46,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:47:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:46,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-06 22:47:46,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:46,778 INFO L351 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-06 22:47:46,850 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:47:46,851 INFO L351 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-06 22:47:46,932 INFO L351 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-06 22:47:47,039 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:47:47,039 INFO L351 Elim1Store]: Elim1 eliminated variable 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-06 22:47:47,195 INFO L322 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-11-06 22:47:47,195 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-11-06 22:47:47,322 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-06 22:47:47,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-11-06 22:47:47,788 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:47:47,789 INFO L351 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 2 case distinctions, treesize of input 86 treesize of output 75 [2023-11-06 22:47:48,332 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:47:48,332 INFO L351 Elim1Store]: Elim1 eliminated variable 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 106 treesize of output 81 [2023-11-06 22:47:48,627 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:47:48,627 INFO L351 Elim1Store]: Elim1 eliminated variable 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 106 treesize of output 81 [2023-11-06 22:47:48,738 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:47:48,739 INFO L351 Elim1Store]: Elim1 eliminated variable 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 106 treesize of output 81 [2023-11-06 22:47:49,678 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:47:49,678 INFO L351 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 91 treesize of output 59 [2023-11-06 22:47:49,854 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-06 22:47:49,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:47:49,905 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1460 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1460) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-11-06 22:47:49,935 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1460 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1460) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-11-06 22:47:49,946 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1460 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1460) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-11-06 22:47:49,967 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1457))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1460)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-11-06 22:47:49,979 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1460 (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_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1457))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1460)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-11-06 22:47:50,002 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1457))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1460)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-11-06 22:47:50,019 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1460 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1457))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1460)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2023-11-06 22:47:50,045 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1460 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1457))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1460)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|) 0)))) is different from false [2023-11-06 22:47:50,077 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1460 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17| 1) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1453))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1457))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1460)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2023-11-06 22:47:50,170 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:47:50,182 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:47:50,182 INFO L351 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 52 treesize of output 52 [2023-11-06 22:47:50,188 INFO L351 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 58 treesize of output 54 [2023-11-06 22:47:50,194 INFO L351 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 64 treesize of output 56 [2023-11-06 22:47:50,203 INFO L351 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 50 [2023-11-06 22:47:50,211 INFO L351 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 16 treesize of output 12 [2023-11-06 22:47:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 22:47:50,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480604126] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:47:50,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:47:50,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 39 [2023-11-06 22:47:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437606292] [2023-11-06 22:47:50,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:47:50,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-06 22:47:50,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:50,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-06 22:47:50,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=777, Unknown=9, NotChecked=594, Total=1560 [2023-11-06 22:47:50,547 INFO L87 Difference]: Start difference. First operand 266 states and 312 transitions. Second operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 0 states have call successors, (0), 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-06 22:47:53,623 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) 8)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= (select |c_#valid| (select .cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) 1) (not (= .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1457))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1460)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 1)) (not (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse3)) (= (select |c_#valid| (select .cse0 .cse3)) 1))) is different from false [2023-11-06 22:48:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:00,166 INFO L93 Difference]: Finished difference Result 530 states and 608 transitions. [2023-11-06 22:48:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-06 22:48:00,167 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 0 states have call successors, (0), 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-06 22:48:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:00,169 INFO L225 Difference]: With dead ends: 530 [2023-11-06 22:48:00,169 INFO L226 Difference]: Without dead ends: 530 [2023-11-06 22:48:00,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=640, Invalid=2930, Unknown=10, NotChecked=1250, Total=4830 [2023-11-06 22:48:00,172 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 711 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 106 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 5463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 3586 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:00,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1490 Invalid, 5463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1763 Invalid, 8 Unknown, 3586 Unchecked, 4.6s Time] [2023-11-06 22:48:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2023-11-06 22:48:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 294. [2023-11-06 22:48:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 273 states have (on average 1.2673992673992673) internal successors, (346), 293 states have internal predecessors, (346), 0 states have call successors, (0), 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-06 22:48:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 346 transitions. [2023-11-06 22:48:00,181 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 346 transitions. Word has length 42 [2023-11-06 22:48:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:00,182 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 346 transitions. [2023-11-06 22:48:00,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 0 states have call successors, (0), 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-06 22:48:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 346 transitions. [2023-11-06 22:48:00,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:48:00,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:00,183 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:00,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:00,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-06 22:48:00,389 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:48:00,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash 25746791, now seen corresponding path program 1 times [2023-11-06 22:48:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:00,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407384130] [2023-11-06 22:48:00,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:02,774 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-06 22:48:02,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:02,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407384130] [2023-11-06 22:48:02,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407384130] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:48:02,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409775355] [2023-11-06 22:48:02,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:02,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:48:02,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:02,778 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:48:02,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:48:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:02,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-06 22:48:02,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:02,984 INFO L351 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-06 22:48:03,159 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:48:03,159 INFO L351 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-06 22:48:03,182 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:48:03,313 INFO L351 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-06 22:48:03,325 INFO L351 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-06 22:48:03,621 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:48:03,621 INFO L351 Elim1Store]: Elim1 eliminated variable 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 59 treesize of output 52 [2023-11-06 22:48:03,637 INFO L351 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-06 22:48:03,899 INFO L322 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-06 22:48:03,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-11-06 22:48:03,983 INFO L322 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-06 22:48:03,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-06 22:48:04,206 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-06 22:48:04,207 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-11-06 22:48:04,283 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:48:04,283 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:48:04,917 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:48:04,918 INFO L351 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 2 case distinctions, treesize of input 102 treesize of output 87 [2023-11-06 22:48:04,979 INFO L351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-11-06 22:48:05,781 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:48:05,781 INFO L351 Elim1Store]: Elim1 eliminated variable 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 113 treesize of output 88 [2023-11-06 22:48:05,816 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:48:05,816 INFO L351 Elim1Store]: Elim1 eliminated variable 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 120 treesize of output 113 [2023-11-06 22:48:06,276 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:48:06,276 INFO L351 Elim1Store]: Elim1 eliminated variable 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 113 treesize of output 88 [2023-11-06 22:48:06,317 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:48:06,317 INFO L351 Elim1Store]: Elim1 eliminated variable 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 120 treesize of output 113 [2023-11-06 22:48:06,468 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:48:06,468 INFO L351 Elim1Store]: Elim1 eliminated variable 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 113 treesize of output 88 [2023-11-06 22:48:06,497 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:48:06,498 INFO L351 Elim1Store]: Elim1 eliminated variable 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 120 treesize of output 113 [2023-11-06 22:48:07,906 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:48:07,907 INFO L351 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 98 treesize of output 66 [2023-11-06 22:48:07,940 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:48:07,941 INFO L351 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 62 treesize of output 62 [2023-11-06 22:48:08,280 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-06 22:48:08,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:48:08,628 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1611 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2023-11-06 22:48:08,737 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1611 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2023-11-06 22:48:09,097 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1606) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1605) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1605))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1606) .cse1 v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))))) is different from false [2023-11-06 22:48:09,126 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1606) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1605) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1605))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1606) .cse2 v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))))) is different from false [2023-11-06 22:48:09,167 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1605))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1606) .cse1 v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1606) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1605) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) is different from false [2023-11-06 22:48:14,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:48:14,828 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:48:14,828 INFO L351 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 104 treesize of output 104 [2023-11-06 22:48:14,835 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:48:14,848 INFO L351 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 48 treesize of output 44 [2023-11-06 22:48:14,860 INFO L351 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 45 treesize of output 41 [2023-11-06 22:48:14,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2023-11-06 22:48:14,891 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:48:14,978 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:48:14,995 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:48:14,996 INFO L351 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 252 treesize of output 252 [2023-11-06 22:48:15,003 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:48:15,021 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:48:15,021 INFO L351 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 154 treesize of output 144 [2023-11-06 22:48:15,035 INFO L351 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 86 treesize of output 82 [2023-11-06 22:48:15,057 INFO L351 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 146 treesize of output 140 [2023-11-06 22:48:15,071 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2023-11-06 22:48:15,088 INFO L351 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 101 treesize of output 97 [2023-11-06 22:48:15,103 INFO L351 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 126 treesize of output 118 [2023-11-06 22:48:15,118 INFO L351 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 110 treesize of output 98 [2023-11-06 22:48:15,135 INFO L351 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 22 treesize of output 18 [2023-11-06 22:48:15,150 INFO L351 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 18 treesize of output 14 [2023-11-06 22:48:18,232 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-06 22:48:18,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409775355] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:48:18,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:48:18,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 44 [2023-11-06 22:48:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209212243] [2023-11-06 22:48:18,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:48:18,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-06 22:48:18,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:18,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-06 22:48:18,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1333, Unknown=33, NotChecked=400, Total=1980 [2023-11-06 22:48:18,235 INFO L87 Difference]: Start difference. First operand 294 states and 346 transitions. Second operand has 45 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 45 states have internal predecessors, (124), 0 states have call successors, (0), 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-06 22:48:20,687 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse0 (select .cse3 .cse2)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (<= (+ .cse0 4) (select |c_#length| (select .cse1 .cse2))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_20| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|) 0)) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 |ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_20| v_ArrVal_1606) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse1 |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_20| v_ArrVal_1605) |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1605))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1606) .cse5 v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_20| Int)) (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse1 |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_20| v_ArrVal_1605))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 |ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_20| v_ArrVal_1606) .cse8 v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_20| 16) (select (select (store .cse9 .cse8 v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (<= 0 .cse0) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1606) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1605) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (= (select .cse3 0) 0)))) is different from false [2023-11-06 22:48:23,380 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse10 (select .cse6 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) 8)) (.cse12 (select |c_#length| .cse10)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse7 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (= (select |c_#length| .cse0) 16) (not (= .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select .cse1 8) 0) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1605))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1606) .cse3 v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)))))) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= .cse7 0) (not (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= (select .cse2 8) 0) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#length| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 16) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (let ((.cse8 (not (= .cse10 |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse11 (= .cse12 16))) (or (and .cse8 (exists ((v_subst_44 Int)) (let ((.cse9 (select .cse6 v_subst_44))) (and (not (= |c_ULTIMATE.start_main_~x~0#1.base| .cse9)) (= (select |c_#length| .cse9) 16) (not (= .cse10 .cse9)) (= (select .cse2 v_subst_44) 0)))) .cse11) (and .cse8 (exists ((v_arrayElimCell_98 Int)) (and (not (= .cse10 v_arrayElimCell_98)) (not (= v_arrayElimCell_98 |c_ULTIMATE.start_main_~x~0#1.base|)) (= 16 (select |c_#length| v_arrayElimCell_98)))) .cse11))) (<= 16 .cse12) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1606) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1605) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| .cse7) (= (select |c_#valid| .cse10) 1))))) is different from false [2023-11-06 22:48:24,088 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1611 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1611 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2023-11-06 22:48:41,116 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_1611 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1611 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1611) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1))) is different from false [2023-11-06 22:48:53,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:49:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:04,094 INFO L93 Difference]: Finished difference Result 789 states and 909 transitions. [2023-11-06 22:49:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-11-06 22:49:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 45 states have internal predecessors, (124), 0 states have call successors, (0), 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-06 22:49:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:04,099 INFO L225 Difference]: With dead ends: 789 [2023-11-06 22:49:04,099 INFO L226 Difference]: Without dead ends: 789 [2023-11-06 22:49:04,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 1956 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=966, Invalid=5310, Unknown=80, NotChecked=1476, Total=7832 [2023-11-06 22:49:04,102 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 1261 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 2977 mSolverCounterSat, 137 mSolverCounterUnsat, 62 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 6303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 2977 IncrementalHoareTripleChecker+Invalid, 62 IncrementalHoareTripleChecker+Unknown, 3127 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:04,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 2672 Invalid, 6303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 2977 Invalid, 62 Unknown, 3127 Unchecked, 23.2s Time] [2023-11-06 22:49:04,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2023-11-06 22:49:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 320. [2023-11-06 22:49:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 299 states have (on average 1.2608695652173914) internal successors, (377), 319 states have internal predecessors, (377), 0 states have call successors, (0), 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-06 22:49:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 377 transitions. [2023-11-06 22:49:04,115 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 377 transitions. Word has length 42 [2023-11-06 22:49:04,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:04,115 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 377 transitions. [2023-11-06 22:49:04,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 45 states have internal predecessors, (124), 0 states have call successors, (0), 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-06 22:49:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 377 transitions. [2023-11-06 22:49:04,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:49:04,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:04,116 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:04,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:04,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:04,334 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-06 22:49:04,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:04,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1117398886, now seen corresponding path program 1 times [2023-11-06 22:49:04,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:04,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681648776] [2023-11-06 22:49:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:04,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:06,927 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-06 22:49:06,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:06,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681648776] [2023-11-06 22:49:06,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681648776] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:06,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308759953] [2023-11-06 22:49:06,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:06,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:06,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:06,929 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:06,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcebfd3c-9f2a-4549-b450-04128eaa0bf7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:49:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:07,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-06 22:49:07,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:07,174 INFO L351 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-06 22:49:07,315 INFO L351 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-06 22:49:07,578 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:49:07,578 INFO L351 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-06 22:49:07,869 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-06 22:49:07,869 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2023-11-06 22:49:08,425 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:49:08,425 INFO L351 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 2 case distinctions, treesize of input 36 treesize of output 35 [2023-11-06 22:49:09,240 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:49:09,241 INFO L351 Elim1Store]: Elim1 eliminated variable 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 49 treesize of output 36 [2023-11-06 22:49:09,554 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:49:09,554 INFO L351 Elim1Store]: Elim1 eliminated variable 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 49 treesize of output 36 [2023-11-06 22:49:09,665 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:49:09,665 INFO L351 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-06 22:49:10,057 INFO L322 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2023-11-06 22:49:10,057 INFO L351 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 35 [2023-11-06 22:49:10,881 INFO L322 Elim1Store]: treesize reduction 56, result has 36.4 percent of original size [2023-11-06 22:49:10,882 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 106 [2023-11-06 22:49:11,376 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:49:11,420 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:11,424 INFO L351 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 74 treesize of output 71 [2023-11-06 22:49:11,766 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:49:18,582 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:18,583 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 415 treesize of output 412