./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_update_all.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/list-simple/dll2c_update_all.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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:02:09,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:02:09,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:02:09,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:02:09,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:02:09,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:02:09,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:02:09,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:02:09,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:02:09,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:02:09,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:02:09,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:02:09,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:02:09,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:02:09,724 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:02:09,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:02:09,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:02:09,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:02:09,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:02:09,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:02:09,726 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:02:09,729 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:02:09,729 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:02:09,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:02:09,730 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:02:09,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:02:09,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:02:09,730 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:02:09,730 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:02:09,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:02:09,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:02:09,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:02:09,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:02:09,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:02:09,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:02:09,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:02:09,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:02:09,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:02:09,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:02:09,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:02:09,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:02:09,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:02:09,734 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2024-11-09 08:02:09,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:02:10,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:02:10,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:02:10,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:02:10,006 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:02:10,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2024-11-09 08:02:11,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:02:11,484 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:02:11,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2024-11-09 08:02:11,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beaf3ef75/2563a5af7a924f8ab289976716076eb4/FLAGbe38b6c52 [2024-11-09 08:02:11,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beaf3ef75/2563a5af7a924f8ab289976716076eb4 [2024-11-09 08:02:11,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:02:11,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:02:11,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:02:11,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:02:11,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:02:11,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:02:11" (1/1) ... [2024-11-09 08:02:11,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cea42b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:11, skipping insertion in model container [2024-11-09 08:02:11,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:02:11" (1/1) ... [2024-11-09 08:02:11,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:02:12,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:02:12,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:02:12,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:02:12,254 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:02:12,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12 WrapperNode [2024-11-09 08:02:12,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:02:12,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:02:12,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:02:12,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:02:12,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (1/1) ... [2024-11-09 08:02:12,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (1/1) ... [2024-11-09 08:02:12,298 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-09 08:02:12,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:02:12,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:02:12,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:02:12,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:02:12,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (1/1) ... [2024-11-09 08:02:12,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (1/1) ... [2024-11-09 08:02:12,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (1/1) ... [2024-11-09 08:02:12,340 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-11-09 08:02:12,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (1/1) ... [2024-11-09 08:02:12,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (1/1) ... [2024-11-09 08:02:12,349 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (1/1) ... [2024-11-09 08:02:12,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (1/1) ... [2024-11-09 08:02:12,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (1/1) ... [2024-11-09 08:02:12,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (1/1) ... [2024-11-09 08:02:12,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:02:12,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:02:12,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:02:12,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:02:12,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (1/1) ... [2024-11-09 08:02:12,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:02:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:12,401 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 08:02:12,406 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 08:02:12,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 08:02:12,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 08:02:12,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 08:02:12,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 08:02:12,442 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 08:02:12,442 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 08:02:12,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:02:12,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:02:12,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:02:12,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:02:12,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:02:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:02:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:02:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:02:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:02:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:02:12,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:02:12,629 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:02:12,631 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:02:12,908 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-09 08:02:12,909 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:02:12,924 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:02:12,924 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 08:02:12,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:02:12 BoogieIcfgContainer [2024-11-09 08:02:12,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:02:12,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:02:12,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:02:12,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:02:12,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:02:11" (1/3) ... [2024-11-09 08:02:12,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678a3a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:02:12, skipping insertion in model container [2024-11-09 08:02:12,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:12" (2/3) ... [2024-11-09 08:02:12,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678a3a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:02:12, skipping insertion in model container [2024-11-09 08:02:12,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:02:12" (3/3) ... [2024-11-09 08:02:12,933 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2024-11-09 08:02:12,946 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:02:12,947 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-09 08:02:12,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:02:12,996 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;@29d1f22d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:02:12,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2024-11-09 08:02:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 92 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:02:13,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:13,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:02:13,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:13,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:13,015 INFO L85 PathProgramCache]: Analyzing trace with hash 895210802, now seen corresponding path program 1 times [2024-11-09 08:02:13,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:13,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615719892] [2024-11-09 08:02:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:13,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:13,230 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 08:02:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:13,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615719892] [2024-11-09 08:02:13,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615719892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:13,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:13,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:02:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382661667] [2024-11-09 08:02:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:13,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:02:13,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:13,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:02:13,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:02:13,263 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 92 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:13,335 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-11-09 08:02:13,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:02:13,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 08:02:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:13,343 INFO L225 Difference]: With dead ends: 92 [2024-11-09 08:02:13,344 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 08:02:13,345 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 08:02:13,347 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:13,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 155 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 08:02:13,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 08:02:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.690909090909091) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-11-09 08:02:13,377 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 6 [2024-11-09 08:02:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:13,378 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-11-09 08:02:13,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-11-09 08:02:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:02:13,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:13,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:02:13,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:02:13,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:13,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:13,380 INFO L85 PathProgramCache]: Analyzing trace with hash 895210803, now seen corresponding path program 1 times [2024-11-09 08:02:13,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:13,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440319771] [2024-11-09 08:02:13,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:13,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:13,462 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 08:02:13,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440319771] [2024-11-09 08:02:13,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440319771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:13,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:13,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:02:13,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424559321] [2024-11-09 08:02:13,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:13,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:02:13,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:13,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:02:13,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:02:13,466 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:13,531 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-11-09 08:02:13,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:02:13,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 08:02:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:13,532 INFO L225 Difference]: With dead ends: 86 [2024-11-09 08:02:13,533 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 08:02:13,534 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 08:02:13,535 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:13,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 156 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 08:02:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 08:02:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 82 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2024-11-09 08:02:13,546 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 6 [2024-11-09 08:02:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:13,547 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2024-11-09 08:02:13,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2024-11-09 08:02:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 08:02:13,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:13,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:13,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:02:13,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:13,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1540658031, now seen corresponding path program 1 times [2024-11-09 08:02:13,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:13,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034640383] [2024-11-09 08:02:13,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:13,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:13,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:13,713 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 08:02:13,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:13,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034640383] [2024-11-09 08:02:13,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034640383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:13,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:13,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:02:13,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752101728] [2024-11-09 08:02:13,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:13,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:13,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:13,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:02:13,717 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 08:02:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:13,824 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2024-11-09 08:02:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:13,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-09 08:02:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:13,828 INFO L225 Difference]: With dead ends: 97 [2024-11-09 08:02:13,828 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 08:02:13,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:02:13,829 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 10 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:13,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 226 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 08:02:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2024-11-09 08:02:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.625) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-11-09 08:02:13,846 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 14 [2024-11-09 08:02:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:13,846 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-11-09 08:02:13,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 08:02:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-11-09 08:02:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:02:13,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:13,847 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:13,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:02:13,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash -673728128, now seen corresponding path program 1 times [2024-11-09 08:02:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820990400] [2024-11-09 08:02:13,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:02:14,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:14,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820990400] [2024-11-09 08:02:14,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820990400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:14,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:02:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355371523] [2024-11-09 08:02:14,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:14,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:02:14,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:14,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:02:14,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:14,090 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:14,243 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-11-09 08:02:14,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:14,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-09 08:02:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:14,244 INFO L225 Difference]: With dead ends: 86 [2024-11-09 08:02:14,244 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 08:02:14,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:14,246 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 7 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:14,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 344 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 08:02:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 08:02:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 82 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2024-11-09 08:02:14,256 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 24 [2024-11-09 08:02:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:14,256 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2024-11-09 08:02:14,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2024-11-09 08:02:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:02:14,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:14,258 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:14,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:02:14,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:14,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:14,258 INFO L85 PathProgramCache]: Analyzing trace with hash -673728127, now seen corresponding path program 1 times [2024-11-09 08:02:14,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:14,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574167039] [2024-11-09 08:02:14,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:14,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:14,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:14,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574167039] [2024-11-09 08:02:14,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574167039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:14,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:14,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:02:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683890788] [2024-11-09 08:02:14,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:14,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:02:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:14,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:02:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:14,563 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:14,668 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-11-09 08:02:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:14,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-09 08:02:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:14,669 INFO L225 Difference]: With dead ends: 85 [2024-11-09 08:02:14,669 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 08:02:14,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:14,670 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 6 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:14,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 366 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 08:02:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 08:02:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2024-11-09 08:02:14,674 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 24 [2024-11-09 08:02:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:14,674 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2024-11-09 08:02:14,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2024-11-09 08:02:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:02:14,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:14,675 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:14,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:02:14,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:14,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1087330401, now seen corresponding path program 1 times [2024-11-09 08:02:14,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:14,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705604518] [2024-11-09 08:02:14,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:14,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:14,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:14,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705604518] [2024-11-09 08:02:14,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705604518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:14,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809666214] [2024-11-09 08:02:14,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:14,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:14,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:14,930 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 08:02:14,932 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 08:02:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:15,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 08:02:15,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:15,105 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 08:02:15,157 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-09 08:02:15,191 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:02:15,192 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 08:02:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 08:02:15,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:15,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809666214] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:15,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:15,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-09 08:02:15,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266507393] [2024-11-09 08:02:15,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:15,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 08:02:15,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:15,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 08:02:15,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-09 08:02:15,359 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:15,531 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2024-11-09 08:02:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:15,531 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-11-09 08:02:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:15,532 INFO L225 Difference]: With dead ends: 90 [2024-11-09 08:02:15,532 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 08:02:15,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-11-09 08:02:15,533 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:15,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2024-11-09 08:02:15,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 08:02:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 08:02:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 85 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2024-11-09 08:02:15,538 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 26 [2024-11-09 08:02:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:15,538 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2024-11-09 08:02:15,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2024-11-09 08:02:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:02:15,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:15,539 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:15,553 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 08:02:15,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 08:02:15,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:15,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1087330402, now seen corresponding path program 1 times [2024-11-09 08:02:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:15,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380898358] [2024-11-09 08:02:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:15,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:16,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:16,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:16,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380898358] [2024-11-09 08:02:16,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380898358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:16,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439635461] [2024-11-09 08:02:16,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:16,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:16,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:16,100 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 08:02:16,104 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 08:02:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:16,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 08:02:16,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:16,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:02:16,213 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 08:02:16,344 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 08:02:16,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:16,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:02:16,393 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:16,393 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 08:02:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 08:02:16,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:16,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439635461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:16,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:16,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2024-11-09 08:02:16,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070084754] [2024-11-09 08:02:16,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:16,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 08:02:16,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:16,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 08:02:16,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2024-11-09 08:02:16,524 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:16,807 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2024-11-09 08:02:16,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:16,808 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-11-09 08:02:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:16,808 INFO L225 Difference]: With dead ends: 90 [2024-11-09 08:02:16,808 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 08:02:16,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-11-09 08:02:16,809 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:16,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 340 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2024-11-09 08:02:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 08:02:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 08:02:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2024-11-09 08:02:16,814 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 26 [2024-11-09 08:02:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:16,814 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2024-11-09 08:02:16,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2024-11-09 08:02:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 08:02:16,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:16,815 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:16,829 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 08:02:17,019 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,SelfDestructingSolverStorable6 [2024-11-09 08:02:17,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:17,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:17,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1247616567, now seen corresponding path program 1 times [2024-11-09 08:02:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:17,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19089589] [2024-11-09 08:02:17,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:17,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:17,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:17,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:17,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:17,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19089589] [2024-11-09 08:02:17,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19089589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:17,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193433107] [2024-11-09 08:02:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:17,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:17,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:17,156 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 08:02:17,158 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 08:02:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:17,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 08:02:17,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:17,260 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 08:02:17,369 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:02:17,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:02:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:17,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:17,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193433107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:17,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:17,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2024-11-09 08:02:17,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199703197] [2024-11-09 08:02:17,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:17,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 08:02:17,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:17,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 08:02:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-09 08:02:17,671 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 08:02:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:17,960 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-11-09 08:02:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:17,961 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-11-09 08:02:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:17,961 INFO L225 Difference]: With dead ends: 89 [2024-11-09 08:02:17,962 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 08:02:17,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2024-11-09 08:02:17,962 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 42 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:17,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 871 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 08:02:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 08:02:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-11-09 08:02:17,973 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 28 [2024-11-09 08:02:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:17,973 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-11-09 08:02:17,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 08:02:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-11-09 08:02:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:02:17,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:17,974 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:17,997 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 08:02:18,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:18,174 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:18,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash 16627251, now seen corresponding path program 1 times [2024-11-09 08:02:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:18,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391121466] [2024-11-09 08:02:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:18,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:18,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:18,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:18,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:18,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:18,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391121466] [2024-11-09 08:02:18,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391121466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:18,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279183777] [2024-11-09 08:02:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:18,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:18,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:18,354 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 08:02:18,355 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 08:02:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:18,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 08:02:18,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:18,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:02:18,463 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 08:02:18,566 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 08:02:18,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:18,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:02:18,602 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:18,603 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 08:02:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 08:02:18,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:18,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279183777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:18,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:18,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-09 08:02:18,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971995630] [2024-11-09 08:02:18,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:18,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 08:02:18,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:18,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 08:02:18,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-11-09 08:02:18,716 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:18,977 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2024-11-09 08:02:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 08:02:18,978 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-09 08:02:18,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:18,979 INFO L225 Difference]: With dead ends: 106 [2024-11-09 08:02:18,979 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 08:02:18,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-11-09 08:02:18,980 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 16 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:18,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 721 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 360 Invalid, 0 Unknown, 113 Unchecked, 0.2s Time] [2024-11-09 08:02:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 08:02:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2024-11-09 08:02:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.536231884057971) internal successors, (106), 93 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2024-11-09 08:02:18,988 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 29 [2024-11-09 08:02:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:18,988 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2024-11-09 08:02:18,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2024-11-09 08:02:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:02:18,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:18,989 INFO L215 NwaCegarLoop]: trace histogram [2, 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 08:02:19,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:19,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:19,194 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:19,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 515444755, now seen corresponding path program 1 times [2024-11-09 08:02:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:19,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691886968] [2024-11-09 08:02:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:19,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:02:19,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:19,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691886968] [2024-11-09 08:02:19,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691886968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:19,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:19,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 08:02:19,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486609810] [2024-11-09 08:02:19,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:19,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:02:19,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:19,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:02:19,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:19,317 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:19,439 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2024-11-09 08:02:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:19,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-09 08:02:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:19,440 INFO L225 Difference]: With dead ends: 98 [2024-11-09 08:02:19,440 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 08:02:19,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:19,441 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:19,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 384 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 08:02:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 08:02:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 92 states have internal predecessors, (105), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2024-11-09 08:02:19,444 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 30 [2024-11-09 08:02:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:19,444 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-11-09 08:02:19,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2024-11-09 08:02:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:02:19,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:19,445 INFO L215 NwaCegarLoop]: trace histogram [2, 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 08:02:19,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 08:02:19,446 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:19,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:19,446 INFO L85 PathProgramCache]: Analyzing trace with hash 515444756, now seen corresponding path program 1 times [2024-11-09 08:02:19,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:19,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865488762] [2024-11-09 08:02:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:19,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:19,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:19,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865488762] [2024-11-09 08:02:19,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865488762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:19,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:19,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 08:02:19,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558029071] [2024-11-09 08:02:19,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:19,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:02:19,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:19,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:02:19,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:02:19,665 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:19,793 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2024-11-09 08:02:19,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:19,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-09 08:02:19,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:19,794 INFO L225 Difference]: With dead ends: 97 [2024-11-09 08:02:19,795 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 08:02:19,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:02:19,796 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:19,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 483 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 08:02:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 08:02:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 91 states have internal predecessors, (104), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-11-09 08:02:19,801 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 30 [2024-11-09 08:02:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:19,801 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-11-09 08:02:19,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2024-11-09 08:02:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 08:02:19,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:19,802 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:19,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 08:02:19,802 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:19,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1689087417, now seen corresponding path program 1 times [2024-11-09 08:02:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:19,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087382556] [2024-11-09 08:02:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:19,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:02:19,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:19,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087382556] [2024-11-09 08:02:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087382556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:19,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:19,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 08:02:19,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694477100] [2024-11-09 08:02:19,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:19,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:02:19,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:19,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:02:19,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:02:19,965 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:20,173 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2024-11-09 08:02:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:02:20,173 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-09 08:02:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:20,174 INFO L225 Difference]: With dead ends: 100 [2024-11-09 08:02:20,174 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 08:02:20,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:20,175 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 46 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:20,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 463 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 08:02:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 08:02:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 94 states have internal predecessors, (110), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2024-11-09 08:02:20,177 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 35 [2024-11-09 08:02:20,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:20,177 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2024-11-09 08:02:20,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:20,178 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2024-11-09 08:02:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 08:02:20,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:20,178 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:20,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 08:02:20,178 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:20,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:20,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1689087416, now seen corresponding path program 1 times [2024-11-09 08:02:20,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:20,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062252506] [2024-11-09 08:02:20,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:20,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:20,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:20,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:20,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:20,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062252506] [2024-11-09 08:02:20,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062252506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:20,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:20,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 08:02:20,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397063794] [2024-11-09 08:02:20,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:20,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:02:20,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:20,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:02:20,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:02:20,474 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:20,645 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2024-11-09 08:02:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:02:20,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-09 08:02:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:20,646 INFO L225 Difference]: With dead ends: 100 [2024-11-09 08:02:20,646 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 08:02:20,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:20,647 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 43 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:20,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 512 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 08:02:20,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 08:02:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.5) internal successors, (108), 94 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2024-11-09 08:02:20,649 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 35 [2024-11-09 08:02:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:20,650 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2024-11-09 08:02:20,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2024-11-09 08:02:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 08:02:20,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:20,650 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:20,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 08:02:20,651 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 283398157, now seen corresponding path program 1 times [2024-11-09 08:02:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096788768] [2024-11-09 08:02:20,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:20,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:02:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096788768] [2024-11-09 08:02:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096788768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:20,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:20,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 08:02:20,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960879695] [2024-11-09 08:02:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:20,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:02:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:20,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:02:20,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:02:20,811 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:21,029 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2024-11-09 08:02:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:02:21,030 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-09 08:02:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:21,031 INFO L225 Difference]: With dead ends: 103 [2024-11-09 08:02:21,031 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 08:02:21,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:21,032 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 44 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:21,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 463 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 08:02:21,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-09 08:02:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.52) internal successors, (114), 97 states have internal predecessors, (114), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2024-11-09 08:02:21,034 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 37 [2024-11-09 08:02:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:21,035 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2024-11-09 08:02:21,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:21,035 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2024-11-09 08:02:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 08:02:21,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:21,039 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:21,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 08:02:21,039 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:21,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:21,039 INFO L85 PathProgramCache]: Analyzing trace with hash 283398158, now seen corresponding path program 1 times [2024-11-09 08:02:21,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:21,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847602799] [2024-11-09 08:02:21,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:02:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:21,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847602799] [2024-11-09 08:02:21,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847602799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:21,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498713545] [2024-11-09 08:02:21,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:21,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:21,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:21,150 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 08:02:21,152 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 08:02:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 08:02:21,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:21,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498713545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:21,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:21,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-09 08:02:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042858534] [2024-11-09 08:02:21,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:21,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:21,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:21,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:21,330 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:21,344 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2024-11-09 08:02:21,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:21,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-09 08:02:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:21,346 INFO L225 Difference]: With dead ends: 137 [2024-11-09 08:02:21,346 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 08:02:21,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:21,347 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 94 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:21,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 161 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 08:02:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2024-11-09 08:02:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 99 states have internal predecessors, (116), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2024-11-09 08:02:21,350 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 37 [2024-11-09 08:02:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:21,350 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2024-11-09 08:02:21,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2024-11-09 08:02:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 08:02:21,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:21,351 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:21,364 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 08:02:21,551 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,SelfDestructingSolverStorable14 [2024-11-09 08:02:21,552 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:21,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:21,553 INFO L85 PathProgramCache]: Analyzing trace with hash 235269195, now seen corresponding path program 1 times [2024-11-09 08:02:21,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:21,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465825994] [2024-11-09 08:02:21,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:21,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:21,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:21,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465825994] [2024-11-09 08:02:21,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465825994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:21,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:21,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:02:21,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213918221] [2024-11-09 08:02:21,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:21,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:02:21,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:21,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:02:21,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:21,673 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:21,720 INFO L93 Difference]: Finished difference Result 128 states and 151 transitions. [2024-11-09 08:02:21,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:02:21,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-09 08:02:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:21,721 INFO L225 Difference]: With dead ends: 128 [2024-11-09 08:02:21,721 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 08:02:21,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:21,722 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 21 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:21,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 288 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 08:02:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2024-11-09 08:02:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.5) internal successors, (117), 100 states have internal predecessors, (117), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2024-11-09 08:02:21,725 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 38 [2024-11-09 08:02:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:21,725 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2024-11-09 08:02:21,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2024-11-09 08:02:21,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 08:02:21,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:21,726 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:21,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 08:02:21,726 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:21,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:21,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2061275484, now seen corresponding path program 1 times [2024-11-09 08:02:21,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:21,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081634976] [2024-11-09 08:02:21,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:21,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 08:02:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 08:02:21,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:21,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081634976] [2024-11-09 08:02:21,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081634976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:21,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494117700] [2024-11-09 08:02:21,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:21,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:21,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:21,833 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 08:02:21,834 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 08:02:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:21,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:02:21,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:02:21,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:21,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494117700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:21,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:21,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-09 08:02:21,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249193341] [2024-11-09 08:02:21,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:21,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:21,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:21,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:22,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:22,000 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:22,009 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-11-09 08:02:22,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:22,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-09 08:02:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:22,010 INFO L225 Difference]: With dead ends: 88 [2024-11-09 08:02:22,010 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 08:02:22,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:22,010 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:22,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 08:02:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 08:02:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 84 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2024-11-09 08:02:22,012 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 41 [2024-11-09 08:02:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:22,012 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-11-09 08:02:22,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2024-11-09 08:02:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 08:02:22,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:22,013 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:22,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:22,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 08:02:22,215 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:22,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash -176614534, now seen corresponding path program 1 times [2024-11-09 08:02:22,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:22,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897638073] [2024-11-09 08:02:22,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:22,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:22,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:22,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:02:22,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:22,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897638073] [2024-11-09 08:02:22,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897638073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:22,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253445605] [2024-11-09 08:02:22,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:22,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:22,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:22,346 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 08:02:22,347 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 08:02:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:22,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 08:02:22,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:22,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:22,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253445605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:22,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:22,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-11-09 08:02:22,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354638568] [2024-11-09 08:02:22,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:22,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 08:02:22,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:22,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 08:02:22,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:02:22,584 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:22,652 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2024-11-09 08:02:22,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:22,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-11-09 08:02:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:22,653 INFO L225 Difference]: With dead ends: 144 [2024-11-09 08:02:22,653 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 08:02:22,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:02:22,654 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 183 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:22,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 317 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 08:02:22,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 104. [2024-11-09 08:02:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 100 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2024-11-09 08:02:22,656 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 42 [2024-11-09 08:02:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:22,656 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2024-11-09 08:02:22,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2024-11-09 08:02:22,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:02:22,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:22,657 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:22,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 08:02:22,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:22,858 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:22,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1140222369, now seen corresponding path program 1 times [2024-11-09 08:02:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:22,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986235969] [2024-11-09 08:02:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:22,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:23,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:23,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986235969] [2024-11-09 08:02:23,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986235969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:23,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481992860] [2024-11-09 08:02:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:23,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:23,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:23,652 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 08:02:23,653 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 08:02:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 08:02:23,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:23,820 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 08:02:23,899 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:23,900 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 08:02:23,947 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 11 treesize of output 7 [2024-11-09 08:02:23,981 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 08:02:24,036 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 08:02:24,068 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 35 treesize of output 26 [2024-11-09 08:02:24,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:24,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:24,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:24,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2024-11-09 08:02:24,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:24,295 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 42 treesize of output 16 [2024-11-09 08:02:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:24,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:24,322 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2128 (Array Int Int))) (or (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_2128 .cse0))) v_ArrVal_2128)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2128) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2024-11-09 08:02:24,425 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-09 08:02:24,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 08:02:24,436 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2126 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2126) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2024-11-09 08:02:24,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:24,544 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 21 treesize of output 22 [2024-11-09 08:02:24,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-11-09 08:02:24,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-11-09 08:02:24,575 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 22 treesize of output 20 [2024-11-09 08:02:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481992860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:24,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:24,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 36 [2024-11-09 08:02:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66805660] [2024-11-09 08:02:24,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:24,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 08:02:24,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:24,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 08:02:24,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1572, Unknown=40, NotChecked=162, Total=1892 [2024-11-09 08:02:24,651 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 32 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:25,349 INFO L93 Difference]: Finished difference Result 157 states and 196 transitions. [2024-11-09 08:02:25,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 08:02:25,350 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 32 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-09 08:02:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:25,351 INFO L225 Difference]: With dead ends: 157 [2024-11-09 08:02:25,351 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 08:02:25,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=2434, Unknown=41, NotChecked=202, Total=2862 [2024-11-09 08:02:25,352 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 84 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:25,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1241 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 08:02:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 08:02:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 114. [2024-11-09 08:02:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 110 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2024-11-09 08:02:25,356 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 43 [2024-11-09 08:02:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:25,356 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2024-11-09 08:02:25,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 32 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2024-11-09 08:02:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:02:25,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:25,357 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:25,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 08:02:25,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:25,559 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:25,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:25,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1140222368, now seen corresponding path program 1 times [2024-11-09 08:02:25,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:25,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349182034] [2024-11-09 08:02:25,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:25,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:26,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:26,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:26,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349182034] [2024-11-09 08:02:26,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349182034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:26,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732603967] [2024-11-09 08:02:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:26,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:26,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:26,564 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:26,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 08:02:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:26,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-09 08:02:26,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:26,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:02:26,748 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 08:02:27,036 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:02:27,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:02:27,047 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:27,047 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 08:02:27,141 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 11 treesize of output 7 [2024-11-09 08:02:27,153 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 08:02:27,211 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 08:02:27,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 08:02:27,318 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 08:02:27,325 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 16 [2024-11-09 08:02:27,378 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 40 treesize of output 20 [2024-11-09 08:02:27,385 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 35 treesize of output 26 [2024-11-09 08:02:27,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:27,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:27,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2024-11-09 08:02:27,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:27,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:27,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2024-11-09 08:02:27,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 16 [2024-11-09 08:02:27,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:27,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2024-11-09 08:02:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:27,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:27,949 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_2321 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int)) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_2322)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2321) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= v_ArrVal_2321 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_2321 .cse1)))))) (forall ((v_ArrVal_2322 Int)) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_2322)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2024-11-09 08:02:28,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:28,323 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 23 treesize of output 24 [2024-11-09 08:02:28,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2024-11-09 08:02:28,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2024-11-09 08:02:28,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2024-11-09 08:02:28,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:28,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2024-11-09 08:02:28,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:28,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 08:02:28,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:28,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:28,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 22 [2024-11-09 08:02:28,362 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:28,363 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:28,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 12 [2024-11-09 08:02:28,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732603967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:28,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:28,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2024-11-09 08:02:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997498708] [2024-11-09 08:02:28,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:28,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 08:02:28,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:28,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 08:02:28,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2705, Unknown=4, NotChecked=104, Total=2970 [2024-11-09 08:02:28,566 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand has 42 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 36 states have internal predecessors, (73), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:29,667 INFO L93 Difference]: Finished difference Result 167 states and 209 transitions. [2024-11-09 08:02:29,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 08:02:29,669 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 36 states have internal predecessors, (73), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2024-11-09 08:02:29,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:29,669 INFO L225 Difference]: With dead ends: 167 [2024-11-09 08:02:29,670 INFO L226 Difference]: Without dead ends: 167 [2024-11-09 08:02:29,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=266, Invalid=4426, Unknown=4, NotChecked=134, Total=4830 [2024-11-09 08:02:29,672 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 85 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:29,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1484 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 08:02:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-09 08:02:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 122. [2024-11-09 08:02:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 118 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2024-11-09 08:02:29,676 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 43 [2024-11-09 08:02:29,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:29,676 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2024-11-09 08:02:29,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 36 states have internal predecessors, (73), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2024-11-09 08:02:29,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 08:02:29,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:29,677 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:29,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:29,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:29,878 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:29,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash 533418291, now seen corresponding path program 2 times [2024-11-09 08:02:29,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:29,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930195032] [2024-11-09 08:02:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:29,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930195032] [2024-11-09 08:02:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930195032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463684460] [2024-11-09 08:02:29,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:02:29,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:29,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:29,981 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:29,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 08:02:30,184 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 08:02:30,184 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:02:30,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 08:02:30,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:02:30,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:02:30,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463684460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:30,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:30,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2024-11-09 08:02:30,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472778376] [2024-11-09 08:02:30,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:30,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:02:30,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:30,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:02:30,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:30,260 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:30,354 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2024-11-09 08:02:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 08:02:30,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-11-09 08:02:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:30,355 INFO L225 Difference]: With dead ends: 116 [2024-11-09 08:02:30,355 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 08:02:30,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:02:30,356 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 85 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:30,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 338 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 08:02:30,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2024-11-09 08:02:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 104 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2024-11-09 08:02:30,359 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 46 [2024-11-09 08:02:30,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:30,359 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2024-11-09 08:02:30,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2024-11-09 08:02:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 08:02:30,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:30,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:30,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 08:02:30,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 08:02:30,561 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:30,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:30,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1186042766, now seen corresponding path program 2 times [2024-11-09 08:02:30,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:30,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140355068] [2024-11-09 08:02:30,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:30,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:30,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:30,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:30,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:30,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140355068] [2024-11-09 08:02:30,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140355068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:30,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303537831] [2024-11-09 08:02:30,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:02:30,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:30,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:30,644 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:30,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 08:02:30,817 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 08:02:30,818 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:02:30,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 08:02:30,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:30,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:02:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:02:30,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303537831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:30,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:30,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 14 [2024-11-09 08:02:30,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545091476] [2024-11-09 08:02:30,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:30,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 08:02:30,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:30,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 08:02:30,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-09 08:02:30,963 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:31,073 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2024-11-09 08:02:31,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 08:02:31,074 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-09 08:02:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:31,074 INFO L225 Difference]: With dead ends: 108 [2024-11-09 08:02:31,074 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 08:02:31,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-09 08:02:31,075 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 28 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:31,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 440 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 08:02:31,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 08:02:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 104 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2024-11-09 08:02:31,077 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 47 [2024-11-09 08:02:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:31,077 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2024-11-09 08:02:31,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2024-11-09 08:02:31,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 08:02:31,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:31,077 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:31,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 08:02:31,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 08:02:31,282 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:31,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:31,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1294228216, now seen corresponding path program 1 times [2024-11-09 08:02:31,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:31,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439348066] [2024-11-09 08:02:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:31,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:31,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 08:02:31,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:31,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439348066] [2024-11-09 08:02:31,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439348066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:31,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:31,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:02:31,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890717770] [2024-11-09 08:02:31,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:31,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:02:31,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:31,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:02:31,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:31,361 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:31,412 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2024-11-09 08:02:31,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:02:31,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2024-11-09 08:02:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:31,413 INFO L225 Difference]: With dead ends: 107 [2024-11-09 08:02:31,413 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 08:02:31,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:31,414 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 14 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:31,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 266 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 08:02:31,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2024-11-09 08:02:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 99 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2024-11-09 08:02:31,416 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 50 [2024-11-09 08:02:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:31,416 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2024-11-09 08:02:31,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2024-11-09 08:02:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 08:02:31,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:31,417 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:31,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 08:02:31,417 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:31,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash 770114167, now seen corresponding path program 3 times [2024-11-09 08:02:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:31,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043157810] [2024-11-09 08:02:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:31,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:31,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:31,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:02:31,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:31,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043157810] [2024-11-09 08:02:31,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043157810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:31,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020234347] [2024-11-09 08:02:31,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 08:02:31,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:31,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:31,545 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:31,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 08:02:32,336 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 08:02:32,336 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:02:32,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:02:32,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:02:32,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:32,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020234347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:32,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:32,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-09 08:02:32,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580804508] [2024-11-09 08:02:32,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:32,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:02:32,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:32,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:02:32,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:02:32,397 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:32,421 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-09 08:02:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:02:32,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2024-11-09 08:02:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:32,422 INFO L225 Difference]: With dead ends: 101 [2024-11-09 08:02:32,422 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 08:02:32,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:02:32,422 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 35 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:32,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 266 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 08:02:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2024-11-09 08:02:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2024-11-09 08:02:32,426 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 51 [2024-11-09 08:02:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:32,427 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2024-11-09 08:02:32,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2024-11-09 08:02:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 08:02:32,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:32,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:32,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:32,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 08:02:32,628 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:32,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1784807392, now seen corresponding path program 1 times [2024-11-09 08:02:32,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:32,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489005907] [2024-11-09 08:02:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:32,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:32,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:32,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:32,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:32,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489005907] [2024-11-09 08:02:32,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489005907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:32,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170301926] [2024-11-09 08:02:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:32,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:32,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:32,731 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:32,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 08:02:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:32,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:02:32,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:32,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:32,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170301926] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:32,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:32,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-11-09 08:02:32,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600614917] [2024-11-09 08:02:32,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:32,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:02:32,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:32,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:02:32,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:32,956 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:33,013 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2024-11-09 08:02:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:02:33,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2024-11-09 08:02:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:33,014 INFO L225 Difference]: With dead ends: 97 [2024-11-09 08:02:33,014 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 08:02:33,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:33,015 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 36 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:33,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 394 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 08:02:33,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-11-09 08:02:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2024-11-09 08:02:33,017 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 53 [2024-11-09 08:02:33,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:33,017 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2024-11-09 08:02:33,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2024-11-09 08:02:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 08:02:33,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:33,018 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:33,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:33,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 08:02:33,218 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:33,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1935884788, now seen corresponding path program 1 times [2024-11-09 08:02:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:33,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301757151] [2024-11-09 08:02:33,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:33,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:34,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:34,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:34,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301757151] [2024-11-09 08:02:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301757151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:34,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545752985] [2024-11-09 08:02:34,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:34,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:34,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:34,214 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:34,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 08:02:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:34,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-09 08:02:34,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:34,469 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 08:02:34,585 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:34,585 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 08:02:34,631 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 11 treesize of output 7 [2024-11-09 08:02:34,673 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:02:34,673 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 32 treesize of output 31 [2024-11-09 08:02:34,733 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 08:02:34,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-09 08:02:34,741 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 26 treesize of output 21 [2024-11-09 08:02:34,915 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 08:02:34,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2024-11-09 08:02:35,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2024-11-09 08:02:35,113 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 18 treesize of output 13 [2024-11-09 08:02:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:35,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:35,524 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3399 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3399) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-11-09 08:02:35,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3399 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3399) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-11-09 08:02:35,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:35,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-09 08:02:35,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:35,551 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 50 treesize of output 49 [2024-11-09 08:02:35,555 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 18 treesize of output 14 [2024-11-09 08:02:35,743 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3394 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3394) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-09 08:02:35,796 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3393 (Array Int Int)) (v_ArrVal_3394 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3393) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3394) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-09 08:02:35,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:35,801 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 22 treesize of output 23 [2024-11-09 08:02:35,803 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 65 treesize of output 57 [2024-11-09 08:02:35,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 08:02:35,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 08:02:35,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 08:02:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 08:02:36,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545752985] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:36,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:36,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 28] total 75 [2024-11-09 08:02:36,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42567358] [2024-11-09 08:02:36,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:36,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-11-09 08:02:36,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:36,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-11-09 08:02:36,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=4695, Unknown=46, NotChecked=564, Total=5550 [2024-11-09 08:02:36,100 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 75 states, 74 states have (on average 1.8108108108108107) internal successors, (134), 66 states have internal predecessors, (134), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 08:02:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:37,643 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-09 08:02:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 08:02:37,644 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.8108108108108107) internal successors, (134), 66 states have internal predecessors, (134), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2024-11-09 08:02:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:37,644 INFO L225 Difference]: With dead ends: 93 [2024-11-09 08:02:37,644 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 08:02:37,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=469, Invalid=7691, Unknown=46, NotChecked=724, Total=8930 [2024-11-09 08:02:37,646 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 132 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:37,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1925 Invalid, 1759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1500 Invalid, 0 Unknown, 249 Unchecked, 0.7s Time] [2024-11-09 08:02:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 08:02:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 08:02:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 89 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-09 08:02:37,650 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 56 [2024-11-09 08:02:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:37,650 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-09 08:02:37,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.8108108108108107) internal successors, (134), 66 states have internal predecessors, (134), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 08:02:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-09 08:02:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 08:02:37,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:37,651 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:37,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 08:02:37,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:37,852 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:37,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1543015525, now seen corresponding path program 1 times [2024-11-09 08:02:37,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:37,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398275206] [2024-11-09 08:02:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:37,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:38,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:02:38,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398275206] [2024-11-09 08:02:38,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398275206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953300593] [2024-11-09 08:02:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:38,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:38,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:38,654 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:38,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 08:02:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:38,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-09 08:02:38,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:38,871 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 08:02:38,938 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:38,938 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 08:02:38,976 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 11 treesize of output 7 [2024-11-09 08:02:39,008 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:02:39,008 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 32 treesize of output 31 [2024-11-09 08:02:39,061 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 08:02:39,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-09 08:02:39,088 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 35 treesize of output 26 [2024-11-09 08:02:39,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:39,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:39,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:39,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2024-11-09 08:02:39,339 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:02:39,339 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 47 treesize of output 42 [2024-11-09 08:02:39,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:39,448 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 38 treesize of output 16 [2024-11-09 08:02:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 08:02:39,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:39,561 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3599 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3599) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-09 08:02:39,612 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3598))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3599)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= v_ArrVal_3598 (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_3598 .cse1))))))) is different from false [2024-11-09 08:02:39,630 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (or (not (= v_ArrVal_3598 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_3598 .cse0))))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3598) (select v_ArrVal_3598 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3599) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-09 08:02:39,641 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3598) (select v_ArrVal_3598 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3599) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_3598 .cse0))) v_ArrVal_3598)))) is different from false [2024-11-09 08:02:39,651 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (or (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_3598 .cse0))) v_ArrVal_3598)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3598) (select v_ArrVal_3598 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3599) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2024-11-09 08:02:39,665 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (or (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_3598 .cse0))) v_ArrVal_3598)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3598) (select v_ArrVal_3598 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3599) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2024-11-09 08:02:39,677 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2024-11-09 08:02:39,677 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 27 treesize of output 26 [2024-11-09 08:02:39,687 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3596))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3598 .cse1))) v_ArrVal_3598)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3598) (select v_ArrVal_3598 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3599) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2024-11-09 08:02:39,709 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3596))) (or (not (= v_ArrVal_3598 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3598 .cse1))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3598) (select v_ArrVal_3598 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3599) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2024-11-09 08:02:39,723 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3599 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3595) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3596))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3598) (select v_ArrVal_3598 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3599) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_3598 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3598 .cse1)))))))) is different from false [2024-11-09 08:02:39,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:39,744 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 58 treesize of output 58 [2024-11-09 08:02:39,748 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 113 treesize of output 109 [2024-11-09 08:02:39,752 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:39,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:39,758 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 95 [2024-11-09 08:02:39,764 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:39,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:39,770 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 81 [2024-11-09 08:02:39,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:39,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:39,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:39,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 77 [2024-11-09 08:02:39,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 08:02:39,847 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:39,847 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:39,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 123 [2024-11-09 08:02:39,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:39,875 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 0 case distinctions, treesize of input 95 treesize of output 75 [2024-11-09 08:02:39,888 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 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-09 08:02:39,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953300593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:39,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:39,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 43 [2024-11-09 08:02:39,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743085939] [2024-11-09 08:02:39,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:39,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 08:02:39,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:39,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 08:02:39,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2048, Unknown=73, NotChecked=900, Total=3192 [2024-11-09 08:02:39,954 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 44 states, 43 states have (on average 2.302325581395349) internal successors, (99), 39 states have internal predecessors, (99), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:40,634 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2024-11-09 08:02:40,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 08:02:40,635 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.302325581395349) internal successors, (99), 39 states have internal predecessors, (99), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-11-09 08:02:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:40,635 INFO L225 Difference]: With dead ends: 97 [2024-11-09 08:02:40,635 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 08:02:40,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=266, Invalid=3228, Unknown=82, NotChecked=1116, Total=4692 [2024-11-09 08:02:40,637 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:40,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1365 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 08:02:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 08:02:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 08:02:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 93 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:02:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2024-11-09 08:02:40,638 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 60 [2024-11-09 08:02:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:40,638 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2024-11-09 08:02:40,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.302325581395349) internal successors, (99), 39 states have internal predecessors, (99), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2024-11-09 08:02:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 08:02:40,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:40,639 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:40,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 08:02:40,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 08:02:40,840 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:02:40,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1543015524, now seen corresponding path program 1 times [2024-11-09 08:02:40,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:40,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395647651] [2024-11-09 08:02:40,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:40,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:41,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:41,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:02:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395647651] [2024-11-09 08:02:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395647651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016070240] [2024-11-09 08:02:42,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:42,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:42,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:42,045 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:42,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 08:02:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:42,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-09 08:02:42,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:42,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:02:42,271 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 08:02:42,516 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:02:42,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:02:42,526 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:42,526 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 08:02:42,607 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 08:02:42,614 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 11 treesize of output 7 [2024-11-09 08:02:42,659 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:02:42,659 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 57 treesize of output 50 [2024-11-09 08:02:42,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 08:02:42,745 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 08:02:42,746 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 08:02:42,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:42,752 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 08:02:42,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 08:02:42,760 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 35 treesize of output 26 [2024-11-09 08:02:42,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:42,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:42,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2024-11-09 08:02:42,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:42,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 08:02:43,197 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:02:43,197 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 67 treesize of output 58 [2024-11-09 08:02:43,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:43,207 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 33 treesize of output 18 [2024-11-09 08:02:43,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 16 [2024-11-09 08:02:43,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 08:02:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:02:43,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:54,651 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3800))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (< (+ 8 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 0) (forall ((v_ArrVal_3807 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int) (v_ArrVal_3805 Int)) (or (< 0 (+ 9 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse0 .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8) v_ArrVal_3805)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3799) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3807) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3800))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (< (+ 8 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 0) (forall ((v_ArrVal_3806 (Array Int Int)) (v_ArrVal_3807 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int) (v_ArrVal_3803 (Array Int Int)) (v_ArrVal_3805 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3799)) (.cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (or (let ((.cse6 (select v_ArrVal_3803 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< (+ (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse3 .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) .cse5 v_ArrVal_3805)) .cse6 v_ArrVal_3807) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 11) (select |c_#length| (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3803) .cse6 v_ArrVal_3806) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (not (= v_ArrVal_3803 (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 (select v_ArrVal_3803 .cse5)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))))) is different from false [2024-11-09 08:02:54,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3797 (Array Int Int)) (v_ArrVal_3798 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3798) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3800))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (forall ((v_ArrVal_3806 (Array Int Int)) (v_ArrVal_3807 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int) (v_ArrVal_3803 (Array Int Int)) (v_ArrVal_3805 Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3797) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3799)) (.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8))) (or (let ((.cse4 (select v_ArrVal_3803 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< (+ (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse1 .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) .cse3 v_ArrVal_3805)) .cse4 v_ArrVal_3807) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 11) (select |c_#length| (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3803) .cse4 v_ArrVal_3806) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (not (= v_ArrVal_3803 (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 (select v_ArrVal_3803 .cse3)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (< (+ (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 8) 0))))) (forall ((v_ArrVal_3797 (Array Int Int)) (v_ArrVal_3798 (Array Int Int)) (v_ArrVal_3799 (Array Int Int)) (v_ArrVal_3800 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3798) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3800))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (forall ((v_ArrVal_3807 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| Int) (v_ArrVal_3805 Int)) (or (< 0 (+ 9 (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse7 .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| 8) v_ArrVal_3805)) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3797) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3799) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3807) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< (+ (select .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 8) 0))))))) is different from false [2024-11-09 08:02:54,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:54,839 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 117 treesize of output 109 [2024-11-09 08:02:54,863 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 515 treesize of output 505 [2024-11-09 08:02:54,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:54,898 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 338 treesize of output 338 [2024-11-09 08:02:54,910 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:54,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 141 [2024-11-09 08:02:54,927 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:54,932 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 127 treesize of output 123 [2024-11-09 08:02:54,940 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:54,945 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 106 treesize of output 98 [2024-11-09 08:02:54,964 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 671 treesize of output 657 [2024-11-09 08:02:54,980 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:54,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 271 [2024-11-09 08:02:54,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:54,998 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 217 treesize of output 211 [2024-11-09 08:02:55,005 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:55,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 139 [2024-11-09 08:02:55,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-09 08:02:55,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2024-11-09 08:02:55,188 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:55,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:55,198 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:02:55,198 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 109 treesize of output 1 [2024-11-09 08:02:55,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016070240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:55,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:55,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 49 [2024-11-09 08:02:55,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544674829] [2024-11-09 08:02:55,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:55,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 08:02:55,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:55,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 08:02:55,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=4146, Unknown=59, NotChecked=262, Total=4692 [2024-11-09 08:02:55,919 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 50 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 44 states have internal predecessors, (110), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:03:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:00,141 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-11-09 08:03:00,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 08:03:00,141 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 44 states have internal predecessors, (110), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2024-11-09 08:03:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:00,142 INFO L225 Difference]: With dead ends: 97 [2024-11-09 08:03:00,142 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 08:03:00,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=385, Invalid=6530, Unknown=65, NotChecked=330, Total=7310 [2024-11-09 08:03:00,144 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 123 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:00,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1654 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 08:03:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 08:03:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-11-09 08:03:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 92 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:03:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2024-11-09 08:03:00,147 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 60 [2024-11-09 08:03:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:00,147 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2024-11-09 08:03:00,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 44 states have internal predecessors, (110), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:03:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2024-11-09 08:03:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 08:03:00,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:00,148 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:00,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-09 08:03:00,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 08:03:00,349 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:03:00,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:00,349 INFO L85 PathProgramCache]: Analyzing trace with hash -293976915, now seen corresponding path program 1 times [2024-11-09 08:03:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:00,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329227485] [2024-11-09 08:03:00,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:00,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:00,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:00,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:03:00,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:00,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329227485] [2024-11-09 08:03:00,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329227485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:00,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741165244] [2024-11-09 08:03:00,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:00,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:00,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:00,503 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:00,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 08:03:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:00,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:03:00,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:03:00,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:03:00,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741165244] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:03:00,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:03:00,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-11-09 08:03:00,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793533104] [2024-11-09 08:03:00,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:00,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:03:00,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:00,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:03:00,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:03:00,849 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:03:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:01,019 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2024-11-09 08:03:01,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:03:01,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2024-11-09 08:03:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:01,020 INFO L225 Difference]: With dead ends: 96 [2024-11-09 08:03:01,020 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 08:03:01,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:03:01,021 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 37 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:01,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 327 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:03:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 08:03:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 08:03:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 92 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:03:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2024-11-09 08:03:01,023 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 63 [2024-11-09 08:03:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:01,023 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2024-11-09 08:03:01,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:03:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2024-11-09 08:03:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 08:03:01,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:01,024 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:01,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-09 08:03:01,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 08:03:01,225 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:03:01,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1061167674, now seen corresponding path program 2 times [2024-11-09 08:03:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:01,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44546547] [2024-11-09 08:03:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:01,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:01,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:03:01,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:01,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44546547] [2024-11-09 08:03:01,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44546547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:01,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763829684] [2024-11-09 08:03:01,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:03:01,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:01,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:01,391 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:01,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 08:03:01,724 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 08:03:01,724 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:03:01,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 08:03:01,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 08:03:01,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 08:03:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763829684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:03:02,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:03:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2024-11-09 08:03:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173482371] [2024-11-09 08:03:02,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:02,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:03:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:03:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:03:02,225 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:03:02,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:02,443 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2024-11-09 08:03:02,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 08:03:02,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2024-11-09 08:03:02,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:02,444 INFO L225 Difference]: With dead ends: 87 [2024-11-09 08:03:02,444 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 08:03:02,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:03:02,444 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:02,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 274 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:03:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 08:03:02,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 08:03:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 83 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:03:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2024-11-09 08:03:02,446 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 63 [2024-11-09 08:03:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:02,446 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2024-11-09 08:03:02,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:03:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2024-11-09 08:03:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 08:03:02,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:02,447 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:02,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-09 08:03:02,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:02,647 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:03:02,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:02,648 INFO L85 PathProgramCache]: Analyzing trace with hash 933436846, now seen corresponding path program 1 times [2024-11-09 08:03:02,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:02,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831038894] [2024-11-09 08:03:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:02,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:04,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:05,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:05,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:05,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831038894] [2024-11-09 08:03:05,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831038894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:05,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981953854] [2024-11-09 08:03:05,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:05,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:05,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:05,548 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:05,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 08:03:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:05,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-09 08:03:05,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:05,905 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 08:03:06,510 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:03:06,510 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 08:03:06,683 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 11 treesize of output 7 [2024-11-09 08:03:06,801 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 08:03:06,973 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 08:03:06,988 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 26 treesize of output 21 [2024-11-09 08:03:07,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:07,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:07,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:07,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 24 [2024-11-09 08:03:08,650 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:03:08,650 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 81 treesize of output 70 [2024-11-09 08:03:08,665 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 25 treesize of output 17 [2024-11-09 08:03:08,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:08,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 34 treesize of output 21 [2024-11-09 08:03:09,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2024-11-09 08:03:09,810 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 21 treesize of output 13 [2024-11-09 08:03:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:10,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:11,836 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 76 treesize of output 56 [2024-11-09 08:03:11,864 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4395 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4395) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (forall ((v_ArrVal_4393 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4393) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))) is different from false [2024-11-09 08:03:11,904 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4393 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4393) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_4395 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4395) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2024-11-09 08:03:11,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:11,934 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 38 treesize of output 37 [2024-11-09 08:03:11,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-09 08:03:12,468 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4392 (Array Int Int))) (or (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_4392 .cse0))) v_ArrVal_4392)) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4392) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2024-11-09 08:03:13,547 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4389) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4390) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-09 08:03:13,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:13,567 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 22 treesize of output 23 [2024-11-09 08:03:13,572 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 131 treesize of output 119 [2024-11-09 08:03:13,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 08:03:13,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 08:03:13,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 08:03:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 08:03:15,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981953854] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:03:15,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:03:15,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32, 31] total 90 [2024-11-09 08:03:15,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452696731] [2024-11-09 08:03:15,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:15,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2024-11-09 08:03:15,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:15,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2024-11-09 08:03:15,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=6971, Unknown=58, NotChecked=684, Total=8010 [2024-11-09 08:03:15,484 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 90 states, 88 states have (on average 1.9204545454545454) internal successors, (169), 81 states have internal predecessors, (169), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 08:03:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:22,855 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2024-11-09 08:03:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 08:03:22,856 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 88 states have (on average 1.9204545454545454) internal successors, (169), 81 states have internal predecessors, (169), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2024-11-09 08:03:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:22,856 INFO L225 Difference]: With dead ends: 83 [2024-11-09 08:03:22,856 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 08:03:22,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3218 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=588, Invalid=11358, Unknown=60, NotChecked=876, Total=12882 [2024-11-09 08:03:22,858 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 122 mSDsluCounter, 2153 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2199 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:22,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 2199 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2335 Invalid, 0 Unknown, 222 Unchecked, 3.7s Time] [2024-11-09 08:03:22,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 08:03:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 08:03:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.173913043478261) internal successors, (81), 79 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:03:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2024-11-09 08:03:22,859 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 66 [2024-11-09 08:03:22,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:22,860 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2024-11-09 08:03:22,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 88 states have (on average 1.9204545454545454) internal successors, (169), 81 states have internal predecessors, (169), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 08:03:22,860 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2024-11-09 08:03:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 08:03:22,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:22,860 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:22,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-09 08:03:23,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:23,061 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:03:23,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash -602110429, now seen corresponding path program 1 times [2024-11-09 08:03:23,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:23,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881529023] [2024-11-09 08:03:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:23,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:23,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:23,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 08:03:23,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:23,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881529023] [2024-11-09 08:03:23,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881529023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:23,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:03:23,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 08:03:23,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126058660] [2024-11-09 08:03:23,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:23,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:03:23,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:23,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:03:23,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:03:23,359 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:03:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:23,834 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2024-11-09 08:03:23,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:03:23,835 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-11-09 08:03:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:23,835 INFO L225 Difference]: With dead ends: 97 [2024-11-09 08:03:23,835 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 08:03:23,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:03:23,836 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:23,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 301 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 08:03:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 08:03:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2024-11-09 08:03:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 82 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:03:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-09 08:03:23,837 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 68 [2024-11-09 08:03:23,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:23,837 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-09 08:03:23,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:03:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-09 08:03:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 08:03:23,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:23,838 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:23,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 08:03:23,838 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:03:23,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash -602110428, now seen corresponding path program 1 times [2024-11-09 08:03:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:23,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076486256] [2024-11-09 08:03:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:23,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:24,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:24,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 08:03:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076486256] [2024-11-09 08:03:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076486256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:24,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:03:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 08:03:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805015712] [2024-11-09 08:03:24,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:24,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:03:24,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:24,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:03:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:03:24,208 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:03:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:24,579 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-11-09 08:03:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:03:24,580 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-11-09 08:03:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:24,580 INFO L225 Difference]: With dead ends: 84 [2024-11-09 08:03:24,580 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 08:03:24,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:03:24,581 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:24,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 335 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 08:03:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 08:03:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 08:03:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:03:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-11-09 08:03:24,582 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 68 [2024-11-09 08:03:24,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:24,583 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-11-09 08:03:24,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:03:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-11-09 08:03:24,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 08:03:24,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:24,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:24,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 08:03:24,584 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:03:24,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:24,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1485520219, now seen corresponding path program 1 times [2024-11-09 08:03:24,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:24,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409646882] [2024-11-09 08:03:24,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:24,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:24,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:24,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 08:03:24,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:24,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409646882] [2024-11-09 08:03:24,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409646882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:24,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:03:24,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 08:03:24,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678134983] [2024-11-09 08:03:24,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:24,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:03:24,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:24,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:03:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:03:24,850 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:03:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:25,141 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-09 08:03:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:03:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-11-09 08:03:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:25,142 INFO L225 Difference]: With dead ends: 84 [2024-11-09 08:03:25,142 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 08:03:25,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:03:25,142 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 17 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:25,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 383 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:03:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 08:03:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 08:03:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 80 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:03:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2024-11-09 08:03:25,145 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 69 [2024-11-09 08:03:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:25,145 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2024-11-09 08:03:25,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:03:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2024-11-09 08:03:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 08:03:25,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:25,146 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:25,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 08:03:25,146 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:03:25,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1688269605, now seen corresponding path program 1 times [2024-11-09 08:03:25,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:25,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569654157] [2024-11-09 08:03:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:25,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:25,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 08:03:25,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569654157] [2024-11-09 08:03:25,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569654157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509197528] [2024-11-09 08:03:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:25,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:25,494 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:25,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 08:03:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:25,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-09 08:03:25,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:25,783 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 08:03:26,168 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:03:26,169 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 08:03:26,321 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 11 treesize of output 7 [2024-11-09 08:03:26,458 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:03:26,459 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 32 treesize of output 31 [2024-11-09 08:03:26,638 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 08:03:26,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-09 08:03:26,735 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 35 treesize of output 26 [2024-11-09 08:03:27,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:27,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:27,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:27,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2024-11-09 08:03:27,840 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:03:27,840 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 51 treesize of output 46 [2024-11-09 08:03:28,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:28,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 08:03:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 08:03:28,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:30,240 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2024-11-09 08:03:30,241 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 27 treesize of output 26 [2024-11-09 08:03:30,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:30,928 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 58 treesize of output 58 [2024-11-09 08:03:30,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 109 [2024-11-09 08:03:30,944 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:03:30,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:30,959 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 95 [2024-11-09 08:03:30,967 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:03:30,968 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:03:30,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:30,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 91 [2024-11-09 08:03:31,000 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:03:31,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:31,015 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2024-11-09 08:03:31,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 08:03:31,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:03:31,123 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:03:31,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 120 [2024-11-09 08:03:31,175 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:03:31,175 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 0 case distinctions, treesize of input 92 treesize of output 72 [2024-11-09 08:03:31,211 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 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-09 08:03:31,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509197528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:31,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:03:31,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 24] total 30 [2024-11-09 08:03:31,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454240704] [2024-11-09 08:03:31,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:31,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 08:03:31,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:31,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 08:03:31,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2077, Unknown=33, NotChecked=0, Total=2256 [2024-11-09 08:03:31,714 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 31 states, 30 states have (on average 3.6) internal successors, (108), 27 states have internal predecessors, (108), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:03:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:33,714 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2024-11-09 08:03:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 08:03:33,715 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.6) internal successors, (108), 27 states have internal predecessors, (108), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 71 [2024-11-09 08:03:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:33,715 INFO L225 Difference]: With dead ends: 91 [2024-11-09 08:03:33,715 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 08:03:33,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=190, Invalid=2747, Unknown=33, NotChecked=0, Total=2970 [2024-11-09 08:03:33,716 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:33,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 654 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 08:03:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 08:03:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2024-11-09 08:03:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.135135135135135) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:03:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-11-09 08:03:33,718 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 71 [2024-11-09 08:03:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:33,718 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-11-09 08:03:33,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.6) internal successors, (108), 27 states have internal predecessors, (108), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:03:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-11-09 08:03:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 08:03:33,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:33,719 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:33,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-09 08:03:33,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-09 08:03:33,919 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 08:03:33,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:33,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1688269604, now seen corresponding path program 1 times [2024-11-09 08:03:33,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:33,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109677175] [2024-11-09 08:03:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:35,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:35,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:03:35,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:35,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109677175] [2024-11-09 08:03:35,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109677175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:35,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802515872] [2024-11-09 08:03:35,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:35,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:35,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:35,929 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:35,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 08:03:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:36,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-09 08:03:36,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:36,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:03:36,221 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 08:03:36,991 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:03:36,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:03:37,018 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:03:37,018 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 08:03:37,381 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 11 treesize of output 7 [2024-11-09 08:03:37,389 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 08:03:37,622 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:03:37,623 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 57 treesize of output 50 [2024-11-09 08:03:37,634 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 31 treesize of output 16 [2024-11-09 08:03:38,100 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 08:03:38,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 08:03:38,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:38,127 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 16 [2024-11-09 08:03:38,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 40 treesize of output 20 [2024-11-09 08:03:38,324 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 35 treesize of output 26 [2024-11-09 08:03:39,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:39,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:39,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2024-11-09 08:03:39,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:39,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:39,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2024-11-09 08:03:40,054 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:03:40,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2024-11-09 08:03:40,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:40,074 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 46 treesize of output 27