./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.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 cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:14:50,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:14:50,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 18:14:50,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:14:50,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:14:50,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:14:50,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:14:50,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:14:50,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:14:50,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:14:50,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:14:50,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:14:50,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:14:50,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:14:50,289 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:14:50,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:14:50,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:14:50,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:14:50,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:14:50,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:14:50,291 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:14:50,291 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:14:50,292 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:14:50,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:14:50,292 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:14:50,293 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:14:50,293 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:14:50,293 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:14:50,293 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:14:50,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:14:50,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:14:50,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:14:50,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:14:50,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:14:50,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:14:50,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:14:50,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:14:50,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:14:50,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:14:50,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:14:50,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:14:50,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:14:50,300 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 -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2024-10-14 18:14:50,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:14:50,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:14:50,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:14:50,617 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:14:50,618 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:14:50,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2024-10-14 18:14:52,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:14:52,422 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:14:52,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2024-10-14 18:14:52,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0537afbea/fa8c8695fd00405bb61201f4569ecace/FLAGecf1116c1 [2024-10-14 18:14:52,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0537afbea/fa8c8695fd00405bb61201f4569ecace [2024-10-14 18:14:52,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:14:52,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:14:52,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:14:52,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:14:52,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:14:52,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:52,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb8860d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52, skipping insertion in model container [2024-10-14 18:14:52,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:52,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:14:52,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:14:52,848 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:14:52,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:14:52,950 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:14:52,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52 WrapperNode [2024-10-14 18:14:52,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:14:52,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:14:52,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:14:52,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:14:52,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:52,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:53,002 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 120 [2024-10-14 18:14:53,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:14:53,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:14:53,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:14:53,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:14:53,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:53,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:53,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:53,035 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-14 18:14:53,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:53,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:53,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:53,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:53,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:53,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:53,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:14:53,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:14:53,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:14:53,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:14:53,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (1/1) ... [2024-10-14 18:14:53,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:14:53,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:53,099 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-10-14 18:14:53,102 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-10-14 18:14:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-14 18:14:53,153 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-14 18:14:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 18:14:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 18:14:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 18:14:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 18:14:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:14:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:14:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:14:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:14:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:14:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:14:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:14:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 18:14:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 18:14:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:14:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:14:53,382 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:14:53,389 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:14:53,415 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-14 18:14:53,696 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-10-14 18:14:53,696 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:14:53,735 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:14:53,735 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-14 18:14:53,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:14:53 BoogieIcfgContainer [2024-10-14 18:14:53,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:14:53,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:14:53,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:14:53,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:14:53,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:14:52" (1/3) ... [2024-10-14 18:14:53,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d19361e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:14:53, skipping insertion in model container [2024-10-14 18:14:53,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:52" (2/3) ... [2024-10-14 18:14:53,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d19361e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:14:53, skipping insertion in model container [2024-10-14 18:14:53,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:14:53" (3/3) ... [2024-10-14 18:14:53,744 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2024-10-14 18:14:53,762 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:14:53,763 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-10-14 18:14:53,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:14:53,830 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;@7589bd2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:14:53,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-10-14 18:14:53,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 56 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 18:14:53,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:53,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 18:14:53,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:53,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash 6033865, now seen corresponding path program 1 times [2024-10-14 18:14:53,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:53,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972175436] [2024-10-14 18:14:53,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:53,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:54,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:54,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972175436] [2024-10-14 18:14:54,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972175436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:54,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:54,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:14:54,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051856766] [2024-10-14 18:14:54,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:54,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:14:54,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:54,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:14:54,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:54,142 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 56 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-10-14 18:14:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:54,224 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-10-14 18:14:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:14:54,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-14 18:14:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:54,241 INFO L225 Difference]: With dead ends: 54 [2024-10-14 18:14:54,241 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 18:14:54,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:54,246 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:54,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 67 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:54,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 18:14:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-14 18:14:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-14 18:14:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-10-14 18:14:54,282 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 4 [2024-10-14 18:14:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:54,282 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-10-14 18:14:54,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-10-14 18:14:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-10-14 18:14:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 18:14:54,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:54,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 18:14:54,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 18:14:54,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:54,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:54,285 INFO L85 PathProgramCache]: Analyzing trace with hash 6033866, now seen corresponding path program 1 times [2024-10-14 18:14:54,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:54,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648761987] [2024-10-14 18:14:54,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:54,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:54,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:54,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648761987] [2024-10-14 18:14:54,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648761987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:54,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:54,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:14:54,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242498790] [2024-10-14 18:14:54,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:54,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:14:54,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:54,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:14:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:54,437 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-10-14 18:14:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:54,500 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-10-14 18:14:54,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:14:54,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-14 18:14:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:54,503 INFO L225 Difference]: With dead ends: 47 [2024-10-14 18:14:54,503 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 18:14:54,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:54,506 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:54,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 65 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:54,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 18:14:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-14 18:14:54,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-14 18:14:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-10-14 18:14:54,515 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 4 [2024-10-14 18:14:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:54,516 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-10-14 18:14:54,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-10-14 18:14:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2024-10-14 18:14:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 18:14:54,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:54,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 18:14:54,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 18:14:54,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:54,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1506349614, now seen corresponding path program 1 times [2024-10-14 18:14:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:54,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830502382] [2024-10-14 18:14:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:54,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830502382] [2024-10-14 18:14:54,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830502382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:54,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:54,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:14:54,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283260835] [2024-10-14 18:14:54,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:54,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:14:54,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:54,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:14:54,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:54,573 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-10-14 18:14:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:54,621 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2024-10-14 18:14:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:14:54,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-14 18:14:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:54,622 INFO L225 Difference]: With dead ends: 57 [2024-10-14 18:14:54,623 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 18:14:54,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:54,628 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:54,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:14:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 18:14:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2024-10-14 18:14:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-10-14 18:14:54,635 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 6 [2024-10-14 18:14:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:54,636 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-10-14 18:14:54,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-10-14 18:14:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-10-14 18:14:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 18:14:54,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:54,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:54,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 18:14:54,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:54,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1828366541, now seen corresponding path program 1 times [2024-10-14 18:14:54,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:54,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031840161] [2024-10-14 18:14:54,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:54,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031840161] [2024-10-14 18:14:54,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031840161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:54,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:54,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:14:54,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800097569] [2024-10-14 18:14:54,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:54,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:14:54,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:54,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:14:54,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:54,726 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-10-14 18:14:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:54,767 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-10-14 18:14:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:14:54,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-10-14 18:14:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:54,769 INFO L225 Difference]: With dead ends: 53 [2024-10-14 18:14:54,769 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 18:14:54,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:54,771 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:54,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:14:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 18:14:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-14 18:14:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 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-10-14 18:14:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-10-14 18:14:54,782 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 8 [2024-10-14 18:14:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:54,782 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-10-14 18:14:54,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-10-14 18:14:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-10-14 18:14:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 18:14:54,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:54,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:54,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 18:14:54,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:54,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1117956245, now seen corresponding path program 1 times [2024-10-14 18:14:54,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:54,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166873573] [2024-10-14 18:14:54,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:54,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:54,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166873573] [2024-10-14 18:14:54,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166873573] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:54,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841616609] [2024-10-14 18:14:54,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:54,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:54,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:54,968 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-10-14 18:14:54,969 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-10-14 18:14:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:55,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:14:55,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:55,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:55,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841616609] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:14:55,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:14:55,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-10-14 18:14:55,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798303175] [2024-10-14 18:14:55,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:55,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:14:55,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:55,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:14:55,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:14:55,200 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:55,237 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-10-14 18:14:55,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:14:55,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 18:14:55,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:55,239 INFO L225 Difference]: With dead ends: 55 [2024-10-14 18:14:55,240 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 18:14:55,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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-10-14 18:14:55,241 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:55,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:14:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 18:14:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-14 18:14:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.605263157894737) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 18:14:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-10-14 18:14:55,248 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 13 [2024-10-14 18:14:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:55,248 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-10-14 18:14:55,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-10-14 18:14:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 18:14:55,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:55,249 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 18:14:55,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 18:14:55,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:55,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:55,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1016238794, now seen corresponding path program 1 times [2024-10-14 18:14:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:55,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064923686] [2024-10-14 18:14:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:55,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:55,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:55,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064923686] [2024-10-14 18:14:55,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064923686] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:55,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917481982] [2024-10-14 18:14:55,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:55,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:55,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:55,712 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-10-14 18:14:55,714 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-10-14 18:14:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:55,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 18:14:55,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:55,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:14:55,875 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:14:55,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 18:14:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:55,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:55,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917481982] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:14:55,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:14:55,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-14 18:14:55,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091540570] [2024-10-14 18:14:55,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:55,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:14:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:55,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:14:55,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:14:55,943 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:56,014 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-10-14 18:14:56,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:14:56,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 18:14:56,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:56,016 INFO L225 Difference]: With dead ends: 54 [2024-10-14 18:14:56,016 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 18:14:56,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:14:56,017 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:56,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 18:14:56,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-14 18:14:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 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-10-14 18:14:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2024-10-14 18:14:56,021 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 15 [2024-10-14 18:14:56,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:56,021 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2024-10-14 18:14:56,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:56,022 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2024-10-14 18:14:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 18:14:56,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:56,022 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 18:14:56,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 18:14:56,226 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,SelfDestructingSolverStorable5 [2024-10-14 18:14:56,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:56,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1016238795, now seen corresponding path program 1 times [2024-10-14 18:14:56,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:56,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488805679] [2024-10-14 18:14:56,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:56,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:56,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488805679] [2024-10-14 18:14:56,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488805679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:56,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802664524] [2024-10-14 18:14:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:56,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:56,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:56,603 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-10-14 18:14:56,604 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-10-14 18:14:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:56,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 18:14:56,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:56,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:14:56,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:14:56,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:56,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:14:56,819 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:14:56,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:14:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:56,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:57,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802664524] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:14:57,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:14:57,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-10-14 18:14:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880678603] [2024-10-14 18:14:57,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:57,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:14:57,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:57,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:14:57,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:14:57,158 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:57,304 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-10-14 18:14:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:14:57,305 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 18:14:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:57,306 INFO L225 Difference]: With dead ends: 53 [2024-10-14 18:14:57,306 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 18:14:57,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:14:57,307 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:57,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 18:14:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-14 18:14:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 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-10-14 18:14:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-10-14 18:14:57,312 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 15 [2024-10-14 18:14:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:57,313 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-10-14 18:14:57,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-10-14 18:14:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:14:57,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:57,313 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:57,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 18:14:57,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:57,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:57,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1560880014, now seen corresponding path program 2 times [2024-10-14 18:14:57,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:57,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377707529] [2024-10-14 18:14:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:57,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:57,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:57,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377707529] [2024-10-14 18:14:57,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377707529] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:57,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633414839] [2024-10-14 18:14:57,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:14:57,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:57,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:57,589 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-10-14 18:14:57,591 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-10-14 18:14:57,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:14:57,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:14:57,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 18:14:57,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:57,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:57,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633414839] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:14:57,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:14:57,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-10-14 18:14:57,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35785103] [2024-10-14 18:14:57,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:57,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:14:57,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:57,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:14:57,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:14:57,747 INFO L87 Difference]: Start difference. First operand 53 states and 59 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-10-14 18:14:57,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:57,802 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-10-14 18:14:57,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:14:57,803 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 20 [2024-10-14 18:14:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:57,804 INFO L225 Difference]: With dead ends: 53 [2024-10-14 18:14:57,804 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 18:14:57,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-10-14 18:14:57,805 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:57,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 102 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:14:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 18:14:57,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-14 18:14:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 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-10-14 18:14:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-10-14 18:14:57,813 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 20 [2024-10-14 18:14:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:57,813 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-10-14 18:14:57,814 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-10-14 18:14:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-10-14 18:14:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:14:57,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:57,814 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:57,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 18:14:58,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:58,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:58,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash 644040407, now seen corresponding path program 1 times [2024-10-14 18:14:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:58,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949216808] [2024-10-14 18:14:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:58,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:14:58,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:58,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949216808] [2024-10-14 18:14:58,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949216808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:58,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:58,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:14:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179286828] [2024-10-14 18:14:58,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:58,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:14:58,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:14:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:14:58,126 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-10-14 18:14:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:58,235 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2024-10-14 18:14:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:14:58,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 21 [2024-10-14 18:14:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:58,236 INFO L225 Difference]: With dead ends: 56 [2024-10-14 18:14:58,236 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 18:14:58,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:14:58,237 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:58,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 96 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 18:14:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-14 18:14:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 55 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-10-14 18:14:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2024-10-14 18:14:58,240 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 21 [2024-10-14 18:14:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:58,241 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-10-14 18:14:58,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-10-14 18:14:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2024-10-14 18:14:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:14:58,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:58,241 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:58,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 18:14:58,242 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:58,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:58,243 INFO L85 PathProgramCache]: Analyzing trace with hash 644040408, now seen corresponding path program 1 times [2024-10-14 18:14:58,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:58,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627115257] [2024-10-14 18:14:58,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:58,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:14:58,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:58,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627115257] [2024-10-14 18:14:58,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627115257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:58,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:58,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:14:58,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954874180] [2024-10-14 18:14:58,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:58,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:14:58,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:58,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:14:58,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:14:58,445 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:58,552 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-10-14 18:14:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:14:58,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 18:14:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:58,554 INFO L225 Difference]: With dead ends: 56 [2024-10-14 18:14:58,554 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 18:14:58,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:14:58,555 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:58,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 114 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 18:14:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-14 18:14:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 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-10-14 18:14:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-10-14 18:14:58,558 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 21 [2024-10-14 18:14:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:58,559 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-10-14 18:14:58,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-10-14 18:14:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:14:58,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:58,564 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:58,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 18:14:58,564 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:58,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:58,564 INFO L85 PathProgramCache]: Analyzing trace with hash 446255910, now seen corresponding path program 1 times [2024-10-14 18:14:58,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:58,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853796631] [2024-10-14 18:14:58,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:58,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:14:58,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:58,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853796631] [2024-10-14 18:14:58,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853796631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:58,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:58,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:14:58,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439979134] [2024-10-14 18:14:58,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:58,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:14:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:58,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:14:58,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:14:58,665 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:58,784 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-10-14 18:14:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:14:58,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 18:14:58,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:58,786 INFO L225 Difference]: With dead ends: 59 [2024-10-14 18:14:58,786 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 18:14:58,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:14:58,787 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:58,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 96 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 18:14:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-14 18:14:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-10-14 18:14:58,791 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 23 [2024-10-14 18:14:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:58,791 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-10-14 18:14:58,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-10-14 18:14:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:14:58,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:58,792 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:58,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 18:14:58,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:58,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:58,794 INFO L85 PathProgramCache]: Analyzing trace with hash 446255911, now seen corresponding path program 1 times [2024-10-14 18:14:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:58,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473448240] [2024-10-14 18:14:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:58,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:14:58,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473448240] [2024-10-14 18:14:58,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473448240] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:58,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487278399] [2024-10-14 18:14:58,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:58,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:58,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:58,905 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-10-14 18:14:58,907 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-10-14 18:14:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:59,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:14:59,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:14:59,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:14:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487278399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:59,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:14:59,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-14 18:14:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286447040] [2024-10-14 18:14:59,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:59,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:14:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:59,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:14:59,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:14:59,071 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-10-14 18:14:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:59,099 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-10-14 18:14:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:14:59,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 18:14:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:59,101 INFO L225 Difference]: With dead ends: 56 [2024-10-14 18:14:59,101 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 18:14:59,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:14:59,102 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 44 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:59,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 59 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:14:59,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 18:14:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2024-10-14 18:14:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 45 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-10-14 18:14:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2024-10-14 18:14:59,111 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 23 [2024-10-14 18:14:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:59,111 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-10-14 18:14:59,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-10-14 18:14:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-10-14 18:14:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:14:59,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:59,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:59,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 18:14:59,312 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,SelfDestructingSolverStorable11 [2024-10-14 18:14:59,313 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:59,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash 447643490, now seen corresponding path program 1 times [2024-10-14 18:14:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386512985] [2024-10-14 18:14:59,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:59,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:14:59,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386512985] [2024-10-14 18:14:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386512985] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492328250] [2024-10-14 18:14:59,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:59,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:59,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:59,451 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-10-14 18:14:59,453 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-10-14 18:14:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:59,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 18:14:59,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:14:59,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:14:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492328250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:59,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:14:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-14 18:14:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215682110] [2024-10-14 18:14:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:59,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:14:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:59,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:14:59,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:14:59,614 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-10-14 18:14:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:59,658 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-10-14 18:14:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:14:59,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 18:14:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:59,659 INFO L225 Difference]: With dead ends: 43 [2024-10-14 18:14:59,659 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 18:14:59,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 18:14:59,660 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:59,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 73 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:14:59,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 18:14:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-14 18:14:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 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-10-14 18:14:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2024-10-14 18:14:59,667 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 23 [2024-10-14 18:14:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:59,667 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2024-10-14 18:14:59,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-10-14 18:14:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-10-14 18:14:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:14:59,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:59,668 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:59,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 18:14:59,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:59,869 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:14:59,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash 447643435, now seen corresponding path program 1 times [2024-10-14 18:14:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:59,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013429894] [2024-10-14 18:14:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:00,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:00,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013429894] [2024-10-14 18:15:00,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013429894] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:00,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576460777] [2024-10-14 18:15:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:00,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:00,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:00,307 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-10-14 18:15:00,308 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-10-14 18:15:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:00,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 18:15:00,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:00,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:00,466 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:00,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:15:00,484 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 13 treesize of output 9 [2024-10-14 18:15:00,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-14 18:15:00,552 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 18:15:00,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-10-14 18:15:00,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:00,686 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 40 treesize of output 16 [2024-10-14 18:15:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:00,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:00,795 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-10-14 18:15:00,796 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-10-14 18:15:01,486 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-10-14 18:15:01,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:01,497 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 2 case distinctions, treesize of input 27 treesize of output 33 [2024-10-14 18:15:01,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:01,504 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 46 treesize of output 28 [2024-10-14 18:15:01,509 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 3 [2024-10-14 18:15:01,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-14 18:15:01,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576460777] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:01,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:01,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-10-14 18:15:01,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595694066] [2024-10-14 18:15:01,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:01,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 18:15:01,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:01,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 18:15:01,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=620, Unknown=7, NotChecked=50, Total=756 [2024-10-14 18:15:01,569 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 18:15:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:02,216 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-10-14 18:15:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 18:15:02,217 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 18:15:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:02,219 INFO L225 Difference]: With dead ends: 59 [2024-10-14 18:15:02,220 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 18:15:02,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=1177, Unknown=7, NotChecked=72, Total=1482 [2024-10-14 18:15:02,221 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 52 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:02,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 304 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 484 Invalid, 0 Unknown, 38 Unchecked, 0.3s Time] [2024-10-14 18:15:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 18:15:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2024-10-14 18:15:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 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-10-14 18:15:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-10-14 18:15:02,223 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 23 [2024-10-14 18:15:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:02,224 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-10-14 18:15:02,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 18:15:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-10-14 18:15:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:15:02,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:02,224 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:02,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 18:15:02,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:02,426 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:02,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:02,426 INFO L85 PathProgramCache]: Analyzing trace with hash 447643436, now seen corresponding path program 1 times [2024-10-14 18:15:02,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:02,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287019541] [2024-10-14 18:15:02,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:02,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:03,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287019541] [2024-10-14 18:15:03,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287019541] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034860345] [2024-10-14 18:15:03,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:03,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:03,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:03,063 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-10-14 18:15:03,065 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-10-14 18:15:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:03,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-14 18:15:03,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:03,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:03,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:03,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:15:03,301 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 13 treesize of output 9 [2024-10-14 18:15:03,309 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 13 treesize of output 9 [2024-10-14 18:15:03,353 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 29 treesize of output 13 [2024-10-14 18:15:03,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-14 18:15:03,429 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 18:15:03,429 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 79 treesize of output 72 [2024-10-14 18:15:03,434 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-10-14 18:15:03,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2024-10-14 18:15:03,636 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-10-14 18:15:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:03,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:03,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:03,875 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 46 treesize of output 50 [2024-10-14 18:15:03,991 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_827 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_827) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_826 (Array Int Int)) (v_ArrVal_825 Int)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse0 v_ArrVal_825)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_826) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (forall ((v_prenex_1 (Array Int Int)) (v_ArrVal_825 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse0 v_ArrVal_825)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))))) is different from false [2024-10-14 18:15:04,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:04,008 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 2 case distinctions, treesize of input 27 treesize of output 33 [2024-10-14 18:15:04,023 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 28 [2024-10-14 18:15:04,036 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-10-14 18:15:04,037 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 29 treesize of output 1 [2024-10-14 18:15:04,045 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-10-14 18:15:04,045 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 27 treesize of output 1 [2024-10-14 18:15:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-14 18:15:04,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034860345] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:04,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:04,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-10-14 18:15:04,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174579830] [2024-10-14 18:15:04,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:04,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 18:15:04,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:04,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 18:15:04,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=779, Unknown=10, NotChecked=56, Total=930 [2024-10-14 18:15:04,213 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 31 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-10-14 18:15:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:05,040 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2024-10-14 18:15:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 18:15:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 31 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) Word has length 23 [2024-10-14 18:15:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:05,041 INFO L225 Difference]: With dead ends: 54 [2024-10-14 18:15:05,041 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 18:15:05,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=1393, Unknown=10, NotChecked=78, Total=1722 [2024-10-14 18:15:05,043 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:05,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 334 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 449 Invalid, 0 Unknown, 36 Unchecked, 0.3s Time] [2024-10-14 18:15:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 18:15:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2024-10-14 18:15:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.3) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 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-10-14 18:15:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-10-14 18:15:05,048 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 23 [2024-10-14 18:15:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:05,049 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-10-14 18:15:05,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 31 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-10-14 18:15:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-10-14 18:15:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 18:15:05,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:05,050 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:05,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 18:15:05,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 18:15:05,251 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:05,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash -739060025, now seen corresponding path program 1 times [2024-10-14 18:15:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:05,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705513613] [2024-10-14 18:15:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:05,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 18:15:05,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:05,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705513613] [2024-10-14 18:15:05,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705513613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:05,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:05,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:15:05,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030066211] [2024-10-14 18:15:05,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:05,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:15:05,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:05,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:15:05,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:15:05,352 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:05,438 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-10-14 18:15:05,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:05,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-14 18:15:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:05,439 INFO L225 Difference]: With dead ends: 48 [2024-10-14 18:15:05,439 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 18:15:05,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:05,440 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:05,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 42 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:05,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 18:15:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 18:15:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 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-10-14 18:15:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-10-14 18:15:05,442 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 27 [2024-10-14 18:15:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:05,443 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-10-14 18:15:05,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-10-14 18:15:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 18:15:05,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:05,446 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:05,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 18:15:05,447 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:05,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:05,447 INFO L85 PathProgramCache]: Analyzing trace with hash -739060024, now seen corresponding path program 1 times [2024-10-14 18:15:05,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:05,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243485950] [2024-10-14 18:15:05,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:05,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:05,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243485950] [2024-10-14 18:15:05,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243485950] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559355127] [2024-10-14 18:15:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:05,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:05,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:05,569 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-10-14 18:15:05,570 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-10-14 18:15:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:05,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 18:15:05,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:15:05,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:15:05,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559355127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:05,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:15:05,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-14 18:15:05,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600985832] [2024-10-14 18:15:05,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:05,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:15:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:05,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:15:05,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:15:05,747 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:05,794 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-10-14 18:15:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:15:05,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-14 18:15:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:05,795 INFO L225 Difference]: With dead ends: 47 [2024-10-14 18:15:05,796 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 18:15:05,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 18:15:05,796 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:05,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 74 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:15:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 18:15:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-10-14 18:15:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.275) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-14 18:15:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2024-10-14 18:15:05,798 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 27 [2024-10-14 18:15:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:05,798 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-10-14 18:15:05,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-10-14 18:15:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 18:15:05,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:05,799 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:05,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 18:15:05,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 18:15:06,000 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:06,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:06,000 INFO L85 PathProgramCache]: Analyzing trace with hash 309852254, now seen corresponding path program 1 times [2024-10-14 18:15:06,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:06,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319392921] [2024-10-14 18:15:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:15:06,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319392921] [2024-10-14 18:15:06,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319392921] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385915135] [2024-10-14 18:15:06,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:06,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:06,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:06,120 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-10-14 18:15:06,122 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-10-14 18:15:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 18:15:06,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:15:06,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:15:06,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385915135] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:06,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:06,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-10-14 18:15:06,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493929939] [2024-10-14 18:15:06,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:06,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:15:06,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:06,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:15:06,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:15:06,350 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:06,400 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-10-14 18:15:06,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:06,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-14 18:15:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:06,401 INFO L225 Difference]: With dead ends: 43 [2024-10-14 18:15:06,401 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 18:15:06,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:15:06,402 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:06,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:15:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 18:15:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-10-14 18:15:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-14 18:15:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-10-14 18:15:06,403 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 28 [2024-10-14 18:15:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:06,404 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-10-14 18:15:06,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-10-14 18:15:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:15:06,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:06,406 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:06,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 18:15:06,606 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,SelfDestructingSolverStorable17 [2024-10-14 18:15:06,607 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:06,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash 972438291, now seen corresponding path program 1 times [2024-10-14 18:15:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:06,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134753848] [2024-10-14 18:15:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:15:06,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:06,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134753848] [2024-10-14 18:15:06,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134753848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:06,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286416606] [2024-10-14 18:15:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:06,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:06,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:06,671 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-10-14 18:15:06,673 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-10-14 18:15:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:15:06,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:15:06,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:15:06,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286416606] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:06,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:06,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-14 18:15:06,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924184465] [2024-10-14 18:15:06,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:06,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:15:06,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:06,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:15:06,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:15:06,898 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:06,945 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-10-14 18:15:06,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:06,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-14 18:15:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:06,946 INFO L225 Difference]: With dead ends: 44 [2024-10-14 18:15:06,946 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 18:15:06,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:15:06,947 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:06,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 67 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:15:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 18:15:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-14 18:15:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 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-10-14 18:15:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2024-10-14 18:15:06,949 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 29 [2024-10-14 18:15:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:06,949 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-10-14 18:15:06,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2024-10-14 18:15:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 18:15:06,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:06,951 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] [2024-10-14 18:15:06,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 18:15:07,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:07,152 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:07,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:07,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1797684859, now seen corresponding path program 2 times [2024-10-14 18:15:07,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:07,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247492400] [2024-10-14 18:15:07,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:07,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:15:07,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:07,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247492400] [2024-10-14 18:15:07,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247492400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:07,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:07,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:15:07,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197382636] [2024-10-14 18:15:07,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:07,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:15:07,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:07,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:15:07,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:15:07,358 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:07,437 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-10-14 18:15:07,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:07,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-14 18:15:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:07,438 INFO L225 Difference]: With dead ends: 45 [2024-10-14 18:15:07,439 INFO L226 Difference]: Without dead ends: 45 [2024-10-14 18:15:07,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:07,439 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:07,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 58 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-14 18:15:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-14 18:15:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.2) internal successors, (48), 44 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-10-14 18:15:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-10-14 18:15:07,442 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 32 [2024-10-14 18:15:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:07,442 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-10-14 18:15:07,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-10-14 18:15:07,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 18:15:07,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:07,443 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-10-14 18:15:07,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 18:15:07,443 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:07,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:07,443 INFO L85 PathProgramCache]: Analyzing trace with hash -106345640, now seen corresponding path program 1 times [2024-10-14 18:15:07,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:07,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137446811] [2024-10-14 18:15:07,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:15:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:07,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137446811] [2024-10-14 18:15:07,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137446811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:07,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:07,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:15:07,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37607837] [2024-10-14 18:15:07,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:07,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:15:07,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:07,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:15:07,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:15:07,536 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:07,601 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2024-10-14 18:15:07,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:07,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-14 18:15:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:07,602 INFO L225 Difference]: With dead ends: 47 [2024-10-14 18:15:07,602 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 18:15:07,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:07,602 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:07,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 65 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 18:15:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-10-14 18:15:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.175) internal successors, (47), 44 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-10-14 18:15:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2024-10-14 18:15:07,607 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 33 [2024-10-14 18:15:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:07,607 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2024-10-14 18:15:07,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2024-10-14 18:15:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:15:07,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:07,608 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:07,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 18:15:07,609 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:07,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash 998328825, now seen corresponding path program 1 times [2024-10-14 18:15:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:07,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458730651] [2024-10-14 18:15:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:07,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:15:07,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:07,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458730651] [2024-10-14 18:15:07,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458730651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:07,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:07,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:15:07,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305670802] [2024-10-14 18:15:07,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:07,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:15:07,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:07,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:15:07,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:15:07,730 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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-10-14 18:15:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:07,794 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-10-14 18:15:07,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:07,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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 34 [2024-10-14 18:15:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:07,797 INFO L225 Difference]: With dead ends: 46 [2024-10-14 18:15:07,797 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 18:15:07,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:07,798 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:07,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 18:15:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 18:15:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.170731707317073) internal successors, (48), 45 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-10-14 18:15:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2024-10-14 18:15:07,801 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 34 [2024-10-14 18:15:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:07,801 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2024-10-14 18:15:07,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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-10-14 18:15:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2024-10-14 18:15:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 18:15:07,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:07,802 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:07,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 18:15:07,803 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:07,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1434327753, now seen corresponding path program 1 times [2024-10-14 18:15:07,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:07,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737053780] [2024-10-14 18:15:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:07,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:08,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:08,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737053780] [2024-10-14 18:15:08,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737053780] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:08,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788537811] [2024-10-14 18:15:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:08,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:08,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:08,753 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-10-14 18:15:08,755 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-10-14 18:15:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-14 18:15:08,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:08,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:08,976 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:08,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:15:09,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:09,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-14 18:15:09,088 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:15:09,089 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 41 treesize of output 38 [2024-10-14 18:15:09,296 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:15:09,296 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 41 treesize of output 38 [2024-10-14 18:15:09,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:09,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:09,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:09,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-10-14 18:15:09,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:09,450 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 3 case distinctions, treesize of input 34 treesize of output 32 [2024-10-14 18:15:09,534 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 18:15:09,535 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-10-14 18:15:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:09,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:09,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int))) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1489) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1489 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1489)))) is different from false [2024-10-14 18:15:09,763 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1488 (Array Int Int)) (v_DerPreprocessor_1 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1488) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_DerPreprocessor_1) 4)) 1))) is different from false [2024-10-14 18:15:09,784 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1488 (Array Int Int)) (v_DerPreprocessor_1 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1488) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_DerPreprocessor_1) 4)) 1))) is different from false [2024-10-14 18:15:09,881 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1488 (Array Int Int)) (v_DerPreprocessor_1 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1488) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_DerPreprocessor_1) 4)) 1))) is different from false [2024-10-14 18:15:09,902 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1488 (Array Int Int)) (v_DerPreprocessor_1 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1488) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_DerPreprocessor_1) 4)) 1) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2024-10-14 18:15:09,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:09,917 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 61 treesize of output 65 [2024-10-14 18:15:09,944 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1487 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1487))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1488)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_DerPreprocessor_1) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1487 (Array Int Int)) (v_DerPreprocessor_1 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1487))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1488)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_DerPreprocessor_1) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))))) is different from false [2024-10-14 18:15:10,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1487 (Array Int Int)) (v_DerPreprocessor_1 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1487))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1488)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_DerPreprocessor_1) 4)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1487 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (let ((.cse3 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1487))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1488)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_DerPreprocessor_1) 4))))))) is different from false [2024-10-14 18:15:10,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:10,019 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 56 treesize of output 47 [2024-10-14 18:15:10,023 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 305 treesize of output 285 [2024-10-14 18:15:10,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 215 [2024-10-14 18:15:10,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:10,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 226 [2024-10-14 18:15:10,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:10,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 245 treesize of output 237 [2024-10-14 18:15:10,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:10,195 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 55 treesize of output 46 [2024-10-14 18:15:10,198 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:15:10,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2024-10-14 18:15:10,204 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:15:10,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-14 18:15:10,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:15:10,223 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2024-10-14 18:15:10,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 31 [2024-10-14 18:15:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-10-14 18:15:10,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788537811] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:10,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:10,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 44 [2024-10-14 18:15:10,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942350377] [2024-10-14 18:15:10,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:10,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-14 18:15:10,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:10,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-14 18:15:10,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1253, Unknown=19, NotChecked=546, Total=1980 [2024-10-14 18:15:10,347 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 45 states, 44 states have (on average 2.2954545454545454) internal successors, (101), 45 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:11,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:11,235 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-10-14 18:15:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 18:15:11,235 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.2954545454545454) internal successors, (101), 45 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-14 18:15:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:11,236 INFO L225 Difference]: With dead ends: 55 [2024-10-14 18:15:11,236 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 18:15:11,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=305, Invalid=2056, Unknown=19, NotChecked=700, Total=3080 [2024-10-14 18:15:11,237 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:11,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 206 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 616 Invalid, 0 Unknown, 351 Unchecked, 0.3s Time] [2024-10-14 18:15:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 18:15:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-10-14 18:15:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-14 18:15:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2024-10-14 18:15:11,239 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 37 [2024-10-14 18:15:11,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:11,239 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-10-14 18:15:11,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.2954545454545454) internal successors, (101), 45 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:11,239 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2024-10-14 18:15:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 18:15:11,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:11,240 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:11,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-14 18:15:11,444 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,SelfDestructingSolverStorable22 [2024-10-14 18:15:11,445 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:11,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:11,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1434327752, now seen corresponding path program 1 times [2024-10-14 18:15:11,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:11,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588161957] [2024-10-14 18:15:11,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:11,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:12,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588161957] [2024-10-14 18:15:12,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588161957] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:12,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583754458] [2024-10-14 18:15:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:12,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:12,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:12,631 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-10-14 18:15:12,632 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-10-14 18:15:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:12,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-14 18:15:12,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:12,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:15:12,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:12,904 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:12,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:15:12,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:15:12,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:12,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:13,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-14 18:15:13,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 18:15:13,089 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:15:13,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-10-14 18:15:13,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:15:13,371 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:15:13,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-10-14 18:15:13,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:15:13,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:13,448 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-10-14 18:15:13,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:13,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:13,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2024-10-14 18:15:13,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:13,558 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 2 case distinctions, treesize of input 34 treesize of output 32 [2024-10-14 18:15:13,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:13,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-10-14 18:15:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:13,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:13,872 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1623 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1623)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_1622 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1622 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1622)) (forall ((v_ArrVal_1623 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1623)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1622) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))))) is different from false [2024-10-14 18:15:14,014 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_40| Int) (v_ArrVal_1620 (Array Int Int))) (or (forall ((v_ArrVal_1623 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_ArrVal_1623) 4) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_40|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_40| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_DerPreprocessor_3 Int) (v_ArrVal_1623 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_ArrVal_1623) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_DerPreprocessor_3) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_40|)))) is different from false [2024-10-14 18:15:14,219 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_40| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_DerPreprocessor_3 Int) (v_ArrVal_1623 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_ArrVal_1623) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1621) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_DerPreprocessor_3) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_40|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_40| Int) (v_ArrVal_1620 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_40|) (forall ((v_ArrVal_1623 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_ArrVal_1623) 4)))))))) is different from false [2024-10-14 18:15:14,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_40| Int) (v_ArrVal_1620 (Array Int Int))) (or (forall ((v_ArrVal_1623 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1620) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_ArrVal_1623) 4) 4))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_40|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_40| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_DerPreprocessor_3 Int) (v_ArrVal_1623 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_40|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1620) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_ArrVal_1623) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1621) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_DerPreprocessor_3) 4))))))) is different from false [2024-10-14 18:15:14,424 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_40| Int) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1618 (Array Int Int))) (or (forall ((v_ArrVal_1623 Int)) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1619) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1618) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1620) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_ArrVal_1623) 4) 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_40|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_40| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1619 (Array Int Int)) (v_DerPreprocessor_3 Int) (v_ArrVal_1618 (Array Int Int)) (v_ArrVal_1623 Int)) (or (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1618))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (< (+ 7 (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1619) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_ArrVal_1623) 4)) (select |c_#length| (select (store (select (store .cse2 .cse1 v_ArrVal_1621) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_DerPreprocessor_3) 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_40|))))) is different from false [2024-10-14 18:15:14,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_40| Int) (v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1618 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_40|) (forall ((v_ArrVal_1623 Int)) (<= 0 (+ 4 (select (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1616)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1619) (select (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1618) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1620) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_ArrVal_1623) 4)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_40| Int) (v_ArrVal_1616 Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1619 (Array Int Int)) (v_DerPreprocessor_3 Int) (v_ArrVal_1618 (Array Int Int)) (v_ArrVal_1623 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_40|) (let ((.cse5 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1618))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (< (+ 7 (select (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1616)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1619) .cse4 v_ArrVal_1620) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_ArrVal_1623) 4)) (select |c_#length| (select (store (select (store .cse5 .cse4 v_ArrVal_1621) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_40| v_DerPreprocessor_3) 4)))))))))) is different from false [2024-10-14 18:15:14,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:14,496 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 111 treesize of output 117 [2024-10-14 18:15:14,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:14,507 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 96 treesize of output 72 [2024-10-14 18:15:14,513 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 426 treesize of output 402 [2024-10-14 18:15:14,523 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 756 treesize of output 742 [2024-10-14 18:15:14,533 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 152 treesize of output 148 [2024-10-14 18:15:14,541 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 166 treesize of output 162 [2024-10-14 18:15:14,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:14,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 100 [2024-10-14 18:15:14,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:14,584 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 82 treesize of output 81 [2024-10-14 18:15:14,593 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 81 treesize of output 79 [2024-10-14 18:15:14,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:14,610 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 57 treesize of output 59 [2024-10-14 18:15:14,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:14,683 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 47 treesize of output 53 [2024-10-14 18:15:14,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:14,694 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 36 treesize of output 42 [2024-10-14 18:15:14,697 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:15:14,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-10-14 18:15:14,702 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:15:14,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-14 18:15:14,706 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:15:14,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-14 18:15:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-10-14 18:15:14,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583754458] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:14,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:14,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 48 [2024-10-14 18:15:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737546480] [2024-10-14 18:15:14,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:14,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-14 18:15:14,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:14,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-14 18:15:14,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1607, Unknown=57, NotChecked=522, Total=2352 [2024-10-14 18:15:14,954 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 49 states, 48 states have (on average 2.1875) internal successors, (105), 49 states have internal predecessors, (105), 0 states have call successors, (0), 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-10-14 18:15:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:16,071 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-10-14 18:15:16,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 18:15:16,071 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.1875) internal successors, (105), 49 states have internal predecessors, (105), 0 states have call successors, (0), 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-10-14 18:15:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:16,072 INFO L225 Difference]: With dead ends: 56 [2024-10-14 18:15:16,072 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 18:15:16,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=347, Invalid=2692, Unknown=65, NotChecked=678, Total=3782 [2024-10-14 18:15:16,074 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:16,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 297 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 743 Invalid, 0 Unknown, 281 Unchecked, 0.4s Time] [2024-10-14 18:15:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 18:15:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-10-14 18:15:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-14 18:15:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-10-14 18:15:16,076 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 37 [2024-10-14 18:15:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:16,076 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-14 18:15:16,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.1875) internal successors, (105), 49 states have internal predecessors, (105), 0 states have call successors, (0), 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-10-14 18:15:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-10-14 18:15:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 18:15:16,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:16,077 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:16,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:16,278 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,SelfDestructingSolverStorable23 [2024-10-14 18:15:16,279 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:16,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1514488773, now seen corresponding path program 1 times [2024-10-14 18:15:16,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:16,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089886909] [2024-10-14 18:15:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:16,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:17,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:17,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089886909] [2024-10-14 18:15:17,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089886909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:17,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397285726] [2024-10-14 18:15:17,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:17,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:17,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:17,033 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-10-14 18:15:17,035 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-10-14 18:15:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:17,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-14 18:15:17,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:17,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:17,245 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:17,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:15:17,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:17,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-14 18:15:17,382 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:15:17,382 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 40 treesize of output 37 [2024-10-14 18:15:17,599 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:15:17,600 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 40 treesize of output 37 [2024-10-14 18:15:17,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:17,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:17,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:17,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-10-14 18:15:17,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:17,728 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 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-14 18:15:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:17,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:17,860 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1748 (Array Int Int))) (or (not (= v_ArrVal_1748 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1748 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1748) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)))) is different from false [2024-10-14 18:15:17,929 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_DerPreprocessor_4 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_44| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_44|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_4) 4) 0)))) is different from false [2024-10-14 18:15:17,945 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_DerPreprocessor_4 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_44| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1747) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_4) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_44|))) is different from false [2024-10-14 18:15:18,175 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_DerPreprocessor_4 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_44| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_44|) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1746))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1747)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_44| v_DerPreprocessor_4) 4) 0)))) is different from false [2024-10-14 18:15:18,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:18,292 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 56 treesize of output 47 [2024-10-14 18:15:18,299 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 305 treesize of output 285 [2024-10-14 18:15:18,307 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 221 treesize of output 215 [2024-10-14 18:15:18,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:18,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 243 treesize of output 235 [2024-10-14 18:15:18,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:18,348 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 92 treesize of output 91 [2024-10-14 18:15:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-14 18:15:18,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397285726] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:18,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:18,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 20] total 49 [2024-10-14 18:15:18,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292880040] [2024-10-14 18:15:18,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:18,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-14 18:15:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:18,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-14 18:15:18,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1786, Unknown=24, NotChecked=356, Total=2352 [2024-10-14 18:15:18,647 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 49 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:19,672 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2024-10-14 18:15:19,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 18:15:19,673 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 49 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-14 18:15:19,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:19,673 INFO L225 Difference]: With dead ends: 58 [2024-10-14 18:15:19,673 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 18:15:19,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=428, Invalid=3341, Unknown=29, NotChecked=492, Total=4290 [2024-10-14 18:15:19,675 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:19,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 276 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 589 Invalid, 2 Unknown, 184 Unchecked, 0.3s Time] [2024-10-14 18:15:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 18:15:19,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2024-10-14 18:15:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 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-10-14 18:15:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-10-14 18:15:19,677 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 38 [2024-10-14 18:15:19,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:19,678 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-10-14 18:15:19,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 49 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2024-10-14 18:15:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 18:15:19,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:19,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:19,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-14 18:15:19,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:19,880 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:19,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:19,881 INFO L85 PathProgramCache]: Analyzing trace with hash 295564662, now seen corresponding path program 1 times [2024-10-14 18:15:19,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:19,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337370371] [2024-10-14 18:15:19,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:19,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:20,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337370371] [2024-10-14 18:15:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337370371] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919433541] [2024-10-14 18:15:20,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:20,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:20,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:20,600 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-10-14 18:15:20,601 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-10-14 18:15:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:20,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-14 18:15:20,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:20,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:20,810 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:20,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:15:20,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:15:20,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-14 18:15:20,911 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:15:20,912 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 41 treesize of output 38 [2024-10-14 18:15:21,104 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:15:21,105 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 41 treesize of output 38 [2024-10-14 18:15:21,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:21,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:21,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:21,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-10-14 18:15:21,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:21,263 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 3 case distinctions, treesize of input 34 treesize of output 32 [2024-10-14 18:15:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:21,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:21,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1873 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1873) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (not (= v_ArrVal_1873 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1873 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) is different from false [2024-10-14 18:15:21,476 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1872 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_48| Int) (v_DerPreprocessor_5 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1872) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_48| v_DerPreprocessor_5) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_48|))) is different from false [2024-10-14 18:15:21,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1872 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_48| Int) (v_DerPreprocessor_5 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1872) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_48| v_DerPreprocessor_5) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_48|))) is different from false [2024-10-14 18:15:21,773 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1872 (Array Int Int)) (v_ArrVal_1871 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_48| Int) (v_DerPreprocessor_5 Int)) (or (< (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1871))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1872)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_48| v_DerPreprocessor_5) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_48|))) is different from false [2024-10-14 18:15:21,790 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1872 (Array Int Int)) (v_ArrVal_1871 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_48| Int) (v_DerPreprocessor_5 Int)) (or (< (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1871))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1872)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_48| v_DerPreprocessor_5) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_48|))) is different from false [2024-10-14 18:15:21,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:21,804 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 55 treesize of output 46 [2024-10-14 18:15:21,807 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 176 treesize of output 162 [2024-10-14 18:15:21,813 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 110 treesize of output 106 [2024-10-14 18:15:21,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:21,826 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 64 treesize of output 63 [2024-10-14 18:15:21,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:21,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 82 [2024-10-14 18:15:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-14 18:15:22,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919433541] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:22,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:22,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 44 [2024-10-14 18:15:22,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083367772] [2024-10-14 18:15:22,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:22,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-14 18:15:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:22,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-14 18:15:22,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1363, Unknown=51, NotChecked=400, Total=1980 [2024-10-14 18:15:22,162 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 45 states, 44 states have (on average 2.272727272727273) internal successors, (100), 45 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-10-14 18:15:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:22,997 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2024-10-14 18:15:22,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 18:15:22,998 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.272727272727273) internal successors, (100), 45 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) Word has length 39 [2024-10-14 18:15:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:22,998 INFO L225 Difference]: With dead ends: 57 [2024-10-14 18:15:22,999 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 18:15:23,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=318, Invalid=2300, Unknown=54, NotChecked=520, Total=3192 [2024-10-14 18:15:23,000 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:23,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 334 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 769 Invalid, 0 Unknown, 233 Unchecked, 0.4s Time] [2024-10-14 18:15:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 18:15:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2024-10-14 18:15:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-14 18:15:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2024-10-14 18:15:23,002 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 39 [2024-10-14 18:15:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:23,002 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-10-14 18:15:23,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.272727272727273) internal successors, (100), 45 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-10-14 18:15:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2024-10-14 18:15:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:15:23,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:23,003 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:23,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-14 18:15:23,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-14 18:15:23,204 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-10-14 18:15:23,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:23,205 INFO L85 PathProgramCache]: Analyzing trace with hash 484060314, now seen corresponding path program 2 times [2024-10-14 18:15:23,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:23,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362046123] [2024-10-14 18:15:23,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:24,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:24,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362046123] [2024-10-14 18:15:24,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362046123] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:24,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964065212] [2024-10-14 18:15:24,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:15:24,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:24,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:24,795 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-10-14 18:15:24,796 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-10-14 18:15:24,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:15:24,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:15:24,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-10-14 18:15:24,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:24,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:25,006 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-10-14 18:15:25,011 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-10-14 18:15:25,022 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-10-14 18:15:25,030 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 19 treesize of output 18 [2024-10-14 18:15:25,106 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:25,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:15:25,150 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-10-14 18:15:25,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-14 18:15:25,173 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-10-14 18:15:25,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-14 18:15:25,219 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-10-14 18:15:25,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-14 18:15:25,286 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-10-14 18:15:25,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 103 treesize of output 71 [2024-10-14 18:15:25,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-10-14 18:15:25,586 INFO L349 Elim1Store]: treesize reduction 104, result has 43.8 percent of original size [2024-10-14 18:15:25,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 104 treesize of output 130 [2024-10-14 18:15:25,634 INFO L349 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2024-10-14 18:15:25,634 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 2 case distinctions, treesize of input 32 treesize of output 41 [2024-10-14 18:15:26,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:26,310 INFO L349 Elim1Store]: treesize reduction 132, result has 40.5 percent of original size [2024-10-14 18:15:26,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 267 [2024-10-14 18:15:26,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:26,490 INFO L349 Elim1Store]: treesize reduction 240, result has 29.2 percent of original size [2024-10-14 18:15:26,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 26 case distinctions, treesize of input 276 treesize of output 272 [2024-10-14 18:15:45,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:45,832 INFO L349 Elim1Store]: treesize reduction 28, result has 69.9 percent of original size [2024-10-14 18:15:45,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 110 treesize of output 135 [2024-10-14 18:15:45,869 INFO L349 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2024-10-14 18:15:45,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 74 treesize of output 84 [2024-10-14 18:15:45,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:45,889 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 54 treesize of output 72 [2024-10-14 18:15:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:46,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:46,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-14 18:15:51,599 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int)) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (forall ((v_ArrVal_2015 Int)) (or (forall ((v_ArrVal_2013 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_2013) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (= .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (not (= v_ArrVal_2013 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0)))) (< 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int)) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (forall ((v_ArrVal_2015 Int)) (< 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (forall ((v_ArrVal_2013 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_2013))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (= .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) (not (= v_ArrVal_2013 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))) (= (select (select .cse6 .cse5) 4) 0)))))))))) is different from false [2024-10-14 18:15:51,636 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int)) (or (forall ((v_ArrVal_2015 Int)) (< 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (forall ((v_ArrVal_2013 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2013))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (or (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select .cse3 .cse2) 4) 0) (not (= v_ArrVal_2013 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))))))) (< .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int)) (or (forall ((v_ArrVal_2013 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2013) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (or (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= v_ArrVal_2013 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0)))) (forall ((v_ArrVal_2015 Int)) (< 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (< .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))))) is different from false [2024-10-14 18:15:51,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int)) (or (forall ((v_ArrVal_2015 Int)) (< 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (forall ((v_ArrVal_2013 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2013) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_2013)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0)))) (< .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int)) (or (forall ((v_ArrVal_2015 Int)) (< 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (forall ((v_ArrVal_2013 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2013))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_2013)) (= (select (select .cse5 .cse6) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6))))) (< .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))))) is different from false [2024-10-14 18:15:51,844 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_2007 Int) (v_ArrVal_2008 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 .cse6 v_ArrVal_2008)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 .cse6 v_ArrVal_2007))) (.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (forall ((v_ArrVal_2015 Int)) (< 0 (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (< (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (forall ((v_ArrVal_2013 (Array Int Int))) (let ((.cse4 (store .cse3 .cse1 v_ArrVal_2013))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (not (= (store (select .cse3 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_2013)) (= (select (select .cse4 .cse2) 4) 0))))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_2007 Int) (v_ArrVal_2008 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 .cse6 v_ArrVal_2008)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 .cse6 v_ArrVal_2007)))) (or (forall ((v_ArrVal_2015 Int)) (< 0 (select (select (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (forall ((v_ArrVal_2013 (Array Int Int))) (let ((.cse10 (select (select (store .cse11 .cse9 v_ArrVal_2013) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= (select (select .cse8 .cse10) 4) 0) (= .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (not (= (store (select .cse11 .cse9) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_2013))))) (< (select (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|))))))) is different from false [2024-10-14 18:15:51,986 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2007 Int) (v_ArrVal_2008 Int)) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 .cse5 v_ArrVal_2008)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2004))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_2007))))) (or (forall ((v_ArrVal_2013 (Array Int Int))) (let ((.cse3 (select (select (store .cse0 .cse1 v_ArrVal_2013) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_2013)) (= 0 (select (select .cse2 .cse3) 4)) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (forall ((v_ArrVal_2015 Int)) (< 0 (select (select (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (< (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2007 Int) (v_ArrVal_2008 Int)) (let ((.cse10 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 .cse5 v_ArrVal_2008)))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse12 (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2004))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_2007))))) (or (forall ((v_ArrVal_2013 (Array Int Int))) (let ((.cse8 (store .cse10 .cse11 v_ArrVal_2013))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= (select (select .cse8 .cse9) 4) 0) (not (= (store (select .cse10 .cse11) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_2013)) (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (forall ((v_ArrVal_2015 Int)) (< 0 (select (select (store .cse12 .cse11 (store (select .cse12 .cse11) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (< (select (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))))))) is different from false [2024-10-14 18:15:52,068 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2007 Int) (v_ArrVal_2008 Int)) (let ((.cse2 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse8 .cse6 v_ArrVal_2008)))) (let ((.cse0 (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2004))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_2007)))) (.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (< (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (forall ((v_ArrVal_2013 (Array Int Int))) (let ((.cse4 (store .cse2 .cse3 v_ArrVal_2013))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (not (= v_ArrVal_2013 (store (select .cse2 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))) (= (select (select .cse4 .cse1) 4) 0))))) (forall ((v_ArrVal_2015 Int)) (< 0 (select (select (store .cse0 .cse3 (store (select .cse0 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2007 Int) (v_ArrVal_2008 Int)) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse8 .cse6 v_ArrVal_2008)))) (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2004))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_2007)))) (.cse12 (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (forall ((v_ArrVal_2013 (Array Int Int))) (let ((.cse9 (select (select (store .cse11 .cse12 v_ArrVal_2013) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse9) (= (select (select .cse10 .cse9) 4) 0) (not (= v_ArrVal_2013 (store (select .cse11 .cse12) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|))))))) (< (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (forall ((v_ArrVal_2015 Int)) (< 0 (select (select (store .cse10 .cse12 (store (select .cse10 .cse12) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))))))) is different from false [2024-10-14 18:15:52,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:52,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 470 treesize of output 286 [2024-10-14 18:15:52,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:52,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 407 treesize of output 263 [2024-10-14 18:15:52,265 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2015 Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2007 Int) (v_ArrVal_2008 Int)) (let ((.cse3 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_14))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_2008))))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse1 (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2004))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_2007)))) (.cse4 (select (select (store .cse3 .cse2 v_ArrVal_2013) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_14 .cse0) 0)) (< 0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (not (= (store (select .cse3 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_2013)) (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (< (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (not (= (select v_arrayElimArr_14 .cse5) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select .cse1 .cse4) 4) 0)))))) (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2015 Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2007 Int) (v_ArrVal_2008 Int)) (let ((.cse9 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_13))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_2008))))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse13 (store .cse9 .cse10 v_ArrVal_2013))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse11 (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2004))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_2007))))) (or (not (= (store (select .cse9 .cse10) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_2013 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_2013)) (< 0 (select (select (store .cse11 .cse10 (store (select .cse11 .cse10) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_2015)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse12) (= (select (select .cse13 .cse12) 4) 0) (< (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse5) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))))))) is different from false [2024-10-14 18:16:10,451 INFO L349 Elim1Store]: treesize reduction 90, result has 61.0 percent of original size [2024-10-14 18:16:10,451 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 4 case distinctions, treesize of input 3042 treesize of output 2749 [2024-10-14 18:16:10,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:16:10,504 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 589 treesize of output 581 [2024-10-14 18:16:10,534 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 539 treesize of output 519 [2024-10-14 18:16:10,734 INFO L349 Elim1Store]: treesize reduction 58, result has 55.0 percent of original size [2024-10-14 18:16:10,735 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 10 case distinctions, treesize of input 10333 treesize of output 6809 [2024-10-14 18:16:10,990 INFO L349 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2024-10-14 18:16:10,991 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 2041 treesize of output 1996 [2024-10-14 18:16:11,285 INFO L349 Elim1Store]: treesize reduction 131, result has 27.2 percent of original size [2024-10-14 18:16:11,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 1909 treesize of output 1826 [2024-10-14 18:16:12,808 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:16:12,811 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:16:12,855 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2024-10-14 18:16:12,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 44 [2024-10-14 18:16:12,934 INFO L173 IndexEqualityManager]: detected equality via solver