./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:59:26,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:59:26,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:59:26,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:59:26,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:59:26,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:59:26,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:59:26,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:59:26,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:59:26,260 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:59:26,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:59:26,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:59:26,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:59:26,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:59:26,264 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:59:26,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:59:26,264 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:59:26,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:59:26,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:59:26,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:59:26,265 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:59:26,265 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:59:26,266 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:59:26,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:59:26,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:59:26,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:59:26,267 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:59:26,267 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:59:26,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:59:26,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:59:26,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:59:26,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:59:26,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:59:26,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:59:26,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:59:26,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:59:26,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:59:26,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:59:26,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:59:26,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:59:26,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:59:26,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:59:26,271 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d [2024-11-09 07:59:26,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:59:26,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:59:26,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:59:26,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:59:26,523 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:59:26,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2024-11-09 07:59:27,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:59:28,109 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:59:28,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2024-11-09 07:59:28,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13e073c7/88902cad4cdf4f858cc62bb04b4d816f/FLAGfbcc75393 [2024-11-09 07:59:28,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13e073c7/88902cad4cdf4f858cc62bb04b4d816f [2024-11-09 07:59:28,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:59:28,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:59:28,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:59:28,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:59:28,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:59:28,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:28,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7245f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28, skipping insertion in model container [2024-11-09 07:59:28,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:28,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:59:28,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:59:28,848 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:59:28,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:59:28,905 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:59:28,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28 WrapperNode [2024-11-09 07:59:28,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:59:28,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:59:28,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:59:28,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:59:28,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:28,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:28,947 INFO L138 Inliner]: procedures = 119, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2024-11-09 07:59:28,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:59:28,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:59:28,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:59:28,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:59:28,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:28,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:28,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:28,995 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2024-11-09 07:59:28,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:28,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:29,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:29,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:29,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:29,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:29,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:59:29,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:59:29,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:59:29,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:59:29,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (1/1) ... [2024-11-09 07:59:29,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:59:29,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:29,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:59:29,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:59:29,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:59:29,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:59:29,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:59:29,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:59:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:59:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:59:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:59:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:59:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:59:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:59:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:59:29,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:59:29,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:59:29,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:59:29,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:59:29,220 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:59:29,221 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:59:29,457 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2024-11-09 07:59:29,457 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:59:29,467 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:59:29,467 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-09 07:59:29,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:59:29 BoogieIcfgContainer [2024-11-09 07:59:29,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:59:29,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:59:29,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:59:29,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:59:29,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:59:28" (1/3) ... [2024-11-09 07:59:29,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f14936f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:59:29, skipping insertion in model container [2024-11-09 07:59:29,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:28" (2/3) ... [2024-11-09 07:59:29,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f14936f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:59:29, skipping insertion in model container [2024-11-09 07:59:29,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:59:29" (3/3) ... [2024-11-09 07:59:29,478 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2024-11-09 07:59:29,490 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:59:29,491 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2024-11-09 07:59:29,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:59:29,538 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@43688872, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:59:29,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2024-11-09 07:59:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 57 states have (on average 2.087719298245614) internal successors, (119), 102 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:29,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:59:29,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:29,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:59:29,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:29,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:29,554 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-09 07:59:29,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:29,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186071315] [2024-11-09 07:59:29,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:29,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:29,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186071315] [2024-11-09 07:59:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186071315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:29,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:59:29,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618259566] [2024-11-09 07:59:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:29,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:59:29,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:29,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:59:29,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:29,832 INFO L87 Difference]: Start difference. First operand has 103 states, 57 states have (on average 2.087719298245614) internal successors, (119), 102 states have internal predecessors, (119), 0 states have call successors, (0), 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) [2024-11-09 07:59:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:30,004 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2024-11-09 07:59:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:59:30,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 07:59:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:30,015 INFO L225 Difference]: With dead ends: 126 [2024-11-09 07:59:30,015 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 07:59:30,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:30,019 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 79 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:30,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 113 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 07:59:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 97. [2024-11-09 07:59:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 96 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2024-11-09 07:59:30,046 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 3 [2024-11-09 07:59:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:30,046 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2024-11-09 07:59:30,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2024-11-09 07:59:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:59:30,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:30,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:59:30,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:59:30,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:30,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:30,048 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-09 07:59:30,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:30,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224041093] [2024-11-09 07:59:30,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:30,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:30,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:30,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224041093] [2024-11-09 07:59:30,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224041093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:30,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:30,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:59:30,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112353488] [2024-11-09 07:59:30,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:30,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:59:30,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:30,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:59:30,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:30,136 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:30,243 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2024-11-09 07:59:30,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:59:30,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 07:59:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:30,245 INFO L225 Difference]: With dead ends: 122 [2024-11-09 07:59:30,245 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 07:59:30,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:30,246 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 79 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:30,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 109 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 07:59:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2024-11-09 07:59:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 94 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-11-09 07:59:30,258 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 3 [2024-11-09 07:59:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:30,259 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-11-09 07:59:30,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-11-09 07:59:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:59:30,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:30,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:30,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:59:30,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:30,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2024-11-09 07:59:30,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:30,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748841177] [2024-11-09 07:59:30,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:30,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:30,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:30,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748841177] [2024-11-09 07:59:30,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748841177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:30,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:30,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:59:30,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576101560] [2024-11-09 07:59:30,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:30,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:59:30,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:30,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:59:30,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:30,373 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:30,484 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2024-11-09 07:59:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:30,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 07:59:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:30,485 INFO L225 Difference]: With dead ends: 92 [2024-11-09 07:59:30,485 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 07:59:30,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:30,487 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 99 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:30,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 44 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 07:59:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-11-09 07:59:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2024-11-09 07:59:30,495 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 8 [2024-11-09 07:59:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:30,495 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2024-11-09 07:59:30,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2024-11-09 07:59:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:59:30,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:30,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:30,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:59:30,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:30,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2024-11-09 07:59:30,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:30,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214391568] [2024-11-09 07:59:30,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:30,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:30,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214391568] [2024-11-09 07:59:30,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214391568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:30,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:30,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:59:30,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184071870] [2024-11-09 07:59:30,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:30,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:59:30,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:59:30,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:30,614 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:30,749 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2024-11-09 07:59:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:30,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 07:59:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:30,751 INFO L225 Difference]: With dead ends: 107 [2024-11-09 07:59:30,751 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 07:59:30,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:30,752 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 106 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:30,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 68 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 07:59:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-11-09 07:59:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.481012658227848) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2024-11-09 07:59:30,757 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 8 [2024-11-09 07:59:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:30,757 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2024-11-09 07:59:30,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2024-11-09 07:59:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:59:30,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:30,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:30,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:59:30,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:30,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:30,758 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2024-11-09 07:59:30,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:30,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333401183] [2024-11-09 07:59:30,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:30,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:30,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:30,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333401183] [2024-11-09 07:59:30,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333401183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:30,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:30,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:59:30,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663149278] [2024-11-09 07:59:30,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:30,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:59:30,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:30,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:59:30,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:30,947 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:31,082 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2024-11-09 07:59:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:59:31,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:59:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:31,083 INFO L225 Difference]: With dead ends: 106 [2024-11-09 07:59:31,083 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 07:59:31,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:59:31,084 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 24 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:31,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 178 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 07:59:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2024-11-09 07:59:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 103 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2024-11-09 07:59:31,088 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 12 [2024-11-09 07:59:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:31,089 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2024-11-09 07:59:31,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2024-11-09 07:59:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:59:31,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:31,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:31,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:59:31,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:31,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:31,090 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2024-11-09 07:59:31,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:31,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466411787] [2024-11-09 07:59:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:31,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:31,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466411787] [2024-11-09 07:59:31,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466411787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:31,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:31,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:59:31,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424856464] [2024-11-09 07:59:31,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:31,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:59:31,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:31,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:59:31,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:31,217 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:31,383 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2024-11-09 07:59:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:59:31,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:59:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:31,384 INFO L225 Difference]: With dead ends: 102 [2024-11-09 07:59:31,384 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 07:59:31,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:59:31,384 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:31,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 222 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 07:59:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2024-11-09 07:59:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 94 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) [2024-11-09 07:59:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-11-09 07:59:31,394 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 12 [2024-11-09 07:59:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:31,394 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-11-09 07:59:31,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-11-09 07:59:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:59:31,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:31,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:31,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:59:31,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:31,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1831378933, now seen corresponding path program 1 times [2024-11-09 07:59:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701032596] [2024-11-09 07:59:31,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:31,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:31,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:31,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701032596] [2024-11-09 07:59:31,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701032596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:31,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:31,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:59:31,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950992929] [2024-11-09 07:59:31,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:31,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:59:31,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:31,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:59:31,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:31,570 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:31,687 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2024-11-09 07:59:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:59:31,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-09 07:59:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:31,688 INFO L225 Difference]: With dead ends: 106 [2024-11-09 07:59:31,688 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 07:59:31,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:59:31,689 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 19 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:31,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 216 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 07:59:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2024-11-09 07:59:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.425) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-11-09 07:59:31,699 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 15 [2024-11-09 07:59:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:31,700 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-11-09 07:59:31,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-11-09 07:59:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:59:31,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:31,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:31,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:59:31,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:31,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:31,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1292849535, now seen corresponding path program 1 times [2024-11-09 07:59:31,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:31,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055191558] [2024-11-09 07:59:31,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:31,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:31,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055191558] [2024-11-09 07:59:31,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055191558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265109308] [2024-11-09 07:59:31,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:31,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:31,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:31,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:31,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:59:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:31,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:59:31,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:31,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:59:32,011 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:59:32,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:59:32,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:59:32,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 07:59:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:32,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265109308] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:32,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:32,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 10 [2024-11-09 07:59:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964586314] [2024-11-09 07:59:32,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:32,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:59:32,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:32,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:59:32,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:59:32,184 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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) [2024-11-09 07:59:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:32,515 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2024-11-09 07:59:32,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:59:32,515 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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 18 [2024-11-09 07:59:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:32,517 INFO L225 Difference]: With dead ends: 134 [2024-11-09 07:59:32,517 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 07:59:32,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:59:32,518 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 201 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:32,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 141 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:59:32,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 07:59:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2024-11-09 07:59:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2024-11-09 07:59:32,525 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 18 [2024-11-09 07:59:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:32,526 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2024-11-09 07:59:32,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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) [2024-11-09 07:59:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2024-11-09 07:59:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:59:32,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:32,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:32,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:59:32,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:32,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:32,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:32,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1292849536, now seen corresponding path program 1 times [2024-11-09 07:59:32,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:32,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008183889] [2024-11-09 07:59:32,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:32,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:33,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:33,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008183889] [2024-11-09 07:59:33,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008183889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:33,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654904576] [2024-11-09 07:59:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:33,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:33,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:33,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:33,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:59:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:33,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:59:33,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:33,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:59:33,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:59:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:33,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:59:33,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654904576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:33,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:59:33,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-11-09 07:59:33,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399245626] [2024-11-09 07:59:33,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:33,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:59:33,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:33,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:59:33,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:59:33,352 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:33,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:33,463 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2024-11-09 07:59:33,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:59:33,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:59:33,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:33,464 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:59:33,464 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:59:33,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:59:33,465 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 23 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:33,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 210 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:33,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:59:33,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2024-11-09 07:59:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 100 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2024-11-09 07:59:33,467 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2024-11-09 07:59:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:33,468 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2024-11-09 07:59:33,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2024-11-09 07:59:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:59:33,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:33,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:33,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:59:33,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 07:59:33,673 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:33,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1421999073, now seen corresponding path program 1 times [2024-11-09 07:59:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:33,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833255888] [2024-11-09 07:59:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:33,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:33,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:33,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833255888] [2024-11-09 07:59:33,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833255888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:33,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:33,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:59:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555978790] [2024-11-09 07:59:33,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:33,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:59:33,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:33,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:59:33,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:59:33,854 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:34,070 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2024-11-09 07:59:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:59:34,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:59:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:34,071 INFO L225 Difference]: With dead ends: 122 [2024-11-09 07:59:34,071 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 07:59:34,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:59:34,071 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 144 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:34,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 108 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 07:59:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2024-11-09 07:59:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.4) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2024-11-09 07:59:34,074 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 19 [2024-11-09 07:59:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:34,074 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2024-11-09 07:59:34,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2024-11-09 07:59:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:59:34,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:34,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:34,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:59:34,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:34,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1421999074, now seen corresponding path program 1 times [2024-11-09 07:59:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656861502] [2024-11-09 07:59:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:34,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:34,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656861502] [2024-11-09 07:59:34,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656861502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:34,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:34,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:59:34,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537854485] [2024-11-09 07:59:34,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:34,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:59:34,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:34,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:59:34,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:59:34,346 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:34,703 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2024-11-09 07:59:34,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:59:34,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:59:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:34,704 INFO L225 Difference]: With dead ends: 131 [2024-11-09 07:59:34,704 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 07:59:34,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:59:34,705 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 235 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:34,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 201 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 07:59:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2024-11-09 07:59:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2024-11-09 07:59:34,707 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 19 [2024-11-09 07:59:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:34,708 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2024-11-09 07:59:34,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2024-11-09 07:59:34,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:59:34,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:34,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:34,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:59:34,709 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:34,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:34,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1511458210, now seen corresponding path program 1 times [2024-11-09 07:59:34,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:34,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724019366] [2024-11-09 07:59:34,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:34,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:34,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:34,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724019366] [2024-11-09 07:59:34,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724019366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:34,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:34,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:59:34,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736634552] [2024-11-09 07:59:34,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:34,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:59:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:34,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:59:34,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:34,746 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:34,812 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2024-11-09 07:59:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:34,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-09 07:59:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:34,813 INFO L225 Difference]: With dead ends: 112 [2024-11-09 07:59:34,813 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 07:59:34,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:34,814 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 103 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:34,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 89 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:34,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 07:59:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2024-11-09 07:59:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 106 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2024-11-09 07:59:34,816 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 22 [2024-11-09 07:59:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:34,816 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2024-11-09 07:59:34,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2024-11-09 07:59:34,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:59:34,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:34,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:34,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:59:34,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:34,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:34,817 INFO L85 PathProgramCache]: Analyzing trace with hash -371375161, now seen corresponding path program 1 times [2024-11-09 07:59:34,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:34,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475613235] [2024-11-09 07:59:34,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:34,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:35,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:35,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475613235] [2024-11-09 07:59:35,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475613235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:35,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:35,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:59:35,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097128118] [2024-11-09 07:59:35,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:35,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:59:35,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:35,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:59:35,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:59:35,045 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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) [2024-11-09 07:59:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:35,332 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2024-11-09 07:59:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:59:35,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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 [2024-11-09 07:59:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:35,333 INFO L225 Difference]: With dead ends: 160 [2024-11-09 07:59:35,333 INFO L226 Difference]: Without dead ends: 160 [2024-11-09 07:59:35,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:59:35,333 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 116 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:35,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 345 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-09 07:59:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 118. [2024-11-09 07:59:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.346938775510204) internal successors, (132), 117 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2024-11-09 07:59:35,336 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 23 [2024-11-09 07:59:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:35,336 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2024-11-09 07:59:35,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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) [2024-11-09 07:59:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2024-11-09 07:59:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:59:35,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:35,337 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:35,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:59:35,337 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:35,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash 836442201, now seen corresponding path program 1 times [2024-11-09 07:59:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:35,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888074397] [2024-11-09 07:59:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:35,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888074397] [2024-11-09 07:59:35,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888074397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786669826] [2024-11-09 07:59:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:35,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:35,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:35,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:35,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:59:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:35,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:59:35,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:35,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:59:35,664 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:59:35,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:59:35,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:59:35,796 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:59:35,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 07:59:35,816 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:59:35,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 07:59:35,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:59:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:35,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:35,965 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:59:35,991 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_398) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:59:36,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:36,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-09 07:59:36,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:36,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2024-11-09 07:59:36,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-09 07:59:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:36,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786669826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:36,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:36,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-11-09 07:59:36,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644174069] [2024-11-09 07:59:36,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:36,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:59:36,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:36,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:59:36,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=453, Unknown=6, NotChecked=90, Total=650 [2024-11-09 07:59:36,207 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:36,976 INFO L93 Difference]: Finished difference Result 214 states and 244 transitions. [2024-11-09 07:59:36,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 07:59:36,977 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 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 [2024-11-09 07:59:36,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:36,978 INFO L225 Difference]: With dead ends: 214 [2024-11-09 07:59:36,978 INFO L226 Difference]: Without dead ends: 214 [2024-11-09 07:59:36,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=975, Unknown=6, NotChecked=134, Total=1332 [2024-11-09 07:59:36,979 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 251 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:36,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 427 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 982 Invalid, 0 Unknown, 430 Unchecked, 0.5s Time] [2024-11-09 07:59:36,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-09 07:59:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 134. [2024-11-09 07:59:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 133 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2024-11-09 07:59:36,981 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 23 [2024-11-09 07:59:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:36,981 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2024-11-09 07:59:36,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2024-11-09 07:59:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:59:36,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:36,982 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:36,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:59:37,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:37,187 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:37,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash 836442202, now seen corresponding path program 1 times [2024-11-09 07:59:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:37,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76707561] [2024-11-09 07:59:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:37,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76707561] [2024-11-09 07:59:37,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76707561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094473801] [2024-11-09 07:59:37,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:37,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:37,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:37,457 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:37,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:59:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:37,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 07:59:37,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:37,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:59:37,559 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:59:37,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:59:37,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:59:37,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:59:37,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:59:37,669 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:59:37,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 07:59:37,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:59:37,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:59:37,688 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:59:37,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 07:59:37,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:59:37,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:59:37,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:59:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:37,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:37,897 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_473 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_473) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_474 (Array Int Int)) (v_ArrVal_473 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_473) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_474) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 07:59:37,951 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_473 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_473) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_474 (Array Int Int)) (v_ArrVal_473 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_473) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_474) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-09 07:59:37,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:37,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-09 07:59:37,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:37,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2024-11-09 07:59:37,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:59:37,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:37,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-09 07:59:37,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:37,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-09 07:59:37,990 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:37,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 07:59:37,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:37,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-09 07:59:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:38,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094473801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:38,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:38,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2024-11-09 07:59:38,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363119128] [2024-11-09 07:59:38,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:38,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:59:38,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:38,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:59:38,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=653, Unknown=15, NotChecked=106, Total=870 [2024-11-09 07:59:38,110 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:39,089 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2024-11-09 07:59:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:59:39,090 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:59:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:39,090 INFO L225 Difference]: With dead ends: 174 [2024-11-09 07:59:39,090 INFO L226 Difference]: Without dead ends: 174 [2024-11-09 07:59:39,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=1461, Unknown=15, NotChecked=162, Total=1892 [2024-11-09 07:59:39,091 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 342 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:39,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 776 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1305 Invalid, 0 Unknown, 326 Unchecked, 0.7s Time] [2024-11-09 07:59:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-09 07:59:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 128. [2024-11-09 07:59:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 127 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) [2024-11-09 07:59:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2024-11-09 07:59:39,093 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 23 [2024-11-09 07:59:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:39,093 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2024-11-09 07:59:39,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2024-11-09 07:59:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:59:39,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:39,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:39,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:59:39,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 07:59:39,295 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:39,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:39,295 INFO L85 PathProgramCache]: Analyzing trace with hash -162052300, now seen corresponding path program 1 times [2024-11-09 07:59:39,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:39,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383452471] [2024-11-09 07:59:39,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:39,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:39,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:39,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383452471] [2024-11-09 07:59:39,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383452471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:39,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:39,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:59:39,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933935597] [2024-11-09 07:59:39,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:39,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:59:39,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:39,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:59:39,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:59:39,417 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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) [2024-11-09 07:59:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:39,593 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2024-11-09 07:59:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:59:39,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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 [2024-11-09 07:59:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:39,595 INFO L225 Difference]: With dead ends: 174 [2024-11-09 07:59:39,595 INFO L226 Difference]: Without dead ends: 174 [2024-11-09 07:59:39,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:59:39,596 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 97 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:39,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 282 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:39,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-09 07:59:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 141. [2024-11-09 07:59:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 140 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) [2024-11-09 07:59:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2024-11-09 07:59:39,600 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 24 [2024-11-09 07:59:39,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:39,600 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2024-11-09 07:59:39,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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) [2024-11-09 07:59:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2024-11-09 07:59:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:59:39,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:39,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:39,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:59:39,601 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:39,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:39,601 INFO L85 PathProgramCache]: Analyzing trace with hash 813847718, now seen corresponding path program 1 times [2024-11-09 07:59:39,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:39,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594623252] [2024-11-09 07:59:39,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:39,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:39,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:39,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594623252] [2024-11-09 07:59:39,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594623252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:39,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:39,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:59:39,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006664159] [2024-11-09 07:59:39,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:39,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:59:39,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:39,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:59:39,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:59:39,684 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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) [2024-11-09 07:59:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:39,834 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2024-11-09 07:59:39,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:59:39,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 [2024-11-09 07:59:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:39,836 INFO L225 Difference]: With dead ends: 165 [2024-11-09 07:59:39,836 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 07:59:39,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:59:39,836 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 159 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:39,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 207 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 07:59:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2024-11-09 07:59:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 124 states have (on average 1.282258064516129) internal successors, (159), 140 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 159 transitions. [2024-11-09 07:59:39,839 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 159 transitions. Word has length 24 [2024-11-09 07:59:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:39,840 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 159 transitions. [2024-11-09 07:59:39,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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) [2024-11-09 07:59:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 159 transitions. [2024-11-09 07:59:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:59:39,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:39,840 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:39,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:59:39,841 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:39,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:39,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1397911904, now seen corresponding path program 1 times [2024-11-09 07:59:39,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:39,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63093921] [2024-11-09 07:59:39,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:39,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63093921] [2024-11-09 07:59:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63093921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627954765] [2024-11-09 07:59:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:40,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:40,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:40,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:59:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:40,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 07:59:40,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:40,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:59:40,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:59:40,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:59:40,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:59:40,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:59:40,268 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:59:40,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:59:40,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:59:40,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:59:40,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:59:40,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-09 07:59:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:40,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:40,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:40,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-11-09 07:59:40,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:40,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-11-09 07:59:41,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:41,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-09 07:59:41,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:41,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2024-11-09 07:59:41,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:41,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-11-09 07:59:41,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:41,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-09 07:59:41,360 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:59:41,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-09 07:59:41,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:41,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-11-09 07:59:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:41,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627954765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:41,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:41,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 25 [2024-11-09 07:59:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751872394] [2024-11-09 07:59:41,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:41,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:59:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:41,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:59:41,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=536, Unknown=1, NotChecked=0, Total=600 [2024-11-09 07:59:41,429 INFO L87 Difference]: Start difference. First operand 141 states and 159 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:42,151 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2024-11-09 07:59:42,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:59:42,152 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 07:59:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:42,152 INFO L225 Difference]: With dead ends: 165 [2024-11-09 07:59:42,153 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 07:59:42,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=929, Unknown=1, NotChecked=0, Total=1056 [2024-11-09 07:59:42,153 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 175 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:42,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 558 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:59:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 07:59:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 144. [2024-11-09 07:59:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.2755905511811023) internal successors, (162), 143 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 162 transitions. [2024-11-09 07:59:42,155 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 162 transitions. Word has length 24 [2024-11-09 07:59:42,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:42,156 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 162 transitions. [2024-11-09 07:59:42,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 162 transitions. [2024-11-09 07:59:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:59:42,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:42,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:42,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:59:42,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 07:59:42,361 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:42,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:42,361 INFO L85 PathProgramCache]: Analyzing trace with hash -730284852, now seen corresponding path program 1 times [2024-11-09 07:59:42,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:42,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984207213] [2024-11-09 07:59:42,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:42,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984207213] [2024-11-09 07:59:42,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984207213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:42,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:42,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:59:42,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916182858] [2024-11-09 07:59:42,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:42,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:59:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:42,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:59:42,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:59:42,528 INFO L87 Difference]: Start difference. First operand 144 states and 162 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:42,722 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2024-11-09 07:59:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:59:42,722 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-09 07:59:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:42,723 INFO L225 Difference]: With dead ends: 163 [2024-11-09 07:59:42,723 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 07:59:42,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:59:42,723 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 48 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:42,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 260 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 07:59:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 156. [2024-11-09 07:59:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 139 states have (on average 1.2517985611510791) internal successors, (174), 155 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 174 transitions. [2024-11-09 07:59:42,726 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 174 transitions. Word has length 25 [2024-11-09 07:59:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:42,726 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 174 transitions. [2024-11-09 07:59:42,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 174 transitions. [2024-11-09 07:59:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:59:42,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:42,727 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:42,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:59:42,727 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:42,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:42,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1291386135, now seen corresponding path program 2 times [2024-11-09 07:59:42,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:42,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274795140] [2024-11-09 07:59:42,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:42,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:43,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:43,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274795140] [2024-11-09 07:59:43,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274795140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:43,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221636920] [2024-11-09 07:59:43,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:59:43,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:43,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:43,051 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:43,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:59:43,137 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:59:43,137 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:59:43,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 07:59:43,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:43,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:59:43,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:59:43,278 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:59:43,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:59:43,293 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:59:43,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:59:43,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:59:43,333 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 07:59:43,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-11-09 07:59:43,342 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 07:59:43,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-11-09 07:59:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:43,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:43,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:43,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 89 [2024-11-09 07:59:44,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:44,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2024-11-09 07:59:44,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:44,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 82 [2024-11-09 07:59:44,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:44,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 92 [2024-11-09 07:59:44,867 INFO L349 Elim1Store]: treesize reduction 36, result has 82.9 percent of original size [2024-11-09 07:59:44,867 INFO L378 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 7 new quantified variables, introduced 15 case distinctions, treesize of input 231 treesize of output 350 [2024-11-09 07:59:44,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:44,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 113 [2024-11-09 07:59:44,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:44,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 289 treesize of output 313 [2024-11-09 07:59:47,746 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:59:47,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 1 [2024-11-09 07:59:47,751 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:59:47,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2024-11-09 07:59:47,756 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:59:47,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 1 [2024-11-09 07:59:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:47,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221636920] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:47,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:47,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 38 [2024-11-09 07:59:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397878882] [2024-11-09 07:59:47,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:47,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 07:59:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:47,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 07:59:47,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1233, Unknown=23, NotChecked=0, Total=1406 [2024-11-09 07:59:47,800 INFO L87 Difference]: Start difference. First operand 156 states and 174 transitions. Second operand has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:48,113 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_708 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 0) (= (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_9))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse0) 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (or (= (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_708 |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (select (select .cse2 .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (= .cse3 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 0) 0) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_708 |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (select (select .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse5) 0) (= .cse5 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_arrayElimArr_9 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_9))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (= .cse6 0) (forall ((v_ArrVal_708 (Array Int Int))) (or (= (select (select .cse7 .cse6) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_708 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) 0))) (or (and (= (select (select |c_#memory_$Pointer$#1.base| .cse8) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 0) 0)) (= .cse8 0)))) is different from false [2024-11-09 07:59:49,371 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_708 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 0) (= (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_9))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse0) 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (or (= (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_708 |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (select (select .cse2 .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (= .cse3 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_708 |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (select (select .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse5) 0) (= .cse5 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_arrayElimArr_9 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_9))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (= .cse6 0) (forall ((v_ArrVal_708 (Array Int Int))) (or (= (select (select .cse7 .cse6) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_708 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))))))) is different from false [2024-11-09 07:59:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:52,206 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2024-11-09 07:59:52,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 07:59:52,207 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 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 [2024-11-09 07:59:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:52,207 INFO L225 Difference]: With dead ends: 201 [2024-11-09 07:59:52,207 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 07:59:52,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=502, Invalid=2783, Unknown=29, NotChecked=226, Total=3540 [2024-11-09 07:59:52,208 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 359 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 52 mSolverCounterUnsat, 221 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 221 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:52,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 909 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1530 Invalid, 221 Unknown, 111 Unchecked, 2.7s Time] [2024-11-09 07:59:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 07:59:52,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 155. [2024-11-09 07:59:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 154 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2024-11-09 07:59:52,212 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 28 [2024-11-09 07:59:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:52,213 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2024-11-09 07:59:52,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2024-11-09 07:59:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:59:52,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:52,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:52,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:59:52,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:52,419 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:52,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:52,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1269462663, now seen corresponding path program 1 times [2024-11-09 07:59:52,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:52,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366558765] [2024-11-09 07:59:52,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:52,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:59:52,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366558765] [2024-11-09 07:59:52,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366558765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:52,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:52,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:59:52,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103152551] [2024-11-09 07:59:52,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:52,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:59:52,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:52,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:59:52,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:52,468 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:52,559 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2024-11-09 07:59:52,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:52,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 [2024-11-09 07:59:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:52,560 INFO L225 Difference]: With dead ends: 157 [2024-11-09 07:59:52,560 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 07:59:52,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:52,561 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 92 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:52,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 80 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 07:59:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2024-11-09 07:59:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 139 states have (on average 1.2374100719424461) internal successors, (172), 155 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) [2024-11-09 07:59:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2024-11-09 07:59:52,563 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 29 [2024-11-09 07:59:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:52,564 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2024-11-09 07:59:52,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2024-11-09 07:59:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:59:52,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:52,565 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:52,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:59:52,565 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:52,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:52,565 INFO L85 PathProgramCache]: Analyzing trace with hash 847433237, now seen corresponding path program 1 times [2024-11-09 07:59:52,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:52,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74676235] [2024-11-09 07:59:52,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:52,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:53,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:53,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74676235] [2024-11-09 07:59:53,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74676235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:53,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223995090] [2024-11-09 07:59:53,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:53,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:53,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:53,145 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:53,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:59:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:53,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 07:59:53,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:53,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:59:53,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:59:53,351 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:59:53,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:59:53,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:59:53,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:59:53,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:59:53,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 07:59:53,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:59:53,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:59:53,466 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:59:53,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:59:53,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:59:53,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:59:53,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:59:53,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 07:59:53,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:59:53,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:59:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:53,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:53,638 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_845) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 1))) is different from false [2024-11-09 07:59:53,793 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:59:53,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-09 07:59:53,936 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_22| Int) (|v_ULTIMATE.start_main_~x~0#1.base_117| Int) (v_ArrVal_841 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_101| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_117| |c_ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_841) |v_ULTIMATE.start_main_#t~malloc3#1.base_22| v_ArrVal_843) |v_ULTIMATE.start_main_~x~0#1.base_117| v_ArrVal_845) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 1)) (not (= v_ArrVal_841 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_101| (select v_ArrVal_841 |v_ULTIMATE.start_main_~x~0#1.offset_101|)))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_101|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_22|) 0)))) is different from false [2024-11-09 07:59:53,944 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:53,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2024-11-09 07:59:53,951 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:53,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 07:59:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:53,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223995090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:53,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:53,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 36 [2024-11-09 07:59:53,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968056456] [2024-11-09 07:59:53,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:53,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 07:59:53,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:53,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 07:59:53,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=950, Unknown=38, NotChecked=130, Total=1260 [2024-11-09 07:59:53,978 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:54,826 INFO L93 Difference]: Finished difference Result 215 states and 233 transitions. [2024-11-09 07:59:54,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:59:54,826 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 07:59:54,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:54,827 INFO L225 Difference]: With dead ends: 215 [2024-11-09 07:59:54,827 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 07:59:54,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=1592, Unknown=48, NotChecked=170, Total=2070 [2024-11-09 07:59:54,828 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 169 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:54,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 790 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1218 Invalid, 0 Unknown, 305 Unchecked, 0.7s Time] [2024-11-09 07:59:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 07:59:54,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 167. [2024-11-09 07:59:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 150 states have (on average 1.22) internal successors, (183), 166 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 183 transitions. [2024-11-09 07:59:54,833 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 183 transitions. Word has length 31 [2024-11-09 07:59:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:54,833 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 183 transitions. [2024-11-09 07:59:54,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 183 transitions. [2024-11-09 07:59:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:59:54,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:54,834 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:54,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:59:55,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:55,037 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 07:59:55,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:55,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2055250599, now seen corresponding path program 3 times [2024-11-09 07:59:55,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:55,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671686265] [2024-11-09 07:59:55,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:55,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:55,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671686265] [2024-11-09 07:59:55,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671686265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:55,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964311090] [2024-11-09 07:59:55,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:59:55,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:55,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:55,483 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:55,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:59:55,602 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 07:59:55,603 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:59:55,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 07:59:55,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:55,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:59:55,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:59:55,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:59:55,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:59:55,876 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:59:55,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-09 07:59:55,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-09 07:59:55,942 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:59:55,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2024-11-09 07:59:55,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-09 07:59:56,040 INFO L349 Elim1Store]: treesize reduction 78, result has 41.8 percent of original size [2024-11-09 07:59:56,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 78 [2024-11-09 07:59:56,160 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 07:59:56,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 62 [2024-11-09 07:59:56,559 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2024-11-09 07:59:56,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 136 [2024-11-09 07:59:56,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-09 07:59:56,710 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:59:56,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 116 [2024-11-09 07:59:57,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 84 [2024-11-09 07:59:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:57,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:57,396 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_965 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_965) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:59:57,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:57,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-09 07:59:57,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:57,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-09 07:59:57,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:57,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 189 [2024-11-09 07:59:57,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:57,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 80 [2024-11-09 07:59:57,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30