./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:03:12,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:03:12,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 07:03:12,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:03:12,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:03:12,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:03:12,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:03:12,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:03:12,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:03:12,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:03:12,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:03:12,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:03:12,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:03:12,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:03:12,468 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:03:12,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:03:12,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:03:12,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:03:12,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:03:12,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:03:12,470 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:03:12,472 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:03:12,472 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:03:12,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:03:12,473 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:03:12,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:03:12,474 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:03:12,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:03:12,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:03:12,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:03:12,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:03:12,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:03:12,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:03:12,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:03:12,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:03:12,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:03:12,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:03:12,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:03:12,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:03:12,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:03:12,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:03:12,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:03:12,478 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2024-11-19 07:03:12,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:03:12,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:03:12,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:03:12,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:03:12,699 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:03:12,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all.i [2024-11-19 07:03:13,945 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:03:14,140 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:03:14,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i [2024-11-19 07:03:14,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c2444272/e3edbcea4f374fc8823583043dab5bb4/FLAG1cfa99afd [2024-11-19 07:03:14,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c2444272/e3edbcea4f374fc8823583043dab5bb4 [2024-11-19 07:03:14,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:03:14,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:03:14,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:03:14,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:03:14,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:03:14,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a6170b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14, skipping insertion in model container [2024-11-19 07:03:14,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:03:14,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:03:14,453 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:03:14,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:03:14,512 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:03:14,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14 WrapperNode [2024-11-19 07:03:14,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:03:14,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:03:14,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:03:14,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:03:14,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,546 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 127 [2024-11-19 07:03:14,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:03:14,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:03:14,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:03:14,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:03:14,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,571 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-19 07:03:14,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:03:14,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:03:14,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:03:14,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:03:14,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (1/1) ... [2024-11-19 07:03:14,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:03:14,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:14,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 07:03:14,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 07:03:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 07:03:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 07:03:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 07:03:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 07:03:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 07:03:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 07:03:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 07:03:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 07:03:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 07:03:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 07:03:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 07:03:14,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 07:03:14,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 07:03:14,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:03:14,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:03:14,771 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:03:14,773 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:03:14,964 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-11-19 07:03:14,964 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:03:14,973 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:03:14,973 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 07:03:14,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:03:14 BoogieIcfgContainer [2024-11-19 07:03:14,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:03:14,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:03:14,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:03:14,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:03:14,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:03:14" (1/3) ... [2024-11-19 07:03:14,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26325d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:03:14, skipping insertion in model container [2024-11-19 07:03:14,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:14" (2/3) ... [2024-11-19 07:03:14,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26325d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:03:14, skipping insertion in model container [2024-11-19 07:03:14,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:03:14" (3/3) ... [2024-11-19 07:03:14,982 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2024-11-19 07:03:14,994 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:03:14,994 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-19 07:03:15,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:03:15,032 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;@5074e196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:03:15,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-19 07:03:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 07:03:15,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:15,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 07:03:15,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:15,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:15,044 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2024-11-19 07:03:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:15,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153450093] [2024-11-19 07:03:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:15,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:15,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:15,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153450093] [2024-11-19 07:03:15,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153450093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:15,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:15,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:03:15,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817380637] [2024-11-19 07:03:15,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:15,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:15,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:15,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:15,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:15,306 INFO L87 Difference]: Start difference. First operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:15,366 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-19 07:03:15,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:15,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 07:03:15,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:15,377 INFO L225 Difference]: With dead ends: 64 [2024-11-19 07:03:15,378 INFO L226 Difference]: Without dead ends: 61 [2024-11-19 07:03:15,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:15,382 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:15,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-19 07:03:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-19 07:03:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-19 07:03:15,412 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 5 [2024-11-19 07:03:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:15,412 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-19 07:03:15,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-19 07:03:15,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 07:03:15,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:15,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 07:03:15,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:03:15,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:15,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:15,415 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2024-11-19 07:03:15,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:15,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794837579] [2024-11-19 07:03:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:15,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:15,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:15,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794837579] [2024-11-19 07:03:15,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794837579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:15,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:15,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:03:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167166] [2024-11-19 07:03:15,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:15,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:15,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:15,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:15,525 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:15,559 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-19 07:03:15,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:15,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 07:03:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:15,561 INFO L225 Difference]: With dead ends: 59 [2024-11-19 07:03:15,561 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 07:03:15,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:15,562 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:15,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 07:03:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-19 07:03:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-19 07:03:15,570 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2024-11-19 07:03:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:15,571 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-19 07:03:15,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-19 07:03:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 07:03:15,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:15,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:15,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:03:15,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:15,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:15,572 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2024-11-19 07:03:15,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:15,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204659603] [2024-11-19 07:03:15,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:15,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:15,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:15,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204659603] [2024-11-19 07:03:15,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204659603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:15,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:15,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:03:15,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366300029] [2024-11-19 07:03:15,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:15,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:15,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:15,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:15,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:15,632 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:15,643 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-19 07:03:15,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:15,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 07:03:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:15,644 INFO L225 Difference]: With dead ends: 70 [2024-11-19 07:03:15,645 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 07:03:15,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:15,646 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:15,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 07:03:15,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-11-19 07:03:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-11-19 07:03:15,653 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 8 [2024-11-19 07:03:15,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:15,653 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-19 07:03:15,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-11-19 07:03:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 07:03:15,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:15,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:15,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:03:15,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:15,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2024-11-19 07:03:15,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:15,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597132976] [2024-11-19 07:03:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:15,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:15,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:15,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597132976] [2024-11-19 07:03:15,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597132976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:15,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:15,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:03:15,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039518993] [2024-11-19 07:03:15,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:15,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:03:15,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:15,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:03:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:15,758 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:15,807 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-19 07:03:15,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:03:15,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 07:03:15,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:15,808 INFO L225 Difference]: With dead ends: 59 [2024-11-19 07:03:15,808 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 07:03:15,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:15,809 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:15,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 07:03:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-19 07:03:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-19 07:03:15,813 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 9 [2024-11-19 07:03:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:15,813 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-19 07:03:15,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-19 07:03:15,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 07:03:15,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:15,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:15,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 07:03:15,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:15,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:15,815 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2024-11-19 07:03:15,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:15,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440409735] [2024-11-19 07:03:15,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:15,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:15,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:15,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:15,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440409735] [2024-11-19 07:03:15,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440409735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:15,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:15,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:03:15,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92840877] [2024-11-19 07:03:15,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:15,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:03:15,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:15,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:03:15,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:15,931 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:15,985 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-19 07:03:15,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:03:15,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 07:03:15,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:15,987 INFO L225 Difference]: With dead ends: 58 [2024-11-19 07:03:15,987 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 07:03:15,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:15,989 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:15,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 07:03:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-19 07:03:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-11-19 07:03:15,997 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 9 [2024-11-19 07:03:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:15,997 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-11-19 07:03:15,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-11-19 07:03:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 07:03:15,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:15,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:15,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 07:03:15,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:15,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:15,999 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2024-11-19 07:03:15,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:15,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963278728] [2024-11-19 07:03:15,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:16,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:16,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:16,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963278728] [2024-11-19 07:03:16,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963278728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:16,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325076948] [2024-11-19 07:03:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:16,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:16,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:16,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:16,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 07:03:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:16,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:03:16,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:16,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:16,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325076948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:16,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:16,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-19 07:03:16,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388535799] [2024-11-19 07:03:16,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:16,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:03:16,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:16,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:03:16,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:16,287 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:16,302 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-19 07:03:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:03:16,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 07:03:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:16,303 INFO L225 Difference]: With dead ends: 67 [2024-11-19 07:03:16,303 INFO L226 Difference]: Without dead ends: 67 [2024-11-19 07:03:16,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:16,304 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:16,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-19 07:03:16,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-19 07:03:16,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-19 07:03:16,312 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 17 [2024-11-19 07:03:16,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:16,312 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-19 07:03:16,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-19 07:03:16,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 07:03:16,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:16,313 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:16,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 07:03:16,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 07:03:16,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:16,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2024-11-19 07:03:16,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:16,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074321186] [2024-11-19 07:03:16,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:03:16,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:16,549 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:03:16,549 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:03:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:03:16,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:16,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074321186] [2024-11-19 07:03:16,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074321186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:16,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:16,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 07:03:16,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478071585] [2024-11-19 07:03:16,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:16,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 07:03:16,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:16,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 07:03:16,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:03:16,668 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:16,817 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-11-19 07:03:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 07:03:16,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-19 07:03:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:16,818 INFO L225 Difference]: With dead ends: 70 [2024-11-19 07:03:16,818 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 07:03:16,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 07:03:16,819 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:16,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 239 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 07:03:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-19 07:03:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-11-19 07:03:16,827 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 26 [2024-11-19 07:03:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:16,828 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-19 07:03:16,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-11-19 07:03:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 07:03:16,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:16,829 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:16,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 07:03:16,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:16,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2024-11-19 07:03:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:16,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265185526] [2024-11-19 07:03:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:16,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:03:17,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:17,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265185526] [2024-11-19 07:03:17,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265185526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:17,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:17,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 07:03:17,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206071707] [2024-11-19 07:03:17,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:17,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 07:03:17,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:17,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 07:03:17,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:03:17,046 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:17,207 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-11-19 07:03:17,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 07:03:17,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-19 07:03:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:17,208 INFO L225 Difference]: With dead ends: 70 [2024-11-19 07:03:17,209 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 07:03:17,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 07:03:17,210 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:17,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 275 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 07:03:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-19 07:03:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-11-19 07:03:17,217 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 26 [2024-11-19 07:03:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:17,217 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-11-19 07:03:17,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-11-19 07:03:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:03:17,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:17,217 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:17,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 07:03:17,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:17,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:17,218 INFO L85 PathProgramCache]: Analyzing trace with hash -893075880, now seen corresponding path program 1 times [2024-11-19 07:03:17,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:17,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751128630] [2024-11-19 07:03:17,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:17,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:03:17,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:17,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751128630] [2024-11-19 07:03:17,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751128630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:17,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:03:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998982694] [2024-11-19 07:03:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:17,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:03:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:03:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:03:17,299 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:17,312 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-11-19 07:03:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:03:17,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 07:03:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:17,313 INFO L225 Difference]: With dead ends: 101 [2024-11-19 07:03:17,313 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 07:03:17,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:03:17,314 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 90 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:17,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 109 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 07:03:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 72. [2024-11-19 07:03:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.368421052631579) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-19 07:03:17,320 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 28 [2024-11-19 07:03:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:17,320 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-19 07:03:17,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-19 07:03:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:03:17,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:17,321 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] [2024-11-19 07:03:17,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 07:03:17,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:17,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2024-11-19 07:03:17,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:17,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272074831] [2024-11-19 07:03:17,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:03:17,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272074831] [2024-11-19 07:03:17,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272074831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:17,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:17,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:03:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829007420] [2024-11-19 07:03:17,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:17,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:03:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:17,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:03:17,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:03:17,403 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:17,422 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2024-11-19 07:03:17,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:03:17,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-19 07:03:17,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:17,423 INFO L225 Difference]: With dead ends: 92 [2024-11-19 07:03:17,423 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 07:03:17,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:17,424 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:17,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 164 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 07:03:17,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2024-11-19 07:03:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-11-19 07:03:17,427 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 29 [2024-11-19 07:03:17,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:17,428 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-11-19 07:03:17,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-11-19 07:03:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:03:17,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:17,428 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] [2024-11-19 07:03:17,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 07:03:17,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:17,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:17,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1668563828, now seen corresponding path program 1 times [2024-11-19 07:03:17,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:17,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248748725] [2024-11-19 07:03:17,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:17,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 07:03:17,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:17,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248748725] [2024-11-19 07:03:17,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248748725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:17,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:17,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 07:03:17,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121519858] [2024-11-19 07:03:17,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:17,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 07:03:17,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:17,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 07:03:17,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:03:17,576 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:17,719 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2024-11-19 07:03:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 07:03:17,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 07:03:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:17,720 INFO L225 Difference]: With dead ends: 76 [2024-11-19 07:03:17,720 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 07:03:17,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 07:03:17,720 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:17,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 239 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:17,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 07:03:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-19 07:03:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-11-19 07:03:17,727 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 33 [2024-11-19 07:03:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:17,728 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-11-19 07:03:17,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-19 07:03:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:03:17,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:17,728 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] [2024-11-19 07:03:17,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 07:03:17,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:17,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1668563827, now seen corresponding path program 1 times [2024-11-19 07:03:17,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:17,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515731203] [2024-11-19 07:03:17,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:03:17,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:17,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515731203] [2024-11-19 07:03:17,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515731203] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:17,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888354618] [2024-11-19 07:03:17,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:17,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:17,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:17,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:17,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 07:03:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:17,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 07:03:17,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:03:17,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:03:18,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888354618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:18,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:18,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 07:03:18,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999305265] [2024-11-19 07:03:18,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:18,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:03:18,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:18,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:03:18,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:18,018 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:18,046 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2024-11-19 07:03:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:03:18,046 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 07:03:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:18,046 INFO L225 Difference]: With dead ends: 100 [2024-11-19 07:03:18,046 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 07:03:18,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:18,047 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 128 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:18,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 226 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 07:03:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2024-11-19 07:03:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 91 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2024-11-19 07:03:18,055 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 33 [2024-11-19 07:03:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:18,055 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2024-11-19 07:03:18,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2024-11-19 07:03:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:03:18,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:18,056 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] [2024-11-19 07:03:18,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 07:03:18,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 07:03:18,257 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:18,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:18,257 INFO L85 PathProgramCache]: Analyzing trace with hash -146010198, now seen corresponding path program 1 times [2024-11-19 07:03:18,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:18,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050191156] [2024-11-19 07:03:18,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:18,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:03:18,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050191156] [2024-11-19 07:03:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050191156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417642777] [2024-11-19 07:03:18,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:18,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:18,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:18,827 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:18,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 07:03:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:18,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-19 07:03:18,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:18,977 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 07:03:18,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 07:03:19,045 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 19 treesize of output 1 [2024-11-19 07:03:19,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:19,204 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 19 [2024-11-19 07:03:19,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 07:03:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:19,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417642777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:19,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:19,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 35 [2024-11-19 07:03:19,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839797002] [2024-11-19 07:03:19,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:19,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-19 07:03:19,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:19,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-19 07:03:19,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 07:03:19,572 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:20,240 INFO L93 Difference]: Finished difference Result 147 states and 185 transitions. [2024-11-19 07:03:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 07:03:20,242 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-19 07:03:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:20,244 INFO L225 Difference]: With dead ends: 147 [2024-11-19 07:03:20,244 INFO L226 Difference]: Without dead ends: 147 [2024-11-19 07:03:20,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=1917, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 07:03:20,245 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 124 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:20,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 781 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 07:03:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-19 07:03:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 102. [2024-11-19 07:03:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 101 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-11-19 07:03:20,248 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 34 [2024-11-19 07:03:20,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:20,249 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-11-19 07:03:20,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-11-19 07:03:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:03:20,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:20,250 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] [2024-11-19 07:03:20,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 07:03:20,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:20,454 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:20,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:20,454 INFO L85 PathProgramCache]: Analyzing trace with hash -146010197, now seen corresponding path program 1 times [2024-11-19 07:03:20,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:20,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281511420] [2024-11-19 07:03:20,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:20,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:03:21,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:21,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281511420] [2024-11-19 07:03:21,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281511420] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:21,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275295034] [2024-11-19 07:03:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:21,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:21,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:21,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:21,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 07:03:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:21,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-19 07:03:21,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:21,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 07:03:21,341 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:21,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:03:21,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 07:03:21,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 07:03:21,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 07:03:21,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:21,628 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 25 treesize of output 13 [2024-11-19 07:03:21,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:21,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-19 07:03:21,698 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 31 treesize of output 13 [2024-11-19 07:03:21,702 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 9 treesize of output 3 [2024-11-19 07:03:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:03:21,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:21,904 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_565 (Array Int Int))) (or (not (= v_ArrVal_565 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_565 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_563 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_565) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_563)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) (forall ((v_ArrVal_565 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_565) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)) (not (= v_ArrVal_565 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_565 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2024-11-19 07:03:22,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:22,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2024-11-19 07:03:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-19 07:03:22,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275295034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:22,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:22,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 42 [2024-11-19 07:03:22,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103109463] [2024-11-19 07:03:22,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:22,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-19 07:03:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:22,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-19 07:03:22,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1608, Unknown=1, NotChecked=80, Total=1806 [2024-11-19 07:03:22,489 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 43 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 43 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:23,494 INFO L93 Difference]: Finished difference Result 161 states and 202 transitions. [2024-11-19 07:03:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 07:03:23,495 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 43 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-19 07:03:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:23,497 INFO L225 Difference]: With dead ends: 161 [2024-11-19 07:03:23,497 INFO L226 Difference]: Without dead ends: 161 [2024-11-19 07:03:23,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=248, Invalid=2725, Unknown=1, NotChecked=106, Total=3080 [2024-11-19 07:03:23,498 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 86 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:23,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1251 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1362 Invalid, 0 Unknown, 90 Unchecked, 0.6s Time] [2024-11-19 07:03:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-19 07:03:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2024-11-19 07:03:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 95 states have (on average 1.431578947368421) internal successors, (136), 109 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2024-11-19 07:03:23,502 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 34 [2024-11-19 07:03:23,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:23,502 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-11-19 07:03:23,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 43 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2024-11-19 07:03:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 07:03:23,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:23,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:23,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 07:03:23,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:23,706 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:23,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:23,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1013729350, now seen corresponding path program 2 times [2024-11-19 07:03:23,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:23,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67285560] [2024-11-19 07:03:23,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:03:23,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:23,720 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:03:23,721 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:03:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:03:23,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67285560] [2024-11-19 07:03:23,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67285560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168683329] [2024-11-19 07:03:23,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:03:23,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:23,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:23,771 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:23,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 07:03:23,871 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:03:23,872 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:03:23,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 07:03:23,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:03:23,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:03:23,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168683329] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:23,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:23,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-19 07:03:23,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40616898] [2024-11-19 07:03:23,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:23,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:23,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:23,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:23,947 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:23,965 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2024-11-19 07:03:23,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:03:23,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-19 07:03:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:23,966 INFO L225 Difference]: With dead ends: 96 [2024-11-19 07:03:23,966 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 07:03:23,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-19 07:03:23,966 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 24 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:23,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 185 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 07:03:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 07:03:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.369047619047619) internal successors, (115), 95 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2024-11-19 07:03:23,971 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 37 [2024-11-19 07:03:23,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:23,971 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2024-11-19 07:03:23,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2024-11-19 07:03:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 07:03:23,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:23,972 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:23,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 07:03:24,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 07:03:24,173 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:24,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1104183591, now seen corresponding path program 2 times [2024-11-19 07:03:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:24,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66831520] [2024-11-19 07:03:24,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:03:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:24,191 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:03:24,191 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:03:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:03:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66831520] [2024-11-19 07:03:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66831520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:24,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:24,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 07:03:24,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961450761] [2024-11-19 07:03:24,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:24,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 07:03:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:24,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 07:03:24,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:03:24,401 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:24,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:24,534 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2024-11-19 07:03:24,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 07:03:24,535 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-19 07:03:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:24,535 INFO L225 Difference]: With dead ends: 96 [2024-11-19 07:03:24,535 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 07:03:24,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 07:03:24,536 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 33 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:24,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 268 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 07:03:24,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 07:03:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 95 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-11-19 07:03:24,539 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 38 [2024-11-19 07:03:24,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:24,539 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-11-19 07:03:24,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-11-19 07:03:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 07:03:24,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:24,541 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:24,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 07:03:24,541 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:24,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:24,542 INFO L85 PathProgramCache]: Analyzing trace with hash 422832667, now seen corresponding path program 1 times [2024-11-19 07:03:24,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:24,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924013035] [2024-11-19 07:03:24,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:24,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 07:03:24,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:24,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924013035] [2024-11-19 07:03:24,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924013035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:24,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:24,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:03:24,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407525563] [2024-11-19 07:03:24,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:24,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:03:24,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:24,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:03:24,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:03:24,604 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:24,621 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-11-19 07:03:24,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:03:24,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-19 07:03:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:24,622 INFO L225 Difference]: With dead ends: 95 [2024-11-19 07:03:24,622 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 07:03:24,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:24,623 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 14 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:24,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 155 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 07:03:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2024-11-19 07:03:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 90 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-11-19 07:03:24,625 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 41 [2024-11-19 07:03:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:24,625 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-11-19 07:03:24,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-11-19 07:03:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 07:03:24,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:24,627 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:24,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 07:03:24,627 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1835573310, now seen corresponding path program 3 times [2024-11-19 07:03:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775758856] [2024-11-19 07:03:24,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 07:03:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:24,645 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 07:03:24,645 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:03:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 07:03:24,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:24,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775758856] [2024-11-19 07:03:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775758856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:24,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568492779] [2024-11-19 07:03:24,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 07:03:24,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:24,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:24,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:24,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 07:03:24,829 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 07:03:24,829 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:03:24,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:03:24,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 07:03:24,884 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:03:24,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568492779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:24,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:03:24,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-19 07:03:24,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122161336] [2024-11-19 07:03:24,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:24,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:24,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:24,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:24,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:24,885 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:24,900 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2024-11-19 07:03:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:03:24,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-19 07:03:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:24,901 INFO L225 Difference]: With dead ends: 89 [2024-11-19 07:03:24,901 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 07:03:24,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:24,902 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 54 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:24,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 148 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 07:03:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2024-11-19 07:03:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-11-19 07:03:24,903 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 42 [2024-11-19 07:03:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:24,903 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-11-19 07:03:24,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-11-19 07:03:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 07:03:24,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:24,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:24,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 07:03:25,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 07:03:25,108 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:25,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:25,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1884555173, now seen corresponding path program 1 times [2024-11-19 07:03:25,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:25,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381873495] [2024-11-19 07:03:25,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:25,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:03:25,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381873495] [2024-11-19 07:03:25,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381873495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779918041] [2024-11-19 07:03:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:25,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:25,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:25,185 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:25,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 07:03:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:25,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:03:25,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:03:25,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:03:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779918041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:25,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:25,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-19 07:03:25,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550257570] [2024-11-19 07:03:25,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:25,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:03:25,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:25,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:03:25,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:03:25,355 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:25,376 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2024-11-19 07:03:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:03:25,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-19 07:03:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:25,377 INFO L225 Difference]: With dead ends: 85 [2024-11-19 07:03:25,377 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 07:03:25,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:03:25,378 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 35 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:25,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 232 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 07:03:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-19 07:03:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 80 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-19 07:03:25,379 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 44 [2024-11-19 07:03:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:25,379 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-19 07:03:25,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-19 07:03:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 07:03:25,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:25,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:25,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 07:03:25,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:25,580 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:25,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1354555913, now seen corresponding path program 1 times [2024-11-19 07:03:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:25,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582541563] [2024-11-19 07:03:25,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:25,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:26,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:26,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582541563] [2024-11-19 07:03:26,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582541563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:26,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105598889] [2024-11-19 07:03:26,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:26,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:26,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:26,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:26,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 07:03:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:26,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-19 07:03:26,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:26,497 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:26,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:03:26,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 07:03:26,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:03:26,767 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 26 treesize of output 14 [2024-11-19 07:03:26,868 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 20 treesize of output 8 [2024-11-19 07:03:26,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:03:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:27,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:27,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1078 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1078) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-19 07:03:27,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:27,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2024-11-19 07:03:27,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:27,313 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 58 treesize of output 61 [2024-11-19 07:03:27,317 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 23 treesize of output 21 [2024-11-19 07:03:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-19 07:03:27,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105598889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:27,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:27,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 22] total 62 [2024-11-19 07:03:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194996943] [2024-11-19 07:03:27,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:27,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-19 07:03:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:27,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-19 07:03:27,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3407, Unknown=53, NotChecked=118, Total=3782 [2024-11-19 07:03:27,588 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 62 states, 62 states have (on average 2.0) internal successors, (124), 62 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:28,630 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-19 07:03:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 07:03:28,630 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0) internal successors, (124), 62 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-19 07:03:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:28,631 INFO L225 Difference]: With dead ends: 87 [2024-11-19 07:03:28,631 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 07:03:28,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=478, Invalid=6279, Unknown=53, NotChecked=162, Total=6972 [2024-11-19 07:03:28,633 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 106 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:28,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1255 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1495 Invalid, 0 Unknown, 70 Unchecked, 0.5s Time] [2024-11-19 07:03:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 07:03:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2024-11-19 07:03:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-19 07:03:28,634 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 47 [2024-11-19 07:03:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:28,634 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-19 07:03:28,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.0) internal successors, (124), 62 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-19 07:03:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 07:03:28,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:28,635 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:28,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 07:03:28,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:28,840 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:28,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429550, now seen corresponding path program 1 times [2024-11-19 07:03:28,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:28,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528643570] [2024-11-19 07:03:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:28,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:29,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:29,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528643570] [2024-11-19 07:03:29,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528643570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:29,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729927853] [2024-11-19 07:03:29,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:29,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:29,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:29,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:29,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 07:03:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:30,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-19 07:03:30,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:30,075 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:30,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:03:30,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 07:03:30,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:30,249 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 26 treesize of output 14 [2024-11-19 07:03:30,359 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 07:03:30,359 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 42 treesize of output 41 [2024-11-19 07:03:30,460 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 31 treesize of output 13 [2024-11-19 07:03:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 07:03:30,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:30,541 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-19 07:03:30,541 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 21 treesize of output 20 [2024-11-19 07:03:30,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1186 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) is different from false [2024-11-19 07:03:30,548 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1186 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2024-11-19 07:03:30,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1186 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1186) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-19 07:03:30,617 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 Int) (v_ArrVal_1186 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1184))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1186) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) is different from false [2024-11-19 07:03:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2024-11-19 07:03:30,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729927853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:30,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:30,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 19] total 52 [2024-11-19 07:03:30,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727717299] [2024-11-19 07:03:30,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:30,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-19 07:03:30,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:30,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-19 07:03:30,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2209, Unknown=25, NotChecked=388, Total=2756 [2024-11-19 07:03:30,769 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 53 states, 52 states have (on average 2.423076923076923) internal successors, (126), 53 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:31,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:31,843 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-11-19 07:03:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 07:03:31,844 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.423076923076923) internal successors, (126), 53 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-19 07:03:31,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:31,844 INFO L225 Difference]: With dead ends: 91 [2024-11-19 07:03:31,844 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 07:03:31,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=352, Invalid=4607, Unknown=27, NotChecked=564, Total=5550 [2024-11-19 07:03:31,845 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 183 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:31,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1139 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1538 Invalid, 0 Unknown, 295 Unchecked, 0.5s Time] [2024-11-19 07:03:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 07:03:31,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-11-19 07:03:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 84 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-19 07:03:31,847 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 51 [2024-11-19 07:03:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:31,847 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-19 07:03:31,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.423076923076923) internal successors, (126), 53 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-19 07:03:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 07:03:31,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:31,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:31,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 07:03:32,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:32,049 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:32,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:32,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429551, now seen corresponding path program 1 times [2024-11-19 07:03:32,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:32,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847079360] [2024-11-19 07:03:32,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:32,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:33,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:33,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847079360] [2024-11-19 07:03:33,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847079360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:33,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170486967] [2024-11-19 07:03:33,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:33,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:33,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:33,278 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:33,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 07:03:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:33,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-19 07:03:33,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:33,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 07:03:33,577 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:33,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:03:33,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 07:03:33,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 07:03:33,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 07:03:33,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:33,890 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 19 [2024-11-19 07:03:33,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:33,895 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 25 treesize of output 13 [2024-11-19 07:03:34,034 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 07:03:34,034 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 62 treesize of output 57 [2024-11-19 07:03:34,037 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 30 treesize of output 13 [2024-11-19 07:03:34,116 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 31 treesize of output 13 [2024-11-19 07:03:34,119 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 9 treesize of output 3 [2024-11-19 07:03:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 07:03:34,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:34,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2024-11-19 07:03:34,365 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2024-11-19 07:03:34,371 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-19 07:03:34,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2024-11-19 07:03:34,411 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1296 (Array Int Int))) (or (forall ((v_ArrVal_1298 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1298)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1296) .cse0 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) (not (= v_ArrVal_1296 (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1296 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_1296 (Array Int Int))) (or (forall ((v_ArrVal_1298 Int) (v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1296) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (not (= v_ArrVal_1296 (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1296 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2024-11-19 07:03:34,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse2)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= v_ArrVal_1296 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))) (forall ((v_ArrVal_1298 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| v_ArrVal_1298)) .cse1 v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1296 (Array Int Int))) (or (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (not (= v_ArrVal_1296 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))))) is different from false [2024-11-19 07:03:34,474 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)) v_ArrVal_1296)) (forall ((v_ArrVal_1298 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| v_ArrVal_1298)) .cse1 v_ArrVal_1299) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2)))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)) v_ArrVal_1296)) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))))) is different from false [2024-11-19 07:03:34,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= v_ArrVal_1296 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= v_ArrVal_1296 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))) (forall ((v_ArrVal_1298 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| v_ArrVal_1298)) .cse1 v_ArrVal_1299) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))))))))) is different from false [2024-11-19 07:03:34,554 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= v_ArrVal_1296 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))) (forall ((v_ArrVal_1298 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| v_ArrVal_1298)) .cse1 v_ArrVal_1299) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= v_ArrVal_1296 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))))))))) is different from false [2024-11-19 07:03:34,566 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 40 treesize of output 38 [2024-11-19 07:03:34,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:34,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:34,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-19 07:03:34,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:03:34,577 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 21 treesize of output 13 [2024-11-19 07:03:34,582 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:34,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:34,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2024-11-19 07:03:34,589 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:34,591 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 37 treesize of output 35 [2024-11-19 07:03:34,593 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:34,594 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 28 treesize of output 16 [2024-11-19 07:03:34,597 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:34,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:34,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-19 07:03:34,603 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 20 treesize of output 12 [2024-11-19 07:03:34,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:34,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-11-19 07:03:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2024-11-19 07:03:35,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170486967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:35,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:35,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 22] total 68 [2024-11-19 07:03:35,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609915250] [2024-11-19 07:03:35,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:35,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-11-19 07:03:35,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-11-19 07:03:35,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=3342, Unknown=9, NotChecked=1116, Total=4692 [2024-11-19 07:03:35,032 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 69 states, 68 states have (on average 2.161764705882353) internal successors, (147), 69 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:37,325 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-19 07:03:37,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 07:03:37,327 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 2.161764705882353) internal successors, (147), 69 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-19 07:03:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:37,327 INFO L225 Difference]: With dead ends: 91 [2024-11-19 07:03:37,327 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 07:03:37,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=501, Invalid=5846, Unknown=9, NotChecked=1476, Total=7832 [2024-11-19 07:03:37,329 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 123 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 728 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:37,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1593 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2009 Invalid, 0 Unknown, 728 Unchecked, 0.7s Time] [2024-11-19 07:03:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 07:03:37,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2024-11-19 07:03:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 83 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-11-19 07:03:37,330 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 51 [2024-11-19 07:03:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:37,330 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-11-19 07:03:37,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 2.161764705882353) internal successors, (147), 69 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-11-19 07:03:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 07:03:37,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:37,331 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:37,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 07:03:37,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 07:03:37,531 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:37,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:37,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1114916376, now seen corresponding path program 1 times [2024-11-19 07:03:37,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:37,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487946545] [2024-11-19 07:03:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:37,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 07:03:37,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487946545] [2024-11-19 07:03:37,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487946545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025638084] [2024-11-19 07:03:37,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:37,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:37,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:37,601 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:37,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 07:03:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:37,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:03:37,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 07:03:37,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 07:03:37,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025638084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:37,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:37,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-19 07:03:37,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786192163] [2024-11-19 07:03:37,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:37,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:37,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:37,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:37,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:37,778 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:37,808 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-19 07:03:37,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:03:37,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-19 07:03:37,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:37,809 INFO L225 Difference]: With dead ends: 84 [2024-11-19 07:03:37,809 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 07:03:37,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:03:37,809 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 33 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:37,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 218 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 07:03:37,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 07:03:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 83 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2024-11-19 07:03:37,812 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 54 [2024-11-19 07:03:37,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:37,813 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2024-11-19 07:03:37,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2024-11-19 07:03:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 07:03:37,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:37,813 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:37,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 07:03:38,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 07:03:38,014 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:38,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:38,014 INFO L85 PathProgramCache]: Analyzing trace with hash 240244101, now seen corresponding path program 2 times [2024-11-19 07:03:38,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:38,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699440213] [2024-11-19 07:03:38,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:03:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:38,032 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:03:38,032 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:03:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:03:38,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:38,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699440213] [2024-11-19 07:03:38,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699440213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:38,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338533966] [2024-11-19 07:03:38,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:03:38,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:38,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:38,079 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:38,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 07:03:38,235 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:03:38,236 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:03:38,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 07:03:38,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:03:38,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:03:38,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338533966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:38,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:38,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-19 07:03:38,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107663674] [2024-11-19 07:03:38,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:38,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:38,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:38,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:38,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:38,332 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:38,346 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2024-11-19 07:03:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:03:38,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-19 07:03:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:38,347 INFO L225 Difference]: With dead ends: 75 [2024-11-19 07:03:38,347 INFO L226 Difference]: Without dead ends: 75 [2024-11-19 07:03:38,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-19 07:03:38,348 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:38,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 125 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-19 07:03:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-19 07:03:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2024-11-19 07:03:38,349 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 54 [2024-11-19 07:03:38,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:38,349 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-19 07:03:38,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2024-11-19 07:03:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 07:03:38,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:38,350 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:38,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 07:03:38,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 07:03:38,555 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:38,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:38,555 INFO L85 PathProgramCache]: Analyzing trace with hash 343039153, now seen corresponding path program 1 times [2024-11-19 07:03:38,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:38,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343761221] [2024-11-19 07:03:38,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:38,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343761221] [2024-11-19 07:03:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343761221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210677084] [2024-11-19 07:03:39,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:39,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:39,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:39,638 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:39,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 07:03:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:39,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-19 07:03:39,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:39,946 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:39,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:03:40,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 07:03:40,071 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 19 treesize of output 1 [2024-11-19 07:03:40,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:40,298 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 26 treesize of output 14 [2024-11-19 07:03:40,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:40,303 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 25 treesize of output 13 [2024-11-19 07:03:40,590 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 07:03:40,590 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 80 treesize of output 73 [2024-11-19 07:03:40,594 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 29 treesize of output 19 [2024-11-19 07:03:40,596 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 49 treesize of output 30 [2024-11-19 07:03:40,921 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 39 treesize of output 21 [2024-11-19 07:03:40,923 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 32 treesize of output 14 [2024-11-19 07:03:41,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:41,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:41,042 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 15 treesize of output 10 [2024-11-19 07:03:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:41,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:41,563 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 59 treesize of output 46 [2024-11-19 07:03:41,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 0)))) (and (or (forall ((v_ArrVal_1618 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1618) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) .cse1) (forall ((v_ArrVal_1620 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (or (< .cse2 0) (< .cse2 (+ |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1))))) (or (< |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1) .cse1) (or (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) .cse1)))) is different from false [2024-11-19 07:03:41,753 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse5)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse5)) (.cse4 (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0)))) (and (forall ((v_ArrVal_1620 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (< .cse0 0) (< .cse0 (+ .cse1 1))))) (or .cse4 (< .cse1 1)) (or .cse4 (forall ((v_ArrVal_1618 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1618) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) .cse2))) (or .cse4 (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))))))) is different from false [2024-11-19 07:03:42,113 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615))) (let ((.cse1 (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (< .cse1 0) (< .cse1 (+ (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 1)))))))) (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int))) (< (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0)) (< (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 1)))) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (forall ((v_ArrVal_1616 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615) .cse6 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1618 (Array Int Int))) (= .cse6 (select (select (store .cse7 .cse6 v_ArrVal_1618) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))))))))) is different from false [2024-11-19 07:03:42,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= v_ArrVal_1615 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))) (forall ((v_ArrVal_1616 Int)) (or (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1618 (Array Int Int))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| v_ArrVal_1616)) .cse1 v_ArrVal_1618) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= v_ArrVal_1615 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))) (forall ((v_ArrVal_1620 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse4 (+ (select v_ArrVal_1615 .cse2) 1)) (< .cse4 0)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= v_ArrVal_1615 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))) (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)) (< (select v_ArrVal_1615 .cse2) 1))))) (or (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1615 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int) (v_ArrVal_1620 (Array Int Int))) (or (not (= v_ArrVal_1615 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))))))) is different from false [2024-11-19 07:03:42,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (select .cse4 .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1615 (Array Int Int))) (or (forall ((v_ArrVal_1620 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1615) .cse2 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (or (< .cse0 (+ (select v_ArrVal_1615 .cse1) 1)) (< .cse0 0)))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (or (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1615) .cse2 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 0))) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1618 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| v_ArrVal_1616)) .cse2 v_ArrVal_1618) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse2)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)) (< (select v_ArrVal_1615 .cse1) 1) (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1615) .cse2 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 0))))))))) is different from false [2024-11-19 07:03:42,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse4 .cse2)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)) (forall ((v_ArrVal_1620 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1615) .cse3 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (or (< .cse1 0) (< .cse1 (+ (select v_ArrVal_1615 .cse2) 1))))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1618 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| v_ArrVal_1616)) .cse3 v_ArrVal_1618) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) .cse3)) (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1615) .cse3 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 0) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1615 (Array Int Int))) (or (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1615) .cse3 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 0)) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)) (< (select v_ArrVal_1615 .cse2) 1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))))) is different from false [2024-11-19 07:03:42,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse2)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)) (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 0)) (< (select v_ArrVal_1615 .cse2) 1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 0) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)))) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1618 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| v_ArrVal_1616)) .cse1 v_ArrVal_1618) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) .cse1)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1615 (Array Int Int))) (or (forall ((v_ArrVal_1620 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))) (or (< .cse4 0) (< .cse4 (+ (select v_ArrVal_1615 .cse2) 1))))) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))))) is different from false [2024-11-19 07:03:42,425 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 61 treesize of output 59 [2024-11-19 07:03:42,431 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:42,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:42,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-19 07:03:42,439 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 21 treesize of output 13 [2024-11-19 07:03:42,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 07:03:42,446 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:42,448 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-19 07:03:42,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2024-11-19 07:03:42,450 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:42,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-19 07:03:42,453 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:42,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:42,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-19 07:03:42,463 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 16 treesize of output 8 [2024-11-19 07:03:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-19 07:03:42,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210677084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:42,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:42,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 29, 29] total 84 [2024-11-19 07:03:42,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056368861] [2024-11-19 07:03:42,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:42,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2024-11-19 07:03:42,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:42,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2024-11-19 07:03:42,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=5570, Unknown=66, NotChecked=1092, Total=6972 [2024-11-19 07:03:42,848 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 84 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 84 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:44,082 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (<= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 0) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615))) (let ((.cse2 (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (or (< .cse2 0) (< .cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 1)))))))) (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615))) (or (not (= (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int))) (< (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 0)) (< (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 1)))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0) (= (select .cse1 4) 0) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 0))) .cse6) .cse6 (<= |c_ULTIMATE.start_sll_update_at_~head#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (forall ((v_ArrVal_1616 Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (or (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615) .cse7 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1618 (Array Int Int))) (= .cse7 (select (select (store .cse8 .cse7 v_ArrVal_1618) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))))))) (= |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2024-11-19 07:03:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:45,321 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2024-11-19 07:03:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 07:03:45,321 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 84 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-19 07:03:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:45,322 INFO L225 Difference]: With dead ends: 77 [2024-11-19 07:03:45,322 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 07:03:45,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2208 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=617, Invalid=10686, Unknown=71, NotChecked=1736, Total=13110 [2024-11-19 07:03:45,325 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 124 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 580 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:45,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1448 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2270 Invalid, 0 Unknown, 580 Unchecked, 0.8s Time] [2024-11-19 07:03:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 07:03:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2024-11-19 07:03:45,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2024-11-19 07:03:45,327 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 57 [2024-11-19 07:03:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:45,327 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2024-11-19 07:03:45,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 84 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2024-11-19 07:03:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 07:03:45,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:45,327 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:45,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-19 07:03:45,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 07:03:45,528 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:45,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341834, now seen corresponding path program 1 times [2024-11-19 07:03:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:45,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002505143] [2024-11-19 07:03:45,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:45,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 07:03:45,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:45,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002505143] [2024-11-19 07:03:45,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002505143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:45,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137797362] [2024-11-19 07:03:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:45,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:45,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:45,591 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:45,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 07:03:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:45,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 07:03:45,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-19 07:03:45,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:45,823 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:03:45,823 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 12 treesize of output 11 [2024-11-19 07:03:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-19 07:03:45,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137797362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:45,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:45,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-19 07:03:45,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267091035] [2024-11-19 07:03:45,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:45,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:03:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:45,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:03:45,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:45,828 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:45,875 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2024-11-19 07:03:45,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:03:45,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-19 07:03:45,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:45,875 INFO L225 Difference]: With dead ends: 72 [2024-11-19 07:03:45,876 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 07:03:45,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:45,877 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:45,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 07:03:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-19 07:03:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-11-19 07:03:45,878 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 59 [2024-11-19 07:03:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:45,878 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-11-19 07:03:45,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-11-19 07:03:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 07:03:45,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:45,879 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:45,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-19 07:03:46,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:46,085 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:46,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341833, now seen corresponding path program 1 times [2024-11-19 07:03:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:46,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808908602] [2024-11-19 07:03:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:03:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:46,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808908602] [2024-11-19 07:03:46,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808908602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:46,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:46,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 07:03:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484594687] [2024-11-19 07:03:46,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:46,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 07:03:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 07:03:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:03:46,259 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:46,386 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2024-11-19 07:03:46,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 07:03:46,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-19 07:03:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:46,386 INFO L225 Difference]: With dead ends: 74 [2024-11-19 07:03:46,386 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 07:03:46,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 07:03:46,387 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:46,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 184 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 07:03:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-19 07:03:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 73 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2024-11-19 07:03:46,388 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 59 [2024-11-19 07:03:46,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:46,389 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-19 07:03:46,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2024-11-19 07:03:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 07:03:46,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:46,389 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:46,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 07:03:46,390 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:46,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:46,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1658827182, now seen corresponding path program 1 times [2024-11-19 07:03:46,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:46,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073520646] [2024-11-19 07:03:46,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:46,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:03:46,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:46,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073520646] [2024-11-19 07:03:46,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073520646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:46,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:46,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:03:46,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949301135] [2024-11-19 07:03:46,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:46,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 07:03:46,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:46,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 07:03:46,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:03:46,494 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:46,564 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2024-11-19 07:03:46,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 07:03:46,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-19 07:03:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:46,565 INFO L225 Difference]: With dead ends: 76 [2024-11-19 07:03:46,565 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 07:03:46,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 07:03:46,566 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:46,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 230 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 07:03:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-19 07:03:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2024-11-19 07:03:46,568 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 60 [2024-11-19 07:03:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:46,568 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-11-19 07:03:46,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2024-11-19 07:03:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 07:03:46,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:46,568 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:46,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 07:03:46,568 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:46,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:46,569 INFO L85 PathProgramCache]: Analyzing trace with hash -698613301, now seen corresponding path program 1 times [2024-11-19 07:03:46,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:46,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378132817] [2024-11-19 07:03:46,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:46,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:03:46,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:46,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378132817] [2024-11-19 07:03:46,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378132817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:46,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:46,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 07:03:46,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232582499] [2024-11-19 07:03:46,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:46,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 07:03:46,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:46,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 07:03:46,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:03:46,673 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:46,779 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2024-11-19 07:03:46,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 07:03:46,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-19 07:03:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:46,779 INFO L225 Difference]: With dead ends: 75 [2024-11-19 07:03:46,779 INFO L226 Difference]: Without dead ends: 75 [2024-11-19 07:03:46,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 07:03:46,780 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:46,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 214 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-19 07:03:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-19 07:03:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2024-11-19 07:03:46,782 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 62 [2024-11-19 07:03:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:46,782 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-19 07:03:46,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2024-11-19 07:03:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 07:03:46,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:46,783 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:46,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 07:03:46,783 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:46,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:46,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1022827867, now seen corresponding path program 1 times [2024-11-19 07:03:46,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:46,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878526600] [2024-11-19 07:03:46,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:46,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 07:03:47,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:47,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878526600] [2024-11-19 07:03:47,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878526600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:47,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542213458] [2024-11-19 07:03:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:47,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:47,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:47,580 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:47,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-19 07:03:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:47,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-19 07:03:47,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:47,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 07:03:47,781 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:47,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:03:47,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 07:03:47,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:47,933 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 12 [2024-11-19 07:03:48,010 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:48,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 07:03:48,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:48,108 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 27 treesize of output 21 [2024-11-19 07:03:48,210 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 07:03:48,210 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 18 treesize of output 13 [2024-11-19 07:03:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:03:48,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:48,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:48,361 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 31 treesize of output 35 [2024-11-19 07:03:48,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-19 07:03:48,871 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 40 treesize of output 38 [2024-11-19 07:03:48,883 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 14 treesize of output 12 [2024-11-19 07:03:48,884 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:03:49,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542213458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:49,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:49,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 52 [2024-11-19 07:03:49,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287447829] [2024-11-19 07:03:49,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:49,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-19 07:03:49,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-19 07:03:49,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2574, Unknown=0, NotChecked=0, Total=2756 [2024-11-19 07:03:49,017 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 53 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 53 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:49,805 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-19 07:03:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 07:03:49,805 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 53 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-19 07:03:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:49,805 INFO L225 Difference]: With dead ends: 84 [2024-11-19 07:03:49,806 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 07:03:49,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=320, Invalid=4102, Unknown=0, NotChecked=0, Total=4422 [2024-11-19 07:03:49,806 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:49,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 634 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 07:03:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 07:03:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-19 07:03:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-11-19 07:03:49,808 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2024-11-19 07:03:49,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:49,808 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-11-19 07:03:49,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 53 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-11-19 07:03:49,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 07:03:49,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:49,809 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:49,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-19 07:03:50,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:50,009 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:03:50,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:50,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1022827868, now seen corresponding path program 1 times [2024-11-19 07:03:50,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:50,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456667262] [2024-11-19 07:03:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:50,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 07:03:51,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:51,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456667262] [2024-11-19 07:03:51,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456667262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:51,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936321616] [2024-11-19 07:03:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:51,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:51,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:51,856 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:51,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 07:03:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:52,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-19 07:03:52,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:52,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 07:03:52,182 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 07:03:52,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 07:03:52,190 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:52,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:03:52,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 07:03:52,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 07:03:52,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:52,515 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 17 [2024-11-19 07:03:52,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:52,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 07:03:52,691 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:52,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-19 07:03:52,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 07:03:52,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:52,854 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 17 treesize of output 15 [2024-11-19 07:03:52,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:52,864 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 27 treesize of output 21 [2024-11-19 07:03:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:03:53,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:53,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2107 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2107))) (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2106 Int)) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2106)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_2108) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (not (= (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2107 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2107)) (< (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))) (forall ((v_ArrVal_2107 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2107))) (or (not (= (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2107 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2107)) (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2106 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2106)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_2108) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2109) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (< (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))))) is different from false [2024-11-19 07:03:58,883 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 40 treesize of output 38 [2024-11-19 07:03:58,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:58,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:58,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-19 07:03:58,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:58,892 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 28 treesize of output 26 [2024-11-19 07:03:58,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:58,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:58,904 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 2 case distinctions, treesize of input 37 treesize of output 43 [2024-11-19 07:03:58,908 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 58 treesize of output 56 [2024-11-19 07:03:58,911 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:58,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:58,913 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2024-11-19 07:03:58,916 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-11-19 07:03:58,919 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:58,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:58,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-19 07:03:58,928 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:58,929 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 30 treesize of output 24 [2024-11-19 07:03:59,316 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:03:59,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-19 07:03:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 16 refuted. 1 times theorem prover too weak. 11 trivial. 3 not checked. [2024-11-19 07:03:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936321616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:59,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:59,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 23, 24] total 79 [2024-11-19 07:03:59,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204731528] [2024-11-19 07:03:59,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:59,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-19 07:03:59,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:59,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-19 07:03:59,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=5757, Unknown=135, NotChecked=154, Total=6320 [2024-11-19 07:03:59,487 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 80 states, 79 states have (on average 2.2278481012658227) internal successors, (176), 80 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:02,474 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2024-11-19 07:04:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 07:04:02,474 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 2.2278481012658227) internal successors, (176), 80 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-19 07:04:02,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:02,475 INFO L225 Difference]: With dead ends: 86 [2024-11-19 07:04:02,475 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 07:04:02,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2259 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=640, Invalid=9939, Unknown=137, NotChecked=204, Total=10920 [2024-11-19 07:04:02,476 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 111 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 2628 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:02,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1059 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2628 Invalid, 0 Unknown, 77 Unchecked, 1.4s Time] [2024-11-19 07:04:02,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 07:04:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-11-19 07:04:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2024-11-19 07:04:02,478 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 65 [2024-11-19 07:04:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:02,478 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2024-11-19 07:04:02,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 2.2278481012658227) internal successors, (176), 80 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2024-11-19 07:04:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 07:04:02,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:02,479 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:02,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-19 07:04:02,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:02,679 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:04:02,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:02,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1642891405, now seen corresponding path program 1 times [2024-11-19 07:04:02,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:02,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152797013] [2024-11-19 07:04:02,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:02,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 07:04:03,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:03,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152797013] [2024-11-19 07:04:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152797013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:03,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772910655] [2024-11-19 07:04:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:03,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:03,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:03,701 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:04:03,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-19 07:04:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:03,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-19 07:04:03,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:03,994 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:04:03,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:04:04,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 07:04:04,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:04:04,281 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 32 treesize of output 16 [2024-11-19 07:04:04,415 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:04:04,415 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 33 treesize of output 32 [2024-11-19 07:04:04,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:04,536 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 26 treesize of output 20 [2024-11-19 07:04:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:04:04,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:04,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-19 07:04:04,754 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2219) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-19 07:04:04,758 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2219) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-19 07:04:04,765 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2218)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2219)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-19 07:04:04,933 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_93| Int) (v_ArrVal_2218 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_93|) (not (= (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_93| v_ArrVal_2218)) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2219)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) is different from false [2024-11-19 07:04:05,032 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:04:05,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:05,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 2 case distinctions, treesize of input 24 treesize of output 30 [2024-11-19 07:04:05,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:05,041 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 35 treesize of output 33 [2024-11-19 07:04:05,043 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 20 treesize of output 18 [2024-11-19 07:04:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2024-11-19 07:04:05,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772910655] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:05,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:05,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 24, 25] total 65 [2024-11-19 07:04:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895645724] [2024-11-19 07:04:05,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:05,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-19 07:04:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:05,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-19 07:04:05,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3264, Unknown=54, NotChecked=600, Total=4160 [2024-11-19 07:04:05,171 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 65 states, 65 states have (on average 2.4) internal successors, (156), 65 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:06,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:06,656 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2024-11-19 07:04:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 07:04:06,656 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.4) internal successors, (156), 65 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-19 07:04:06,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:06,656 INFO L225 Difference]: With dead ends: 88 [2024-11-19 07:04:06,656 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 07:04:06,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=510, Invalid=6262, Unknown=54, NotChecked=830, Total=7656 [2024-11-19 07:04:06,657 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 76 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:06,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 989 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1800 Invalid, 0 Unknown, 340 Unchecked, 0.7s Time] [2024-11-19 07:04:06,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 07:04:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2024-11-19 07:04:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.08) internal successors, (81), 79 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2024-11-19 07:04:06,659 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 66 [2024-11-19 07:04:06,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:06,659 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2024-11-19 07:04:06,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.4) internal successors, (156), 65 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:06,659 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2024-11-19 07:04:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 07:04:06,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:06,660 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:06,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-19 07:04:06,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:06,860 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:04:06,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:06,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1727882938, now seen corresponding path program 1 times [2024-11-19 07:04:06,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:06,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903647619] [2024-11-19 07:04:06,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:06,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 07:04:07,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:07,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903647619] [2024-11-19 07:04:07,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903647619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:07,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271248676] [2024-11-19 07:04:07,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:07,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:07,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:07,965 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:04:07,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 07:04:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:08,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-19 07:04:08,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:08,271 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:04:08,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:04:08,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 07:04:08,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:04:08,556 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 17 [2024-11-19 07:04:08,691 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:04:08,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 07:04:08,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:08,811 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 27 treesize of output 21 [2024-11-19 07:04:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:04:08,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:09,028 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2329) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-19 07:04:09,033 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2329) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-19 07:04:09,036 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2329) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-19 07:04:09,041 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2329) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-19 07:04:09,365 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_100| Int) (v_ArrVal_2328 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_100|) (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_100| v_ArrVal_2328)) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2329)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-19 07:04:09,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:04:09,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:09,477 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 2 case distinctions, treesize of input 23 treesize of output 29 [2024-11-19 07:04:09,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:09,481 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 32 treesize of output 30 [2024-11-19 07:04:09,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 07:04:09,626 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:04:09,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-19 07:04:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2024-11-19 07:04:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271248676] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:09,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:09,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23, 24] total 63 [2024-11-19 07:04:09,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516738679] [2024-11-19 07:04:09,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:09,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-19 07:04:09,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-19 07:04:09,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=3116, Unknown=90, NotChecked=590, Total=4032 [2024-11-19 07:04:09,670 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 64 states, 63 states have (on average 2.507936507936508) internal successors, (158), 64 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:11,404 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2024-11-19 07:04:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 07:04:11,405 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.507936507936508) internal successors, (158), 64 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-19 07:04:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:11,405 INFO L225 Difference]: With dead ends: 87 [2024-11-19 07:04:11,405 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 07:04:11,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 100 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=501, Invalid=6068, Unknown=93, NotChecked=820, Total=7482 [2024-11-19 07:04:11,406 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 56 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 2445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:11,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 996 Invalid, 2445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2077 Invalid, 0 Unknown, 356 Unchecked, 0.9s Time] [2024-11-19 07:04:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 07:04:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2024-11-19 07:04:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2024-11-19 07:04:11,407 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 68 [2024-11-19 07:04:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:11,408 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2024-11-19 07:04:11,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.507936507936508) internal successors, (158), 64 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2024-11-19 07:04:11,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 07:04:11,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:11,408 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:11,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-19 07:04:11,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:11,609 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 07:04:11,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash -177401856, now seen corresponding path program 2 times [2024-11-19 07:04:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:11,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083103929] [2024-11-19 07:04:11,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:04:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:11,633 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:04:11,633 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:04:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 07:04:13,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:13,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083103929] [2024-11-19 07:04:13,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083103929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:13,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571838269] [2024-11-19 07:04:13,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:04:13,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:13,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:13,621 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:04:13,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-19 07:04:13,803 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:04:13,803 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:04:13,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-19 07:04:13,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:13,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:04:13,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:04:13,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:04:13,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:04:13,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:04:13,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:04:14,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:04:14,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:04:14,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 07:04:14,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 07:04:14,396 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-11-19 07:04:14,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-11-19 07:04:14,407 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-19 07:04:14,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-19 07:04:14,896 INFO L349 Elim1Store]: treesize reduction 116, result has 43.4 percent of original size [2024-11-19 07:04:14,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 162 [2024-11-19 07:04:14,993 INFO L349 Elim1Store]: treesize reduction 108, result has 47.3 percent of original size [2024-11-19 07:04:14,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 129 [2024-11-19 07:04:32,374 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-19 07:04:32,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2024-11-19 07:04:32,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:32,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2024-11-19 07:04:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:04:32,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:37,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (< (select .cse0 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|) (= (select (let ((.cse1 (let ((.cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (forall ((v_ArrVal_2447 (Array Int Int))) (or (not (= v_ArrVal_2447 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2447)) (.cse7 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (not (= v_ArrVal_2451 (store (select .cse6 (select .cse7 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (= (select (let ((.cse8 (select .cse5 4))) (select (store .cse6 .cse8 v_ArrVal_2451) (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse7))) (store .cse9 .cse8 (store (select .cse9 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))))) is different from false [2024-11-19 07:04:37,921 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (forall ((v_ArrVal_2447 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_2447)) (.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (= (select (let ((.cse1 (select .cse4 4))) (select (store .cse0 .cse1 v_ArrVal_2451) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0) (not (= (store (select .cse0 (select .cse3 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (not (= v_ArrVal_2447 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)))))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (= (select (let ((.cse6 (let ((.cse9 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse9)) (.cse8 (select .cse9 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0) (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))))) is different from false [2024-11-19 07:04:37,947 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (< (select .cse0 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (= (select (let ((.cse1 (let ((.cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (forall ((v_ArrVal_2447 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2447)) (.cse9 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (= (select (let ((.cse7 (select .cse5 4))) (select (store .cse6 .cse7 v_ArrVal_2451) (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (not (= (store (select .cse6 (select .cse9 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451))))) (not (= v_ArrVal_2447 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)))))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))))) is different from false [2024-11-19 07:04:38,021 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (forall ((v_ArrVal_2447 (Array Int Int))) (or (not (= v_ArrVal_2447 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2447)) (.cse9 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (= (select (let ((.cse7 (select .cse4 4))) (select (store .cse6 .cse7 v_ArrVal_2451) (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (not (= v_ArrVal_2451 (store (select .cse6 (select .cse9 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))))) is different from false [2024-11-19 07:04:38,055 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse5 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|) (< (select .cse0 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (= (select (let ((.cse1 (let ((.cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|) (forall ((v_ArrVal_2447 (Array Int Int))) (or (not (= v_ArrVal_2447 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2447)) (.cse9 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (= (select (let ((.cse7 (select .cse5 4))) (select (store .cse6 .cse7 v_ArrVal_2451) (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (not (= (store (select .cse6 (select .cse9 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))))))))))) is different from false [2024-11-19 07:04:38,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse5 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse4 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|) (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|) (forall ((v_ArrVal_2447 (Array Int Int))) (or (not (= (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)) v_ArrVal_2447)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2447)) (.cse7 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (not (= v_ArrVal_2451 (store (select .cse6 (select .cse7 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (= (select (let ((.cse8 (select .cse4 4))) (select (store .cse6 .cse8 v_ArrVal_2451) (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse7))) (store .cse9 .cse8 (store (select .cse9 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_#res#1.base|) 4))) 4) 0) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))))))))))) is different from false [2024-11-19 07:04:38,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse4 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (forall ((v_ArrVal_2447 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse7 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (not (= (store (select .cse6 (select .cse7 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (= (select (let ((.cse8 (select .cse4 4))) (select (store .cse6 .cse8 v_ArrVal_2451) (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse7))) (store .cse9 .cse8 (store (select .cse9 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (not (= (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)) v_ArrVal_2447)))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)))))) is different from false [2024-11-19 07:04:38,142 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:04:38,145 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:04:38,186 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-11-19 07:04:38,186 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 142 [2024-11-19 07:04:38,217 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-19 07:04:38,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 1 case distinctions, treesize of input 14 treesize of output 15 [2024-11-19 07:04:38,591 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:04:38,593 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:04:38,617 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-11-19 07:04:38,617 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 120 [2024-11-19 07:04:38,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-19 07:04:38,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse0 (not .cse8)) (.cse27 (< 0 .cse4))) (and (or .cse0 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse3 (select v_ArrVal_2447 4))) (or (= (select (select (store .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_7 4))) (not (= (store (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse7 (select v_arrayElimArr_8 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse8) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_ArrVal_2450 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (let ((.cse9 (let ((.cse11 (select v_arrayElimArr_8 4))) (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse12 (store .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_ArrVal_2450 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (let ((.cse13 (let ((.cse15 (select v_arrayElimArr_8 4))) (store .cse14 .cse15 (store (select .cse14 .cse15) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse16 (store .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (or (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse19 (select v_arrayElimArr_8 4))) (store .cse18 .cse19 (store (select .cse18 .cse19) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (let ((.cse20 (let ((.cse22 (select v_arrayElimArr_8 4))) (store .cse21 .cse22 (store (select .cse21 .cse22) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse23 (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (= (select (let ((.cse24 (let ((.cse25 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse26 (select v_arrayElimArr_8 4))) (store .cse25 .cse26 (store (select .cse25 .cse26) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse27)) .cse8) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (= (select (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse30 (select v_arrayElimArr_8 4))) (store .cse29 .cse30 (store (select .cse29 .cse30) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (let ((.cse31 (let ((.cse33 (select v_arrayElimArr_8 4))) (store .cse32 .cse33 (store (select .cse32 .cse33) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse31 (select (select .cse31 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse34 (store .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))) (select .cse34 (select (select .cse34 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) .cse27) (or (and (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse36 (select v_arrayElimArr_7 4))) (or (= (select (select (store .cse35 .cse36 v_ArrVal_2451) (select (select (let ((.cse37 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (store .cse37 .cse36 (store (select .cse37 .cse36) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse35 .cse36) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) .cse27) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse39 (select v_arrayElimArr_7 4))) (or (= (select (select (store .cse38 .cse39 v_ArrVal_2451) (select (select (let ((.cse40 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (store .cse40 .cse39 (store (select .cse40 .cse39) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2447 .cse4))) (not (= (store (select .cse38 .cse39) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))))))) .cse8) (or .cse0 (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_144 Int)) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_7 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse42 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse43 (select v_ArrVal_2447 4))) (or (= (select (select (store .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (store .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (store (select .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (= (select (select (store .cse41 v_arrayElimCell_144 v_ArrVal_2451) (select (select (store .cse42 v_arrayElimCell_144 (store (select .cse42 v_arrayElimCell_144) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (< .cse43 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))))) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_7 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse46 (select v_ArrVal_2447 4))) (or (= (select (select (store .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (let ((.cse45 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (store .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= .cse46 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (store (select .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< .cse46 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))))))) (or .cse8 (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse47 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse48 (select v_arrayElimArr_7 4))) (or (= (select (select (store .cse47 .cse48 v_ArrVal_2451) (select (select (store .cse49 .cse48 (store (select .cse49 .cse48) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store .cse47 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (store .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2447 .cse4))) (not (= (store (select .cse47 .cse48) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (not (= (select v_arrayElimArr_7 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse52 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse50 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse51 (select v_arrayElimArr_7 4))) (or (= (select (select (store .cse50 .cse51 v_ArrVal_2451) (select (select (store .cse52 .cse51 (store (select .cse52 .cse51) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store .cse50 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (store .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse50 .cse51) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) .cse27)))))) is different from false [2024-11-19 07:04:41,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:41,533 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 373 treesize of output 304 [2024-11-19 07:04:41,752 INFO L349 Elim1Store]: treesize reduction 108, result has 69.9 percent of original size [2024-11-19 07:04:41,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 1057 treesize of output 1198 [2024-11-19 07:04:41,856 INFO L349 Elim1Store]: treesize reduction 36, result has 67.0 percent of original size [2024-11-19 07:04:41,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1471 treesize of output 1442 [2024-11-19 07:04:41,911 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 915 treesize of output 869 [2024-11-19 07:04:42,117 INFO L349 Elim1Store]: treesize reduction 72, result has 73.4 percent of original size [2024-11-19 07:04:42,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1027 treesize of output 1176 [2024-11-19 07:04:42,191 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-19 07:04:42,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 620 treesize of output 623 [2024-11-19 07:04:42,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:42,280 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 610 treesize of output 650 [2024-11-19 07:04:42,401 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 723 treesize of output 691 [2024-11-19 07:04:42,505 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 1094 treesize of output 1040 [2024-11-19 07:04:42,621 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-19 07:04:42,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 567 treesize of output 576