./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:18:05,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:18:05,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:18:05,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:18:05,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:18:05,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:18:05,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:18:05,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:18:05,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:18:05,287 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:18:05,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:18:05,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:18:05,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:18:05,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:18:05,291 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:18:05,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:18:05,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:18:05,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:18:05,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:18:05,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:18:05,296 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:18:05,296 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:18:05,296 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:18:05,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:18:05,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:18:05,297 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:18:05,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:18:05,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:18:05,298 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:18:05,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:18:05,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:18:05,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:18:05,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:18:05,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:18:05,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:18:05,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:18:05,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:18:05,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:18:05,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:18:05,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:18:05,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:18:05,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:18:05,303 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/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-clean/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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2024-10-11 18:18:05,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:18:05,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:18:05,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:18:05,645 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:18:05,645 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:18:05,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2024-10-11 18:18:07,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:18:07,340 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:18:07,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2024-10-11 18:18:07,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/da8a2abd4/0eb10b39113443889f68c316d0136bfb/FLAG875d3cf37 [2024-10-11 18:18:07,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/da8a2abd4/0eb10b39113443889f68c316d0136bfb [2024-10-11 18:18:07,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:18:07,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:18:07,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:18:07,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:18:07,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:18:07,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:18:07" (1/1) ... [2024-10-11 18:18:07,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e583725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:07, skipping insertion in model container [2024-10-11 18:18:07,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:18:07" (1/1) ... [2024-10-11 18:18:07,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:18:08,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:18:08,050 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:18:08,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:18:08,132 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:18:08,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08 WrapperNode [2024-10-11 18:18:08,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:18:08,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:18:08,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:18:08,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:18:08,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (1/1) ... [2024-10-11 18:18:08,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (1/1) ... [2024-10-11 18:18:08,195 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-10-11 18:18:08,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:18:08,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:18:08,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:18:08,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:18:08,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (1/1) ... [2024-10-11 18:18:08,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (1/1) ... [2024-10-11 18:18:08,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (1/1) ... [2024-10-11 18:18:08,238 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-11 18:18:08,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (1/1) ... [2024-10-11 18:18:08,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (1/1) ... [2024-10-11 18:18:08,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (1/1) ... [2024-10-11 18:18:08,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (1/1) ... [2024-10-11 18:18:08,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (1/1) ... [2024-10-11 18:18:08,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (1/1) ... [2024-10-11 18:18:08,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:18:08,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:18:08,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:18:08,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:18:08,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (1/1) ... [2024-10-11 18:18:08,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:18:08,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:08,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:18:08,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:18:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:18:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:18:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:18:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:18:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 18:18:08,365 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 18:18:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:18:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:18:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:18:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:18:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:18:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:18:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:18:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:18:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:18:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:18:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:18:08,522 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:18:08,524 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:18:08,889 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-11 18:18:08,890 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:18:08,956 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:18:08,956 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 18:18:08,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:18:08 BoogieIcfgContainer [2024-10-11 18:18:08,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:18:08,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:18:08,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:18:08,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:18:08,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:18:07" (1/3) ... [2024-10-11 18:18:08,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56249087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:18:08, skipping insertion in model container [2024-10-11 18:18:08,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:18:08" (2/3) ... [2024-10-11 18:18:08,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56249087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:18:08, skipping insertion in model container [2024-10-11 18:18:08,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:18:08" (3/3) ... [2024-10-11 18:18:08,968 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2024-10-11 18:18:08,986 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:18:08,987 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-11 18:18:09,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:18:09,053 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;@a32988e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:18:09,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-11 18:18:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 37 states have (on average 2.189189189189189) internal successors, (81), 65 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-10-11 18:18:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:18:09,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:09,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:18:09,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:09,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash 209499439, now seen corresponding path program 1 times [2024-10-11 18:18:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:09,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653977869] [2024-10-11 18:18:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:18:09,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:09,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653977869] [2024-10-11 18:18:09,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653977869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:09,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:09,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:18:09,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819901916] [2024-10-11 18:18:09,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:09,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:18:09,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:09,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:18:09,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:18:09,412 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 2.189189189189189) internal successors, (81), 65 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 18:18:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:09,513 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-10-11 18:18:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:18:09,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-11 18:18:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:09,523 INFO L225 Difference]: With dead ends: 66 [2024-10-11 18:18:09,524 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 18:18:09,526 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-10-11 18:18:09,529 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:09,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 18:18:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 18:18:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 60 states have internal predecessors, (67), 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-10-11 18:18:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2024-10-11 18:18:09,566 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 5 [2024-10-11 18:18:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:09,566 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2024-10-11 18:18:09,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 18:18:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-10-11 18:18:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:18:09,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:09,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:18:09,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:18:09,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:09,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:09,570 INFO L85 PathProgramCache]: Analyzing trace with hash 209499440, now seen corresponding path program 1 times [2024-10-11 18:18:09,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:09,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350551706] [2024-10-11 18:18:09,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:09,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:18:09,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:09,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350551706] [2024-10-11 18:18:09,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350551706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:09,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:09,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:18:09,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692047519] [2024-10-11 18:18:09,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:09,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:18:09,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:09,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:18:09,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:18:09,714 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 18:18:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:09,783 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2024-10-11 18:18:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:18:09,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-11 18:18:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:09,785 INFO L225 Difference]: With dead ends: 62 [2024-10-11 18:18:09,785 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 18:18:09,786 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-10-11 18:18:09,787 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:09,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 18:18:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 18:18:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 58 states have internal predecessors, (65), 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-10-11 18:18:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-10-11 18:18:09,793 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 5 [2024-10-11 18:18:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:09,794 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-10-11 18:18:09,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 18:18:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-10-11 18:18:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:18:09,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:09,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:09,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:18:09,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:09,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1748640650, now seen corresponding path program 1 times [2024-10-11 18:18:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:09,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334459946] [2024-10-11 18:18:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:09,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:18:09,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:09,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334459946] [2024-10-11 18:18:09,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334459946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:09,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:09,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:18:09,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074236676] [2024-10-11 18:18:09,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:09,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:18:09,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:09,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:18:09,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:18:09,983 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-11 18:18:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:10,088 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-10-11 18:18:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:18:10,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-10-11 18:18:10,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:10,090 INFO L225 Difference]: With dead ends: 68 [2024-10-11 18:18:10,090 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 18:18:10,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-11 18:18:10,091 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:10,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 138 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 18:18:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2024-10-11 18:18:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 59 states have internal predecessors, (66), 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-10-11 18:18:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-10-11 18:18:10,109 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 10 [2024-10-11 18:18:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:10,110 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-10-11 18:18:10,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-11 18:18:10,110 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-10-11 18:18:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:18:10,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:10,111 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:10,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:18:10,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:10,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:10,112 INFO L85 PathProgramCache]: Analyzing trace with hash 420391556, now seen corresponding path program 1 times [2024-10-11 18:18:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:10,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702684333] [2024-10-11 18:18:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:10,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:10,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:10,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:18:10,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:10,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702684333] [2024-10-11 18:18:10,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702684333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:10,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:10,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:18:10,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437823832] [2024-10-11 18:18:10,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:10,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:18:10,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:10,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:18:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:18:10,402 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-10-11 18:18:10,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:10,571 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2024-10-11 18:18:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:18:10,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 17 [2024-10-11 18:18:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:10,574 INFO L225 Difference]: With dead ends: 62 [2024-10-11 18:18:10,575 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 18:18:10,575 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-10-11 18:18:10,576 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:10,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 227 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:18:10,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 18:18:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 18:18:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 58 states have internal predecessors, (65), 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-10-11 18:18:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-10-11 18:18:10,590 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 17 [2024-10-11 18:18:10,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:10,591 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-10-11 18:18:10,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-10-11 18:18:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-10-11 18:18:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:18:10,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:10,592 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:10,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:18:10,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:10,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash 420391557, now seen corresponding path program 1 times [2024-10-11 18:18:10,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:10,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728654202] [2024-10-11 18:18:10,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:10,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:10,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:10,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728654202] [2024-10-11 18:18:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728654202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:10,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:10,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:18:10,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840631373] [2024-10-11 18:18:10,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:10,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:18:10,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:10,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:18:10,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:18:10,879 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-10-11 18:18:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:11,006 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2024-10-11 18:18:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:18:11,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2024-10-11 18:18:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:11,008 INFO L225 Difference]: With dead ends: 61 [2024-10-11 18:18:11,008 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 18:18:11,008 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-10-11 18:18:11,009 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:11,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 18:18:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 18:18:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 57 states have internal predecessors, (64), 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-10-11 18:18:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-10-11 18:18:11,015 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 17 [2024-10-11 18:18:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:11,016 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-10-11 18:18:11,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-10-11 18:18:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-10-11 18:18:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:18:11,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:11,017 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:11,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:18:11,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:11,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:11,018 INFO L85 PathProgramCache]: Analyzing trace with hash 269529954, now seen corresponding path program 1 times [2024-10-11 18:18:11,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:11,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713012226] [2024-10-11 18:18:11,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:11,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:11,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:11,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:18:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713012226] [2024-10-11 18:18:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713012226] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357113060] [2024-10-11 18:18:11,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:11,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:11,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:11,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:11,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:18:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:11,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:18:11,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:11,534 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-10-11 18:18:11,587 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-10-11 18:18:11,621 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:18:11,622 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-10-11 18:18:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-11 18:18:11,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:11,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357113060] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:18:11,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:18:11,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-10-11 18:18:11,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728535190] [2024-10-11 18:18:11,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:11,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:18:11,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:11,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:18:11,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-10-11 18:18:11,819 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-10-11 18:18:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:12,044 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2024-10-11 18:18:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:18:12,045 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 19 [2024-10-11 18:18:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:12,046 INFO L225 Difference]: With dead ends: 60 [2024-10-11 18:18:12,046 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 18:18:12,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:18:12,049 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:12,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2024-10-11 18:18:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 18:18:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 18:18:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 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-10-11 18:18:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-10-11 18:18:12,057 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 19 [2024-10-11 18:18:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:12,059 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-10-11 18:18:12,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-10-11 18:18:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-10-11 18:18:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:18:12,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:12,060 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:12,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:18:12,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:12,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:12,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 269529955, now seen corresponding path program 1 times [2024-10-11 18:18:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200736301] [2024-10-11 18:18:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:12,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:12,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:12,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200736301] [2024-10-11 18:18:12,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200736301] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:12,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733051430] [2024-10-11 18:18:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:12,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:12,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:12,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:18:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:12,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 18:18:12,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:12,901 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-10-11 18:18:12,904 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-10-11 18:18:12,979 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-10-11 18:18:13,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:13,027 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-10-11 18:18:13,041 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:18:13,041 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-10-11 18:18:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-11 18:18:13,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733051430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:13,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:18:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2024-10-11 18:18:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580423] [2024-10-11 18:18:13,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:13,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:18:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:13,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:18:13,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2024-10-11 18:18:13,205 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 13 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:18:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:13,471 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-10-11 18:18:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:18:13,471 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-11 18:18:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:13,473 INFO L225 Difference]: With dead ends: 66 [2024-10-11 18:18:13,474 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 18:18:13,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:18:13,475 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:13,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 284 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2024-10-11 18:18:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 18:18:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-11 18:18:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.7) internal successors, (68), 60 states have internal predecessors, (68), 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-10-11 18:18:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2024-10-11 18:18:13,480 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 19 [2024-10-11 18:18:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:13,482 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2024-10-11 18:18:13,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:18:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2024-10-11 18:18:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:18:13,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:13,483 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:13,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:18:13,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:13,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:13,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:13,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2017091990, now seen corresponding path program 1 times [2024-10-11 18:18:13,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:13,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506471838] [2024-10-11 18:18:13,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:13,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:13,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:18:13,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:13,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506471838] [2024-10-11 18:18:13,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506471838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:13,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:13,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:18:13,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590108834] [2024-10-11 18:18:13,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:13,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:18:13,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:13,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:18:13,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:18:13,879 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-10-11 18:18:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:14,100 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2024-10-11 18:18:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:18:14,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 22 [2024-10-11 18:18:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:14,102 INFO L225 Difference]: With dead ends: 68 [2024-10-11 18:18:14,102 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 18:18:14,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:18:14,103 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 35 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:14,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 286 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:18:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 18:18:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 18:18:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 63 states have internal predecessors, (74), 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-10-11 18:18:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2024-10-11 18:18:14,112 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 22 [2024-10-11 18:18:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:14,113 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2024-10-11 18:18:14,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-10-11 18:18:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2024-10-11 18:18:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:18:14,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:14,114 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:14,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:18:14,114 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:14,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:14,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2017091989, now seen corresponding path program 1 times [2024-10-11 18:18:14,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:14,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854931570] [2024-10-11 18:18:14,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:14,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:14,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:14,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:14,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:14,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854931570] [2024-10-11 18:18:14,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854931570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:14,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:14,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:18:14,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944376516] [2024-10-11 18:18:14,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:14,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:18:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:14,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:18:14,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:18:14,461 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 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-10-11 18:18:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:14,651 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2024-10-11 18:18:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:18:14,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 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 22 [2024-10-11 18:18:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:14,652 INFO L225 Difference]: With dead ends: 68 [2024-10-11 18:18:14,652 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 18:18:14,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:18:14,653 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 32 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:14,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 326 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:18:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 18:18:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 18:18:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 63 states have internal predecessors, (72), 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-10-11 18:18:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-10-11 18:18:14,665 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 22 [2024-10-11 18:18:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:14,666 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-10-11 18:18:14,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 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-10-11 18:18:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-10-11 18:18:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:18:14,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:14,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:14,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:18:14,667 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:14,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:14,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1396384217, now seen corresponding path program 1 times [2024-10-11 18:18:14,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:14,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904904713] [2024-10-11 18:18:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:14,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:14,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:18:14,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:14,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904904713] [2024-10-11 18:18:14,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904904713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:14,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:14,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:18:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80093928] [2024-10-11 18:18:14,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:14,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:18:14,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:18:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:18:14,769 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-10-11 18:18:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:14,863 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2024-10-11 18:18:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:18:14,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 24 [2024-10-11 18:18:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:14,865 INFO L225 Difference]: With dead ends: 88 [2024-10-11 18:18:14,865 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 18:18:14,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-11 18:18:14,866 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 16 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:14,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 170 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 18:18:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2024-10-11 18:18:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 65 states have internal predecessors, (75), 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-10-11 18:18:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2024-10-11 18:18:14,871 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 24 [2024-10-11 18:18:14,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:14,871 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2024-10-11 18:18:14,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-10-11 18:18:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2024-10-11 18:18:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:18:14,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:14,872 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:14,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:18:14,873 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:14,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1396384272, now seen corresponding path program 1 times [2024-10-11 18:18:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:14,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934471828] [2024-10-11 18:18:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:14,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:15,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:15,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:18:15,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:15,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934471828] [2024-10-11 18:18:15,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934471828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:15,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:15,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:18:15,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221940073] [2024-10-11 18:18:15,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:15,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:18:15,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:18:15,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:18:15,071 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 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-10-11 18:18:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:15,255 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2024-10-11 18:18:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:18:15,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 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-10-11 18:18:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:15,256 INFO L225 Difference]: With dead ends: 73 [2024-10-11 18:18:15,256 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 18:18:15,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:18:15,257 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 33 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:15,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 286 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:18:15,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 18:18:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 18:18:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.6875) internal successors, (81), 68 states have internal predecessors, (81), 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-10-11 18:18:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2024-10-11 18:18:15,262 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 24 [2024-10-11 18:18:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:15,263 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-10-11 18:18:15,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 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-10-11 18:18:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2024-10-11 18:18:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:18:15,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:15,263 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:15,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:18:15,264 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:15,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:15,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1396384271, now seen corresponding path program 1 times [2024-10-11 18:18:15,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:15,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002474430] [2024-10-11 18:18:15,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:15,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:15,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:15,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:18:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:15,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002474430] [2024-10-11 18:18:15,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002474430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:15,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57632586] [2024-10-11 18:18:15,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:15,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:15,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:15,389 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:15,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:18:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:15,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:18:15,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:18:15,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:18:15,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57632586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:15,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:18:15,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-10-11 18:18:15,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318802702] [2024-10-11 18:18:15,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:15,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:18:15,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:15,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:18:15,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:18:15,548 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-10-11 18:18:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:15,587 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2024-10-11 18:18:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:18:15,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 24 [2024-10-11 18:18:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:15,589 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:18:15,589 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:18:15,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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-10-11 18:18:15,590 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:15,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 97 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:18:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:18:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2024-10-11 18:18:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.653061224489796) internal successors, (81), 69 states have internal predecessors, (81), 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-10-11 18:18:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2024-10-11 18:18:15,594 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 24 [2024-10-11 18:18:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:15,594 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2024-10-11 18:18:15,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-10-11 18:18:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2024-10-11 18:18:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:18:15,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:15,595 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:15,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 18:18:15,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:15,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:15,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:15,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1394965995, now seen corresponding path program 1 times [2024-10-11 18:18:15,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:15,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121125274] [2024-10-11 18:18:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:15,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:15,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:18:15,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:15,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121125274] [2024-10-11 18:18:15,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121125274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:15,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:15,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:18:15,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711856222] [2024-10-11 18:18:15,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:15,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:18:15,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:15,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:18:15,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:18:15,889 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-10-11 18:18:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:15,967 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2024-10-11 18:18:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:18:15,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 24 [2024-10-11 18:18:15,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:15,968 INFO L225 Difference]: With dead ends: 82 [2024-10-11 18:18:15,968 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 18:18:15,969 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-10-11 18:18:15,970 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:15,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 176 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 18:18:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2024-10-11 18:18:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.64) internal successors, (82), 70 states have internal predecessors, (82), 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-10-11 18:18:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2024-10-11 18:18:15,974 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 24 [2024-10-11 18:18:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:15,974 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2024-10-11 18:18:15,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-10-11 18:18:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2024-10-11 18:18:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:18:15,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:15,975 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:15,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:18:15,976 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:15,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash -968235387, now seen corresponding path program 1 times [2024-10-11 18:18:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:15,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460099669] [2024-10-11 18:18:15,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:15,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:16,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:18:16,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:16,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460099669] [2024-10-11 18:18:16,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460099669] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:16,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640017900] [2024-10-11 18:18:16,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:16,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:16,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:16,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:16,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:18:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:16,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:18:16,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:18:16,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:18:16,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640017900] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:18:16,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:18:16,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-10-11 18:18:16,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745419704] [2024-10-11 18:18:16,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:16,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:18:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:16,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:18:16,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:18:16,379 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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-10-11 18:18:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:16,517 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2024-10-11 18:18:16,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:18:16,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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 27 [2024-10-11 18:18:16,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:16,519 INFO L225 Difference]: With dead ends: 108 [2024-10-11 18:18:16,519 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 18:18:16,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:18:16,519 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 107 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:16,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 231 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 18:18:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 80. [2024-10-11 18:18:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 75 states have internal predecessors, (89), 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-10-11 18:18:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2024-10-11 18:18:16,522 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 27 [2024-10-11 18:18:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:16,523 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2024-10-11 18:18:16,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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-10-11 18:18:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2024-10-11 18:18:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:18:16,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:16,524 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:16,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:18:16,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 18:18:16,724 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:16,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:16,725 INFO L85 PathProgramCache]: Analyzing trace with hash -966817111, now seen corresponding path program 1 times [2024-10-11 18:18:16,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:16,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215705298] [2024-10-11 18:18:16,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:16,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:17,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:17,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:17,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:17,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215705298] [2024-10-11 18:18:17,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215705298] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:17,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803476771] [2024-10-11 18:18:17,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:17,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:17,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:17,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:17,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:18:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:17,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-11 18:18:17,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:17,569 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-10-11 18:18:17,671 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:18:17,672 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-10-11 18:18:17,733 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-10-11 18:18:17,783 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:17,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-11 18:18:17,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:17,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-10-11 18:18:17,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:18:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:17,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:22,088 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-10-11 18:18:22,089 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-10-11 18:18:22,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:22,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-10-11 18:18:22,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-11 18:18:22,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:18:22,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803476771] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:22,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:18:22,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 25 [2024-10-11 18:18:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640522355] [2024-10-11 18:18:22,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:22,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 18:18:22,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:22,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 18:18:22,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=728, Unknown=11, NotChecked=0, Total=812 [2024-10-11 18:18:22,228 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 26 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 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-10-11 18:18:22,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:22,799 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2024-10-11 18:18:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:18:22,800 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 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 27 [2024-10-11 18:18:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:22,801 INFO L225 Difference]: With dead ends: 121 [2024-10-11 18:18:22,801 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 18:18:22,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=106, Invalid=1004, Unknown=12, NotChecked=0, Total=1122 [2024-10-11 18:18:22,802 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 95 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:22,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 676 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:18:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 18:18:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2024-10-11 18:18:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 86 states have internal predecessors, (105), 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-10-11 18:18:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2024-10-11 18:18:22,810 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 27 [2024-10-11 18:18:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:22,811 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2024-10-11 18:18:22,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 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-10-11 18:18:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2024-10-11 18:18:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:18:22,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:22,815 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:22,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:18:23,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 18:18:23,020 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:23,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash -966817110, now seen corresponding path program 1 times [2024-10-11 18:18:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:23,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611712130] [2024-10-11 18:18:23,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:23,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:23,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:23,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611712130] [2024-10-11 18:18:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611712130] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:23,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736993163] [2024-10-11 18:18:23,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:23,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:23,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:23,989 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:24,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:18:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:24,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-11 18:18:24,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:24,170 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-10-11 18:18:24,181 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-10-11 18:18:24,449 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:18:24,450 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-10-11 18:18:24,464 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:18:24,465 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-10-11 18:18:24,561 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-10-11 18:18:24,572 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-10-11 18:18:24,650 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:24,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 50 treesize of output 45 [2024-10-11 18:18:24,657 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-10-11 18:18:24,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:24,791 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 37 treesize of output 17 [2024-10-11 18:18:24,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:24,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 27 treesize of output 11 [2024-10-11 18:18:24,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:18:24,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:18:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:24,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:25,384 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1167) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1166 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))) is different from false [2024-10-11 18:18:25,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:25,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-10-11 18:18:25,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:25,423 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-10-11 18:18:25,429 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 52 treesize of output 44 [2024-10-11 18:18:25,434 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 82 treesize of output 70 [2024-10-11 18:18:25,448 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-10-11 18:18:25,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-11 18:18:25,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:25,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-10-11 18:18:25,466 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:18:25,469 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 18 treesize of output 10 [2024-10-11 18:18:25,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736993163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:25,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:18:25,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2024-10-11 18:18:25,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552070839] [2024-10-11 18:18:25,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:25,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 18:18:25,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:25,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 18:18:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1375, Unknown=1, NotChecked=74, Total=1560 [2024-10-11 18:18:25,662 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 32 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 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-10-11 18:18:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:26,494 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2024-10-11 18:18:26,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:18:26,495 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 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 27 [2024-10-11 18:18:26,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:26,495 INFO L225 Difference]: With dead ends: 128 [2024-10-11 18:18:26,496 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 18:18:26,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=153, Invalid=1742, Unknown=1, NotChecked=84, Total=1980 [2024-10-11 18:18:26,497 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 92 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:26,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 868 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:18:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 18:18:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2024-10-11 18:18:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.591549295774648) internal successors, (113), 91 states have internal predecessors, (113), 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-10-11 18:18:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2024-10-11 18:18:26,504 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 27 [2024-10-11 18:18:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:26,504 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2024-10-11 18:18:26,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 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-10-11 18:18:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2024-10-11 18:18:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:18:26,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:26,505 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:26,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:18:26,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 18:18:26,707 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:26,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:26,707 INFO L85 PathProgramCache]: Analyzing trace with hash -481630729, now seen corresponding path program 2 times [2024-10-11 18:18:26,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:26,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796069071] [2024-10-11 18:18:26,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:26,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:26,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:26,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 18:18:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 18:18:26,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:26,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796069071] [2024-10-11 18:18:26,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796069071] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381999847] [2024-10-11 18:18:26,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:18:26,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:26,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:26,830 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:26,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:18:26,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:18:26,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:18:26,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:18:26,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:18:27,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:18:27,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381999847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:27,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:18:27,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-11 18:18:27,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510018232] [2024-10-11 18:18:27,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:27,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:18:27,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:27,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:18:27,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:18:27,009 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10-11 18:18:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:27,036 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2024-10-11 18:18:27,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:18:27,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 28 [2024-10-11 18:18:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:27,037 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:18:27,037 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:18:27,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-10-11 18:18:27,038 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:27,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:18:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:18:27,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 18:18:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.619047619047619) internal successors, (102), 82 states have internal predecessors, (102), 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-10-11 18:18:27,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2024-10-11 18:18:27,045 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 28 [2024-10-11 18:18:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:27,046 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2024-10-11 18:18:27,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10-11 18:18:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2024-10-11 18:18:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:18:27,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:27,047 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:27,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 18:18:27,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:27,248 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:27,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:27,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1398121836, now seen corresponding path program 2 times [2024-10-11 18:18:27,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:27,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526980265] [2024-10-11 18:18:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:27,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:27,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:27,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:18:27,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526980265] [2024-10-11 18:18:27,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526980265] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193945197] [2024-10-11 18:18:27,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:18:27,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:27,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:27,366 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:27,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:18:27,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:18:27,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:18:27,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 18:18:27,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:18:27,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:18:27,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193945197] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:18:27,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:18:27,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2024-10-11 18:18:27,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109241758] [2024-10-11 18:18:27,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:27,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:18:27,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:27,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:18:27,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:18:27,628 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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-10-11 18:18:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:27,766 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2024-10-11 18:18:27,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:18:27,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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 29 [2024-10-11 18:18:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:27,767 INFO L225 Difference]: With dead ends: 79 [2024-10-11 18:18:27,767 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 18:18:27,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 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-10-11 18:18:27,768 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 58 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:27,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 224 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 18:18:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2024-10-11 18:18:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 71 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-10-11 18:18:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2024-10-11 18:18:27,772 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 29 [2024-10-11 18:18:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:27,772 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2024-10-11 18:18:27,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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-10-11 18:18:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2024-10-11 18:18:27,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:18:27,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:27,775 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-10-11 18:18:27,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 18:18:27,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:18:27,975 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:27,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:27,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2037701263, now seen corresponding path program 2 times [2024-10-11 18:18:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:27,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110720672] [2024-10-11 18:18:27,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:28,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:28,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:18:28,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:28,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110720672] [2024-10-11 18:18:28,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110720672] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:28,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607112471] [2024-10-11 18:18:28,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:18:28,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:28,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:28,151 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:28,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:18:28,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 18:18:28,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:18:28,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 18:18:28,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:28,327 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-10-11 18:18:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:18:28,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:18:28,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607112471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:28,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:18:28,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2024-10-11 18:18:28,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744067157] [2024-10-11 18:18:28,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:28,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:18:28,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:28,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:18:28,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:18:28,513 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-10-11 18:18:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:28,657 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2024-10-11 18:18:28,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:18:28,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-10-11 18:18:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:28,659 INFO L225 Difference]: With dead ends: 75 [2024-10-11 18:18:28,659 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 18:18:28,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:18:28,660 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 22 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:28,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 285 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 18:18:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 18:18:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 71 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-10-11 18:18:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-10-11 18:18:28,663 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 30 [2024-10-11 18:18:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:28,663 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-10-11 18:18:28,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-10-11 18:18:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-10-11 18:18:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:18:28,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:28,664 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:18:28,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 18:18:28,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:28,869 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:28,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:28,869 INFO L85 PathProgramCache]: Analyzing trace with hash -493195830, now seen corresponding path program 3 times [2024-10-11 18:18:28,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:28,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984607890] [2024-10-11 18:18:28,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:28,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:18:29,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:29,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984607890] [2024-10-11 18:18:29,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984607890] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:29,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225187204] [2024-10-11 18:18:29,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 18:18:29,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:29,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:29,012 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:29,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:18:29,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 18:18:29,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:18:29,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:18:29,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:18:29,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:18:29,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225187204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:29,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:18:29,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2024-10-11 18:18:29,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984954337] [2024-10-11 18:18:29,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:29,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:18:29,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:29,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:18:29,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:18:29,338 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-10-11 18:18:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:29,393 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-10-11 18:18:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:18:29,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 32 [2024-10-11 18:18:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:29,394 INFO L225 Difference]: With dead ends: 73 [2024-10-11 18:18:29,394 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 18:18:29,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:18:29,395 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 33 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:29,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 99 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 18:18:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2024-10-11 18:18:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 64 states have internal predecessors, (70), 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-10-11 18:18:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-10-11 18:18:29,400 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 32 [2024-10-11 18:18:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:29,400 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-10-11 18:18:29,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-10-11 18:18:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-10-11 18:18:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:18:29,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:29,402 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] [2024-10-11 18:18:29,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 18:18:29,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:29,603 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:29,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:29,603 INFO L85 PathProgramCache]: Analyzing trace with hash -87366165, now seen corresponding path program 1 times [2024-10-11 18:18:29,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:29,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274126235] [2024-10-11 18:18:29,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:29,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:18:29,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:29,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274126235] [2024-10-11 18:18:29,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274126235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:29,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52451482] [2024-10-11 18:18:29,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:29,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:29,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:29,808 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:29,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:18:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:29,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:18:30,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:18:30,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:18:30,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52451482] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:18:30,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:18:30,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2024-10-11 18:18:30,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536957873] [2024-10-11 18:18:30,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:30,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:18:30,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:30,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:18:30,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:18:30,098 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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-10-11 18:18:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:30,260 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-10-11 18:18:30,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:18:30,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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 33 [2024-10-11 18:18:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:30,261 INFO L225 Difference]: With dead ends: 71 [2024-10-11 18:18:30,261 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 18:18:30,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:18:30,262 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 85 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:30,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 330 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 18:18:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-10-11 18:18:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 states have internal predecessors, (69), 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-10-11 18:18:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2024-10-11 18:18:30,265 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 33 [2024-10-11 18:18:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:30,265 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2024-10-11 18:18:30,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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-10-11 18:18:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2024-10-11 18:18:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:18:30,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:30,266 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-10-11 18:18:30,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 18:18:30,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 18:18:30,467 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:30,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash 987158934, now seen corresponding path program 1 times [2024-10-11 18:18:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668762453] [2024-10-11 18:18:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:31,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:31,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:31,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668762453] [2024-10-11 18:18:31,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668762453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:31,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953978238] [2024-10-11 18:18:31,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:31,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:31,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:31,553 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:31,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:18:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:31,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-10-11 18:18:31,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:31,791 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-10-11 18:18:31,931 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:18:31,931 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-10-11 18:18:32,005 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-10-11 18:18:32,074 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:32,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-11 18:18:32,200 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 28 treesize of output 12 [2024-10-11 18:18:32,206 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-10-11 18:18:32,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 18:18:32,396 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-10-11 18:18:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:18:32,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:32,640 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1981 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1981) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2024-10-11 18:18:32,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:32,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-10-11 18:18:32,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:32,836 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 64 treesize of output 63 [2024-10-11 18:18:32,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-11 18:18:33,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:33,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-10-11 18:18:33,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-10-11 18:18:33,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 18:18:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-11 18:18:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953978238] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:18:33,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:18:33,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 21] total 55 [2024-10-11 18:18:33,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15600164] [2024-10-11 18:18:33,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:33,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-11 18:18:33,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:33,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-11 18:18:33,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2662, Unknown=31, NotChecked=104, Total=2970 [2024-10-11 18:18:33,374 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 55 states, 50 states have (on average 1.66) internal successors, (83), 46 states have internal predecessors, (83), 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-10-11 18:18:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:34,309 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-10-11 18:18:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:18:34,309 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 50 states have (on average 1.66) internal successors, (83), 46 states have internal predecessors, (83), 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 35 [2024-10-11 18:18:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:34,310 INFO L225 Difference]: With dead ends: 68 [2024-10-11 18:18:34,310 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 18:18:34,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=316, Invalid=4079, Unknown=31, NotChecked=130, Total=4556 [2024-10-11 18:18:34,312 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:34,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1014 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 739 Invalid, 0 Unknown, 42 Unchecked, 0.5s Time] [2024-10-11 18:18:34,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 18:18:34,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 18:18:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 64 states have internal predecessors, (68), 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-10-11 18:18:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-10-11 18:18:34,315 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 35 [2024-10-11 18:18:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:34,315 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-10-11 18:18:34,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 50 states have (on average 1.66) internal successors, (83), 46 states have internal predecessors, (83), 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-10-11 18:18:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-10-11 18:18:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:18:34,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:34,316 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] [2024-10-11 18:18:34,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 18:18:34,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:34,521 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:34,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash 764464221, now seen corresponding path program 1 times [2024-10-11 18:18:34,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:34,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227455836] [2024-10-11 18:18:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:34,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:34,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 18:18:34,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:34,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227455836] [2024-10-11 18:18:34,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227455836] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:34,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257666216] [2024-10-11 18:18:34,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:34,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:34,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:34,658 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:34,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:18:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:34,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 18:18:34,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 18:18:34,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 18:18:34,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257666216] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:18:34,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:18:34,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2024-10-11 18:18:34,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436354448] [2024-10-11 18:18:34,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:34,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:18:34,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:34,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:18:34,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:18:34,934 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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-10-11 18:18:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:35,055 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2024-10-11 18:18:35,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:18:35,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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 38 [2024-10-11 18:18:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:35,057 INFO L225 Difference]: With dead ends: 65 [2024-10-11 18:18:35,057 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 18:18:35,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:18:35,057 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:35,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 151 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:35,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 18:18:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 18:18:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 61 states have internal predecessors, (64), 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-10-11 18:18:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-10-11 18:18:35,063 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 38 [2024-10-11 18:18:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:35,063 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-10-11 18:18:35,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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-10-11 18:18:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-10-11 18:18:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:18:35,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:35,064 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] [2024-10-11 18:18:35,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 18:18:35,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:35,265 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:35,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash 764464166, now seen corresponding path program 1 times [2024-10-11 18:18:35,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:35,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497266915] [2024-10-11 18:18:35,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:35,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:36,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:18:36,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:36,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497266915] [2024-10-11 18:18:36,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497266915] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:36,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979860837] [2024-10-11 18:18:36,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:36,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:36,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:36,114 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:36,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:18:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:36,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-11 18:18:36,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:36,334 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-10-11 18:18:36,414 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:18:36,414 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-10-11 18:18:36,462 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-10-11 18:18:36,510 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:36,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-11 18:18:36,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:36,561 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 37 treesize of output 17 [2024-10-11 18:18:36,676 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:36,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-11 18:18:36,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:18:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:18:36,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:36,756 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2252 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2252) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-10-11 18:18:36,762 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2252 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2252) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-10-11 18:18:37,006 INFO L349 Elim1Store]: treesize reduction 5, result has 86.8 percent of original size [2024-10-11 18:18:37,006 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 42 treesize of output 41 [2024-10-11 18:18:37,013 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2251 Int) (v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2249))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_2251)) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2252))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-10-11 18:18:37,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:37,031 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 68 treesize of output 52 [2024-10-11 18:18:37,035 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 93 treesize of output 85 [2024-10-11 18:18:37,039 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:18:37,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2024-10-11 18:18:37,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:18:37,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-10-11 18:18:37,060 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-10-11 18:18:37,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979860837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:37,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:18:37,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 29 [2024-10-11 18:18:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463101019] [2024-10-11 18:18:37,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:37,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 18:18:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:37,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 18:18:37,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=959, Unknown=58, NotChecked=198, Total=1332 [2024-10-11 18:18:37,147 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 30 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 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-10-11 18:18:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:37,627 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2024-10-11 18:18:37,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:18:37,628 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 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 38 [2024-10-11 18:18:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:37,629 INFO L225 Difference]: With dead ends: 64 [2024-10-11 18:18:37,629 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 18:18:37,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=1343, Unknown=63, NotChecked=234, Total=1806 [2024-10-11 18:18:37,630 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 23 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:37,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 694 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:18:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 18:18:37,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 18:18:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.3125) internal successors, (63), 60 states have internal predecessors, (63), 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-10-11 18:18:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-10-11 18:18:37,638 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 38 [2024-10-11 18:18:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:37,638 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-10-11 18:18:37,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 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-10-11 18:18:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-10-11 18:18:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:18:37,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:37,639 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] [2024-10-11 18:18:37,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 18:18:37,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 18:18:37,840 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:37,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:37,840 INFO L85 PathProgramCache]: Analyzing trace with hash 764464167, now seen corresponding path program 1 times [2024-10-11 18:18:37,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:37,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135548729] [2024-10-11 18:18:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:37,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:38,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:18:38,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:38,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135548729] [2024-10-11 18:18:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135548729] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:38,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228795077] [2024-10-11 18:18:38,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:38,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:38,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:38,990 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:38,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 18:18:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:39,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-10-11 18:18:39,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:39,217 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-10-11 18:18:39,222 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-10-11 18:18:39,440 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:18:39,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:18:39,450 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-10-11 18:18:39,531 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-10-11 18:18:39,539 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-10-11 18:18:39,604 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:39,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-11 18:18:39,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-11 18:18:39,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:39,704 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-10-11 18:18:39,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:39,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-10-11 18:18:39,867 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:39,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-11 18:18:39,874 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-10-11 18:18:39,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-11 18:18:40,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:18:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:18:40,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:40,917 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2391 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_48| Int) (v_ArrVal_2392 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2391))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_48| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< (+ (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4) 0) (forall ((v_ArrVal_2393 Int) (v_ArrVal_2394 Int) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2397 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2392))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_48| 4)) (.cse3 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ (select (select (store (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse0 .cse2 v_ArrVal_2393)) .cse3 v_ArrVal_2398) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse5 .cse2 v_ArrVal_2394)) .cse3 v_ArrVal_2397) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))))))) (forall ((v_ArrVal_2391 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_48| Int) (v_ArrVal_2392 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2391))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_48| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2393 Int) (v_ArrVal_2398 (Array Int Int))) (<= 0 (+ (select (select (store (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse7 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_48| 4) v_ArrVal_2393)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2392) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2398) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (< (+ (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4) 0)))))) is different from false [2024-10-11 18:18:41,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:41,009 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 287 treesize of output 264 [2024-10-11 18:18:41,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:41,026 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 315 treesize of output 244 [2024-10-11 18:18:41,035 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 235 treesize of output 223 [2024-10-11 18:18:41,045 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 325 treesize of output 313 [2024-10-11 18:18:41,064 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 275 treesize of output 263 [2024-10-11 18:18:41,080 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 253 treesize of output 247 [2024-10-11 18:18:41,090 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 235 treesize of output 231 [2024-10-11 18:18:41,109 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 246 treesize of output 236 [2024-10-11 18:18:41,122 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 192 treesize of output 190 [2024-10-11 18:18:41,130 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 190 treesize of output 188 [2024-10-11 18:18:41,141 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 202 treesize of output 198 [2024-10-11 18:18:41,151 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 179 treesize of output 175 [2024-10-11 18:18:41,161 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 175 treesize of output 173 [2024-10-11 18:18:41,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228795077] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:41,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:18:41,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2024-10-11 18:18:41,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049802710] [2024-10-11 18:18:41,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:41,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 18:18:41,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:41,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 18:18:41,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2177, Unknown=4, NotChecked=94, Total=2450 [2024-10-11 18:18:41,543 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 38 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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-10-11 18:18:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:42,307 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2024-10-11 18:18:42,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:18:42,307 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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 38 [2024-10-11 18:18:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:42,308 INFO L225 Difference]: With dead ends: 63 [2024-10-11 18:18:42,308 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 18:18:42,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=244, Invalid=2726, Unknown=4, NotChecked=106, Total=3080 [2024-10-11 18:18:42,309 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 41 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:42,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 867 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:18:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 18:18:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-10-11 18:18:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.297872340425532) internal successors, (61), 58 states have internal predecessors, (61), 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-10-11 18:18:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2024-10-11 18:18:42,312 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 38 [2024-10-11 18:18:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:42,312 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2024-10-11 18:18:42,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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-10-11 18:18:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2024-10-11 18:18:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:18:42,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:42,313 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 18:18:42,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-11 18:18:42,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 18:18:42,514 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:42,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2073001121, now seen corresponding path program 1 times [2024-10-11 18:18:42,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:42,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868741121] [2024-10-11 18:18:42,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:42,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:42,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:42,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 18:18:42,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:42,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868741121] [2024-10-11 18:18:42,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868741121] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:42,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607069786] [2024-10-11 18:18:42,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:42,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:42,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:42,649 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:42,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 18:18:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:42,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:18:42,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 18:18:42,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 18:18:42,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607069786] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:18:42,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:18:42,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-10-11 18:18:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059985840] [2024-10-11 18:18:42,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:42,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:18:42,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:18:42,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:18:42,952 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-10-11 18:18:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:43,048 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2024-10-11 18:18:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:18:43,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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 39 [2024-10-11 18:18:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:43,049 INFO L225 Difference]: With dead ends: 62 [2024-10-11 18:18:43,049 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 18:18:43,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 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-10-11 18:18:43,051 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:43,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 149 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:43,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 18:18:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 18:18:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 58 states have internal predecessors, (60), 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-10-11 18:18:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2024-10-11 18:18:43,053 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 39 [2024-10-11 18:18:43,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:43,057 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2024-10-11 18:18:43,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-10-11 18:18:43,058 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2024-10-11 18:18:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 18:18:43,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:43,058 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:18:43,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-11 18:18:43,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 18:18:43,259 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:43,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:43,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2056373387, now seen corresponding path program 1 times [2024-10-11 18:18:43,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:43,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009902932] [2024-10-11 18:18:43,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:43,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:44,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:44,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:44,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009902932] [2024-10-11 18:18:44,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009902932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:44,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515475776] [2024-10-11 18:18:44,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:44,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:44,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:44,946 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:44,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 18:18:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:45,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-11 18:18:45,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:45,230 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-10-11 18:18:45,471 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:18:45,471 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-10-11 18:18:45,545 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-10-11 18:18:45,596 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:45,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-11 18:18:45,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:45,690 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 28 treesize of output 12 [2024-10-11 18:18:45,893 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:45,893 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 66 treesize of output 59 [2024-10-11 18:18:45,898 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 25 treesize of output 17 [2024-10-11 18:18:45,902 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-10-11 18:18:46,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-10-11 18:18:46,179 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-10-11 18:18:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:18:46,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:46,510 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-10-11 18:18:46,522 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_2674 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2674) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (forall ((v_ArrVal_2673 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2673) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|))) is different from false [2024-10-11 18:18:46,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:46,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 38 treesize of output 37 [2024-10-11 18:18:46,556 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-10-11 18:18:46,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:46,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-10-11 18:18:46,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-10-11 18:18:46,970 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-10-11 18:18:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-11 18:18:47,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515475776] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:18:47,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:18:47,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 23] total 67 [2024-10-11 18:18:47,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050116632] [2024-10-11 18:18:47,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:47,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-11 18:18:47,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:47,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-11 18:18:47,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=4078, Unknown=13, NotChecked=128, Total=4422 [2024-10-11 18:18:47,411 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 67 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 58 states have internal predecessors, (103), 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-10-11 18:18:49,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:49,100 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2024-10-11 18:18:49,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 18:18:49,101 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 58 states have internal predecessors, (103), 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 41 [2024-10-11 18:18:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:49,101 INFO L225 Difference]: With dead ends: 59 [2024-10-11 18:18:49,101 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 18:18:49,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=390, Invalid=6573, Unknown=13, NotChecked=164, Total=7140 [2024-10-11 18:18:49,103 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 64 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:49,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1172 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1136 Invalid, 0 Unknown, 35 Unchecked, 0.8s Time] [2024-10-11 18:18:49,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 18:18:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-11 18:18:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 55 states have internal predecessors, (57), 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-10-11 18:18:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2024-10-11 18:18:49,106 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 41 [2024-10-11 18:18:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:49,106 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2024-10-11 18:18:49,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 58 states have internal predecessors, (103), 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-10-11 18:18:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2024-10-11 18:18:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:18:49,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:49,107 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:18:49,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-11 18:18:49,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:49,312 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:49,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:49,312 INFO L85 PathProgramCache]: Analyzing trace with hash -491400038, now seen corresponding path program 1 times [2024-10-11 18:18:49,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:49,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826825790] [2024-10-11 18:18:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:49,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 18:18:49,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:49,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826825790] [2024-10-11 18:18:49,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826825790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:49,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:49,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:18:49,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585564384] [2024-10-11 18:18:49,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:49,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:18:49,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:49,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:18:49,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:18:49,492 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-10-11 18:18:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:49,628 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-10-11 18:18:49,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:18:49,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 43 [2024-10-11 18:18:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:49,630 INFO L225 Difference]: With dead ends: 72 [2024-10-11 18:18:49,630 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 18:18:49,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:18:49,630 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:49,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 171 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 18:18:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2024-10-11 18:18:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 58 states have internal predecessors, (63), 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-10-11 18:18:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-10-11 18:18:49,633 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 43 [2024-10-11 18:18:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:49,633 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-10-11 18:18:49,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-10-11 18:18:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-10-11 18:18:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:18:49,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:49,634 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:18:49,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 18:18:49,634 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:49,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash -491400037, now seen corresponding path program 1 times [2024-10-11 18:18:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:49,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697410060] [2024-10-11 18:18:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:49,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:49,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:18:49,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697410060] [2024-10-11 18:18:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697410060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:49,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:49,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:18:49,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070710048] [2024-10-11 18:18:49,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:49,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:18:49,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:49,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:18:49,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:18:49,937 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-10-11 18:18:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:50,051 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-10-11 18:18:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:18:50,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 43 [2024-10-11 18:18:50,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:50,052 INFO L225 Difference]: With dead ends: 60 [2024-10-11 18:18:50,052 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 18:18:50,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:18:50,053 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:50,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 198 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 18:18:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 18:18:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 56 states have internal predecessors, (60), 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-10-11 18:18:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-10-11 18:18:50,056 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 43 [2024-10-11 18:18:50,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:50,057 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-10-11 18:18:50,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-10-11 18:18:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-10-11 18:18:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 18:18:50,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:50,058 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 18:18:50,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 18:18:50,058 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:50,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:50,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1946501890, now seen corresponding path program 1 times [2024-10-11 18:18:50,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:50,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623381484] [2024-10-11 18:18:50,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:50,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:50,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:50,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:18:50,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623381484] [2024-10-11 18:18:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623381484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:18:50,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:18:50,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:18:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376446661] [2024-10-11 18:18:50,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:18:50,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:18:50,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:50,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:18:50,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:18:50,252 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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-10-11 18:18:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:50,387 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-10-11 18:18:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:18:50,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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 44 [2024-10-11 18:18:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:50,389 INFO L225 Difference]: With dead ends: 60 [2024-10-11 18:18:50,389 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 18:18:50,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:18:50,390 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:50,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 198 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:18:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 18:18:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 18:18:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 56 states have internal predecessors, (59), 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-10-11 18:18:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2024-10-11 18:18:50,393 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 44 [2024-10-11 18:18:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:50,393 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2024-10-11 18:18:50,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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-10-11 18:18:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2024-10-11 18:18:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 18:18:50,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:50,394 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 18:18:50,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 18:18:50,394 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:50,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:50,394 INFO L85 PathProgramCache]: Analyzing trace with hash 211038115, now seen corresponding path program 1 times [2024-10-11 18:18:50,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:50,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882784952] [2024-10-11 18:18:50,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:50,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:50,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 18:18:50,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:50,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882784952] [2024-10-11 18:18:50,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882784952] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:50,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196246754] [2024-10-11 18:18:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:50,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:50,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:50,580 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:50,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 18:18:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:50,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-11 18:18:50,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:50,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-10-11 18:18:50,985 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:18:50,986 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-10-11 18:18:51,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:18:51,075 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:51,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-11 18:18:51,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:51,142 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 28 treesize of output 12 [2024-10-11 18:18:51,209 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:51,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-11 18:18:51,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:18:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 18:18:51,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:51,331 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-10-11 18:18:51,331 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-10-11 18:18:51,404 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3053) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) is different from false [2024-10-11 18:18:51,508 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3050 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3050) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-10-11 18:18:51,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:51,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-10-11 18:18:51,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-10-11 18:18:51,527 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-10-11 18:18:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 1 times theorem prover too weak. 8 trivial. 3 not checked. [2024-10-11 18:18:51,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196246754] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:18:51,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:18:51,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18, 19] total 35 [2024-10-11 18:18:51,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376215031] [2024-10-11 18:18:51,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:51,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 18:18:51,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:51,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 18:18:51,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1013, Unknown=26, NotChecked=130, Total=1260 [2024-10-11 18:18:51,776 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 36 states, 32 states have (on average 2.9375) internal successors, (94), 29 states have internal predecessors, (94), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 18:18:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:52,501 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2024-10-11 18:18:52,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:18:52,502 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 2.9375) internal successors, (94), 29 states have internal predecessors, (94), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2024-10-11 18:18:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:52,503 INFO L225 Difference]: With dead ends: 66 [2024-10-11 18:18:52,503 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 18:18:52,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=1723, Unknown=26, NotChecked=170, Total=2070 [2024-10-11 18:18:52,504 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:52,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 477 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 741 Invalid, 0 Unknown, 94 Unchecked, 0.5s Time] [2024-10-11 18:18:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 18:18:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2024-10-11 18:18:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.2) internal successors, (60), 56 states have internal predecessors, (60), 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-10-11 18:18:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-10-11 18:18:52,507 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 45 [2024-10-11 18:18:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:52,507 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-10-11 18:18:52,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 2.9375) internal successors, (94), 29 states have internal predecessors, (94), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 18:18:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-10-11 18:18:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 18:18:52,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:52,508 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 18:18:52,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-11 18:18:52,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-11 18:18:52,713 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:18:52,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash 211038116, now seen corresponding path program 1 times [2024-10-11 18:18:52,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:52,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531709878] [2024-10-11 18:18:52,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:52,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:53,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:18:53,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:53,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531709878] [2024-10-11 18:18:53,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531709878] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:53,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614839903] [2024-10-11 18:18:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:53,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:53,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:53,785 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:53,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-11 18:18:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:54,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-10-11 18:18:54,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:54,071 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-10-11 18:18:54,183 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:18:54,183 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-10-11 18:18:54,281 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-10-11 18:18:54,287 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-10-11 18:18:54,356 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:54,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-11 18:18:54,363 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-10-11 18:18:54,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:54,488 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 37 treesize of output 17 [2024-10-11 18:18:54,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:54,493 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-10-11 18:18:54,646 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:18:54,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-11 18:18:54,652 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-10-11 18:18: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 25 treesize of output 13 [2024-10-11 18:18:54,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:18:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 18:18:54,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:02,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:02,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 287 [2024-10-11 18:19:11,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:19:11,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:11,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 139 [2024-10-11 18:19:11,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:19:11,392 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 71 treesize of output 67 [2024-10-11 18:19:11,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:11,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 138 [2024-10-11 18:19:11,412 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 194 treesize of output 166 [2024-10-11 18:19:11,423 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-10-11 18:19:11,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-10-11 18:19:11,438 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 14 treesize of output 10 [2024-10-11 18:19:11,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:19:11,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:19:11,455 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:11,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2024-10-11 18:19:11,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,477 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 41 treesize of output 37 [2024-10-11 18:19:11,482 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:11,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 114 [2024-10-11 18:19:11,495 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,499 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 90 treesize of output 72 [2024-10-11 18:19:11,506 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,511 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 19 treesize of output 15 [2024-10-11 18:19:11,519 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 71 treesize of output 55 [2024-10-11 18:19:11,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:19:11,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:19:11,552 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,559 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 1 [2024-10-11 18:19:11,565 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,573 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 1 [2024-10-11 18:19:11,578 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:11,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2024-10-11 18:19:11,592 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,596 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 41 treesize of output 37 [2024-10-11 18:19:11,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:11,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 47 [2024-10-11 18:19:11,613 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,617 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 41 treesize of output 29 [2024-10-11 18:19:11,622 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,625 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 17 treesize of output 13 [2024-10-11 18:19:11,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,650 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2024-10-11 18:19:11,656 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,658 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,666 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 1 [2024-10-11 18:19:11,671 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,674 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:11,679 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,680 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,683 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:11,689 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,691 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,702 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2024-10-11 18:19:11,708 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,709 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,719 INFO L349 Elim1Store]: treesize reduction 8, result has 11.1 percent of original size [2024-10-11 18:19:11,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 1 [2024-10-11 18:19:11,727 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,729 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,740 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2024-10-11 18:19:11,747 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,748 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,756 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 1 [2024-10-11 18:19:11,761 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,763 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,765 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:11,771 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,773 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,777 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:11,781 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,790 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 1 [2024-10-11 18:19:11,799 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,802 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,812 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2024-10-11 18:19:11,817 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,818 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,820 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:11,825 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,826 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,828 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:11,832 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,833 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,836 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:11,841 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,851 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 1 [2024-10-11 18:19:11,856 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,858 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,861 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:11,867 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,878 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2024-10-11 18:19:11,883 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,884 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,887 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:11,892 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,921 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 1 [2024-10-11 18:19:11,927 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,929 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,934 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:11,940 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,942 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,954 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 1 [2024-10-11 18:19:11,960 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,960 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,965 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,968 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:11,974 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,975 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,987 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:11,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2024-10-11 18:19:11,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:11,996 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:12,000 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:12,006 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:12,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:12,017 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:12,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2024-10-11 18:19:12,024 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:12,026 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:12,035 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:12,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2024-10-11 18:19:12,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:12,041 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:12,044 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:12,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:12,052 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:12,057 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:19:12,062 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:12,064 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:12,076 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:12,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2024-10-11 18:19:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614839903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:16,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:19:16,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 35 [2024-10-11 18:19:16,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181209785] [2024-10-11 18:19:16,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:16,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 18:19:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:16,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 18:19:16,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2070, Unknown=4, NotChecked=0, Total=2256 [2024-10-11 18:19:16,585 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 36 states, 33 states have (on average 2.212121212121212) internal successors, (73), 31 states have internal predecessors, (73), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:19:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:17,254 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2024-10-11 18:19:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:19:17,255 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.212121212121212) internal successors, (73), 31 states have internal predecessors, (73), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2024-10-11 18:19:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:17,255 INFO L225 Difference]: With dead ends: 61 [2024-10-11 18:19:17,255 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 18:19:17,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=223, Invalid=2529, Unknown=4, NotChecked=0, Total=2756 [2024-10-11 18:19:17,257 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:17,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 443 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:19:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 18:19:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 18:19:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 57 states have internal predecessors, (60), 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-10-11 18:19:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2024-10-11 18:19:17,260 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 45 [2024-10-11 18:19:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:17,260 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2024-10-11 18:19:17,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.212121212121212) internal successors, (73), 31 states have internal predecessors, (73), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:19:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2024-10-11 18:19:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 18:19:17,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:17,261 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:19:17,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-11 18:19:17,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:17,464 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:19:17,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:17,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2047754410, now seen corresponding path program 1 times [2024-10-11 18:19:17,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:17,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477796011] [2024-10-11 18:19:17,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:17,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:19:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:17,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:19:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:19:17,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:17,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477796011] [2024-10-11 18:19:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477796011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:17,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:19:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453622295] [2024-10-11 18:19:17,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:17,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:19:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:17,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:19:17,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:19:17,691 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 10 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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-10-11 18:19:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:17,858 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2024-10-11 18:19:17,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:19:17,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 46 [2024-10-11 18:19:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:17,859 INFO L225 Difference]: With dead ends: 60 [2024-10-11 18:19:17,859 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 18:19:17,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:19:17,860 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:17,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 162 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:19:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 18:19:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 18:19:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 56 states have internal predecessors, (58), 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-10-11 18:19:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2024-10-11 18:19:17,862 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 46 [2024-10-11 18:19:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:17,862 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2024-10-11 18:19:17,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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-10-11 18:19:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2024-10-11 18:19:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 18:19:17,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:17,863 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:19:17,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 18:19:17,863 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:19:17,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:17,863 INFO L85 PathProgramCache]: Analyzing trace with hash 944230179, now seen corresponding path program 1 times [2024-10-11 18:19:17,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:17,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090244542] [2024-10-11 18:19:17,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:17,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:18,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:19:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:18,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:19:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:19:18,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:18,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090244542] [2024-10-11 18:19:18,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090244542] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:18,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113814428] [2024-10-11 18:19:18,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:18,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:18,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:18,825 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:18,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-11 18:19:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:19,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-11 18:19:19,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:19,093 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-10-11 18:19:19,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:19:19,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:19:19,234 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-10-11 18:19:19,311 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-10-11 18:19:19,368 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:19:19,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-11 18:19:19,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:19:19,470 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 37 treesize of output 17 [2024-10-11 18:19:19,611 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:19:19,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-11 18:19:19,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:19:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 18:19:19,791 INFO L311 TraceCheckSpWp]: Computing backward predicates...