./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:28:30,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:28:30,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:28:30,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:28:30,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:28:30,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:28:30,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:28:30,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:28:30,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:28:30,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:28:30,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:28:30,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:28:30,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:28:30,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:28:30,177 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:28:30,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:28:30,178 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:28:30,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:28:30,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:28:30,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:28:30,181 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:28:30,182 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:28:30,182 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:28:30,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:28:30,182 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:28:30,182 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:28:30,183 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:28:30,183 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:28:30,183 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:28:30,183 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:28:30,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:28:30,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:28:30,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:28:30,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:28:30,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:28:30,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:28:30,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:28:30,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:28:30,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:28:30,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:28:30,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:28:30,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:28:30,190 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2024-11-10 15:28:30,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:28:30,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:28:30,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:28:30,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:28:30,471 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:28:30,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all.i [2024-11-10 15:28:32,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:28:32,247 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:28:32,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i [2024-11-10 15:28:32,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a23c4e2/2e2b2a9300dd4f898aaad2b763273a3d/FLAGc6451abb7 [2024-11-10 15:28:32,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a23c4e2/2e2b2a9300dd4f898aaad2b763273a3d [2024-11-10 15:28:32,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:28:32,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:28:32,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:28:32,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:28:32,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:28:32,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117b523e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32, skipping insertion in model container [2024-11-10 15:28:32,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:28:32,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:28:32,740 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:28:32,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:28:32,810 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:28:32,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32 WrapperNode [2024-11-10 15:28:32,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:28:32,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:28:32,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:28:32,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:28:32,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,864 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2024-11-10 15:28:32,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:28:32,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:28:32,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:28:32,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:28:32,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,910 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-11-10 15:28:32,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,918 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:28:32,925 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:28:32,925 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:28:32,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:28:32,928 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (1/1) ... [2024-11-10 15:28:32,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:28:32,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:32,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:28:32,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:28:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-10 15:28:33,013 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-10 15:28:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:28:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:28:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:28:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:28:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:28:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:28:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:28:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:28:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:28:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:28:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:28:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:28:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:28:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:28:33,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:28:33,122 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:28:33,124 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:28:33,152 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-10 15:28:33,365 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: havoc dll_get_data_at_#t~mem9#1; [2024-11-10 15:28:33,391 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-10 15:28:33,391 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:28:33,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:28:33,408 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:28:33,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:28:33 BoogieIcfgContainer [2024-11-10 15:28:33,409 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:28:33,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:28:33,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:28:33,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:28:33,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:28:32" (1/3) ... [2024-11-10 15:28:33,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3c965a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:28:33, skipping insertion in model container [2024-11-10 15:28:33,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:32" (2/3) ... [2024-11-10 15:28:33,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3c965a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:28:33, skipping insertion in model container [2024-11-10 15:28:33,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:28:33" (3/3) ... [2024-11-10 15:28:33,420 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2024-11-10 15:28:33,438 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:28:33,438 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-10 15:28:33,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:28:33,489 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;@2565d187, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:28:33,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-10 15:28:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 52 states have (on average 1.75) internal successors, (91), 75 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:28:33,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:33,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:28:33,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:33,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash -272634277, now seen corresponding path program 1 times [2024-11-10 15:28:33,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:33,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065154386] [2024-11-10 15:28:33,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065154386] [2024-11-10 15:28:33,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065154386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:33,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:33,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:28:33,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653529332] [2024-11-10 15:28:33,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:33,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:33,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:33,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:33,862 INFO L87 Difference]: Start difference. First operand has 77 states, 52 states have (on average 1.75) internal successors, (91), 75 states have internal predecessors, (91), 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 3.0) internal successors, (6), 3 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-11-10 15:28:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:33,959 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-11-10 15:28:33,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:33,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-11-10 15:28:33,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:33,975 INFO L225 Difference]: With dead ends: 73 [2024-11-10 15:28:33,975 INFO L226 Difference]: Without dead ends: 67 [2024-11-10 15:28:33,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:33,983 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:33,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-10 15:28:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-10 15:28:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.553191489361702) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-11-10 15:28:34,026 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 6 [2024-11-10 15:28:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:34,026 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-11-10 15:28:34,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-11-10 15:28:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-11-10 15:28:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:28:34,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:34,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:28:34,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:28:34,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:34,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash -272634276, now seen corresponding path program 1 times [2024-11-10 15:28:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:34,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121933794] [2024-11-10 15:28:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:34,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:34,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121933794] [2024-11-10 15:28:34,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121933794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:34,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:34,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:28:34,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2561288] [2024-11-10 15:28:34,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:34,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:34,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:34,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:34,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:34,180 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-11-10 15:28:34,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:34,221 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-10 15:28:34,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:34,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-11-10 15:28:34,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:34,223 INFO L225 Difference]: With dead ends: 64 [2024-11-10 15:28:34,223 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 15:28:34,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:34,225 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:34,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 109 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:34,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 15:28:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 15:28:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-10 15:28:34,231 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 6 [2024-11-10 15:28:34,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:34,232 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-10 15:28:34,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-11-10 15:28:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-10 15:28:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:28:34,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:34,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:34,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:28:34,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:34,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:34,234 INFO L85 PathProgramCache]: Analyzing trace with hash 389508085, now seen corresponding path program 1 times [2024-11-10 15:28:34,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:34,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388770902] [2024-11-10 15:28:34,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:34,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:34,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:34,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388770902] [2024-11-10 15:28:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388770902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:34,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:34,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:28:34,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998788783] [2024-11-10 15:28:34,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:34,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:34,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:34,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:34,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:34,331 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:34,352 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-10 15:28:34,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:34,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-10 15:28:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:34,354 INFO L225 Difference]: With dead ends: 72 [2024-11-10 15:28:34,354 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 15:28:34,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:34,355 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:34,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:34,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 15:28:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-11-10 15:28:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2024-11-10 15:28:34,364 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 10 [2024-11-10 15:28:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:34,364 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2024-11-10 15:28:34,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2024-11-10 15:28:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:28:34,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:34,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:34,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:28:34,366 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:34,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash 761259430, now seen corresponding path program 1 times [2024-11-10 15:28:34,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684970903] [2024-11-10 15:28:34,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:34,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:34,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684970903] [2024-11-10 15:28:34,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684970903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:34,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:34,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:28:34,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253882051] [2024-11-10 15:28:34,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:34,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:34,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:34,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:34,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:34,438 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:34,451 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-11-10 15:28:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:34,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-10 15:28:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:34,452 INFO L225 Difference]: With dead ends: 72 [2024-11-10 15:28:34,452 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 15:28:34,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:34,454 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:34,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 15:28:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-11-10 15:28:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2024-11-10 15:28:34,460 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 11 [2024-11-10 15:28:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:34,460 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2024-11-10 15:28:34,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:34,461 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2024-11-10 15:28:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:28:34,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:34,462 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:34,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:28:34,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:34,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash -944532217, now seen corresponding path program 1 times [2024-11-10 15:28:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:34,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964667192] [2024-11-10 15:28:34,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:34,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964667192] [2024-11-10 15:28:34,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964667192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:34,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268257577] [2024-11-10 15:28:34,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:34,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:34,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:34,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:34,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:28:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:34,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:28:34,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:34,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:34,959 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:28:34,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:28:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:34,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:35,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268257577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:35,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:35,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-10 15:28:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017761194] [2024-11-10 15:28:35,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:35,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:28:35,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:35,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:28:35,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:35,057 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-11-10 15:28:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:35,210 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-11-10 15:28:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:35,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 18 [2024-11-10 15:28:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:35,211 INFO L225 Difference]: With dead ends: 70 [2024-11-10 15:28:35,211 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 15:28:35,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 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-11-10 15:28:35,213 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:35,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 183 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 15:28:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-10 15:28:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-11-10 15:28:35,218 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 18 [2024-11-10 15:28:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:35,219 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-11-10 15:28:35,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-11-10 15:28:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-11-10 15:28:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:28:35,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:35,220 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:35,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 15:28:35,424 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-11-10 15:28:35,425 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:35,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash -944532216, now seen corresponding path program 1 times [2024-11-10 15:28:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:35,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792380601] [2024-11-10 15:28:35,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:35,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:35,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:35,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792380601] [2024-11-10 15:28:35,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792380601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:35,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639122315] [2024-11-10 15:28:35,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:35,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:35,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:35,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:35,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:28:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:35,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 15:28:35,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:35,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:35,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:28:35,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:35,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-11-10 15:28:35,924 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:35,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:28:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:35,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:36,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639122315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:36,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:36,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-10 15:28:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739787017] [2024-11-10 15:28:36,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:36,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:28:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:36,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:28:36,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:28:36,295 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:36,463 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-11-10 15:28:36,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:36,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:28:36,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:36,464 INFO L225 Difference]: With dead ends: 69 [2024-11-10 15:28:36,465 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 15:28:36,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:28:36,466 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 17 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:36,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 320 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 15:28:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 15:28:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-11-10 15:28:36,471 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 18 [2024-11-10 15:28:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:36,471 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-11-10 15:28:36,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-11-10 15:28:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:28:36,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:36,473 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:36,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:28:36,677 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-11-10 15:28:36,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:36,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1939284268, now seen corresponding path program 1 times [2024-11-10 15:28:36,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:36,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292714111] [2024-11-10 15:28:36,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:36,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:36,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292714111] [2024-11-10 15:28:36,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292714111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:36,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143050753] [2024-11-10 15:28:36,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:36,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:36,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:36,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:36,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 15:28:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:36,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:28:36,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:36,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:36,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143050753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:36,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:36,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-10 15:28:36,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390852870] [2024-11-10 15:28:36,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:36,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:28:36,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:36,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:28:36,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:36,907 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:36,923 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-11-10 15:28:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:28:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 15:28:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:36,924 INFO L225 Difference]: With dead ends: 72 [2024-11-10 15:28:36,924 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 15:28:36,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:36,925 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:36,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 248 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:36,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 15:28:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 15:28:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.368421052631579) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-10 15:28:36,930 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2024-11-10 15:28:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:36,931 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-10 15:28:36,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:36,931 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-10 15:28:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:28:36,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:36,932 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:36,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 15:28:37,136 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-11-10 15:28:37,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:37,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1749759486, now seen corresponding path program 2 times [2024-11-10 15:28:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:37,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338502254] [2024-11-10 15:28:37,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:37,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:37,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338502254] [2024-11-10 15:28:37,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338502254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:37,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691927741] [2024-11-10 15:28:37,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:28:37,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:37,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:37,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:37,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:28:37,340 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:28:37,341 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:28:37,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:28:37,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:37,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:37,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691927741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:37,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:37,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-10 15:28:37,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501732543] [2024-11-10 15:28:37,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:37,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:28:37,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:37,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:28:37,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:28:37,389 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:37,425 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-11-10 15:28:37,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:37,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-10 15:28:37,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:37,427 INFO L225 Difference]: With dead ends: 72 [2024-11-10 15:28:37,428 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 15:28:37,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:37,429 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 4 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:37,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 175 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 15:28:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 15:28:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-10 15:28:37,434 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 27 [2024-11-10 15:28:37,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:37,434 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-10 15:28:37,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-10 15:28:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:28:37,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:37,439 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:37,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 15:28:37,640 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-11-10 15:28:37,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:37,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:37,641 INFO L85 PathProgramCache]: Analyzing trace with hash 896739067, now seen corresponding path program 1 times [2024-11-10 15:28:37,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:37,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486502282] [2024-11-10 15:28:37,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:37,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:28:37,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:37,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486502282] [2024-11-10 15:28:37,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486502282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:37,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:37,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:37,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613848790] [2024-11-10 15:28:37,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:37,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:37,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:37,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:37,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:37,779 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:37,915 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2024-11-10 15:28:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:37,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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 28 [2024-11-10 15:28:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:37,916 INFO L225 Difference]: With dead ends: 76 [2024-11-10 15:28:37,916 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 15:28:37,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:28:37,917 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 49 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:37,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 208 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:37,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 15:28:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-10 15:28:37,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-11-10 15:28:37,921 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 28 [2024-11-10 15:28:37,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:37,922 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-11-10 15:28:37,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:37,922 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-11-10 15:28:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:28:37,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:37,926 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:37,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:28:37,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:37,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:37,927 INFO L85 PathProgramCache]: Analyzing trace with hash 896739068, now seen corresponding path program 1 times [2024-11-10 15:28:37,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:37,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98849577] [2024-11-10 15:28:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:37,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:38,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:38,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98849577] [2024-11-10 15:28:38,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98849577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:38,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:38,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:38,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454857376] [2024-11-10 15:28:38,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:38,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:38,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:38,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:38,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:38,197 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:38,325 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-11-10 15:28:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:38,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 15:28:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:38,327 INFO L225 Difference]: With dead ends: 76 [2024-11-10 15:28:38,328 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 15:28:38,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:28:38,331 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 46 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:38,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 237 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 15:28:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-10 15:28:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2024-11-10 15:28:38,339 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 28 [2024-11-10 15:28:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:38,339 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2024-11-10 15:28:38,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2024-11-10 15:28:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:28:38,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:38,340 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:38,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:28:38,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:38,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2043251050, now seen corresponding path program 1 times [2024-11-10 15:28:38,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:38,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129140376] [2024-11-10 15:28:38,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:38,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:38,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:38,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129140376] [2024-11-10 15:28:38,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129140376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:38,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:38,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:28:38,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323651714] [2024-11-10 15:28:38,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:38,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:28:38,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:38,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:28:38,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:28:38,420 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:38,436 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2024-11-10 15:28:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:28:38,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-10 15:28:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:38,437 INFO L225 Difference]: With dead ends: 110 [2024-11-10 15:28:38,437 INFO L226 Difference]: Without dead ends: 110 [2024-11-10 15:28:38,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:28:38,438 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 64 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:38,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 140 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-10 15:28:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2024-11-10 15:28:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.323076923076923) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-10 15:28:38,445 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 31 [2024-11-10 15:28:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:38,445 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-10 15:28:38,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,446 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-10 15:28:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:28:38,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:38,447 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:38,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:28:38,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:38,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:38,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1799255965, now seen corresponding path program 1 times [2024-11-10 15:28:38,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:38,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387547362] [2024-11-10 15:28:38,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:38,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:38,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:38,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387547362] [2024-11-10 15:28:38,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387547362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:38,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:38,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:28:38,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4853129] [2024-11-10 15:28:38,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:38,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:28:38,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:38,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:28:38,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:28:38,547 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:38,572 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2024-11-10 15:28:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:28:38,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-10 15:28:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:38,573 INFO L225 Difference]: With dead ends: 100 [2024-11-10 15:28:38,573 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 15:28:38,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:38,575 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:38,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 183 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 15:28:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2024-11-10 15:28:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-10 15:28:38,578 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 32 [2024-11-10 15:28:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:38,578 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-10 15:28:38,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-10 15:28:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 15:28:38,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:38,579 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:38,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:28:38,579 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:38,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash -958025486, now seen corresponding path program 1 times [2024-11-10 15:28:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:38,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283679286] [2024-11-10 15:28:38,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:38,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:28:38,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:38,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283679286] [2024-11-10 15:28:38,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283679286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:38,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:38,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:38,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491951026] [2024-11-10 15:28:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:38,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:38,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:38,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:38,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:38,697 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:38,823 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-10 15:28:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:38,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-10 15:28:38,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:38,824 INFO L225 Difference]: With dead ends: 86 [2024-11-10 15:28:38,824 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 15:28:38,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:28:38,825 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 41 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:38,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 208 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 15:28:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 15:28:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 85 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-11-10 15:28:38,834 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 37 [2024-11-10 15:28:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:38,834 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-11-10 15:28:38,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-11-10 15:28:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 15:28:38,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:38,835 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:38,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:28:38,835 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:38,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash -958025485, now seen corresponding path program 1 times [2024-11-10 15:28:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:38,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617475799] [2024-11-10 15:28:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:38,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:38,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617475799] [2024-11-10 15:28:38,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617475799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:38,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685798525] [2024-11-10 15:28:38,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:38,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:38,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:38,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:38,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:28:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:39,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:28:39,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:39,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:39,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685798525] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:39,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:39,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 15:28:39,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953028557] [2024-11-10 15:28:39,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:39,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:28:39,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:39,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:28:39,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:28:39,205 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-11-10 15:28:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:39,236 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2024-11-10 15:28:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:39,237 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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) Word has length 37 [2024-11-10 15:28:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:39,238 INFO L225 Difference]: With dead ends: 112 [2024-11-10 15:28:39,238 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 15:28:39,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:28:39,239 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 150 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:39,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 222 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 15:28:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2024-11-10 15:28:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 103 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 122 transitions. [2024-11-10 15:28:39,244 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 122 transitions. Word has length 37 [2024-11-10 15:28:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:39,244 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 122 transitions. [2024-11-10 15:28:39,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-11-10 15:28:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 122 transitions. [2024-11-10 15:28:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:28:39,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:39,247 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:39,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:39,451 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,SelfDestructingSolverStorable13 [2024-11-10 15:28:39,452 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1081510081, now seen corresponding path program 1 times [2024-11-10 15:28:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:39,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908968780] [2024-11-10 15:28:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:40,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:40,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908968780] [2024-11-10 15:28:40,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908968780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:40,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580382561] [2024-11-10 15:28:40,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:40,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:40,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:40,248 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:40,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 15:28:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:40,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-10 15:28:40,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:40,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:40,423 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:40,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:28:40,445 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-11-10 15:28:40,471 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-11-10 15:28:40,495 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:28:40,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:28:40,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:40,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-10 15:28:40,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:28:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:40,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:45,478 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-10 15:28:45,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 15:28:45,484 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_758 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_758) |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-11-10 15:28:45,494 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_758 (Array Int Int)) (v_ArrVal_757 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|) v_ArrVal_757)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_758) |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-11-10 15:28:45,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:45,505 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-11-10 15:28:45,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-10 15:28:45,514 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-11-10 15:28:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-11-10 15:28:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580382561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:45,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:45,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 33 [2024-11-10 15:28:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624863820] [2024-11-10 15:28:45,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:45,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-10 15:28:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:45,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-10 15:28:45,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=903, Unknown=3, NotChecked=122, Total=1122 [2024-11-10 15:28:45,585 INFO L87 Difference]: Start difference. First operand 104 states and 122 transitions. Second operand has 34 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:46,581 INFO L93 Difference]: Finished difference Result 171 states and 209 transitions. [2024-11-10 15:28:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:28:46,581 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-10 15:28:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:46,583 INFO L225 Difference]: With dead ends: 171 [2024-11-10 15:28:46,584 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 15:28:46,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=211, Invalid=1600, Unknown=3, NotChecked=166, Total=1980 [2024-11-10 15:28:46,587 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 149 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:46,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1004 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 868 Invalid, 0 Unknown, 156 Unchecked, 0.6s Time] [2024-11-10 15:28:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 15:28:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 116. [2024-11-10 15:28:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 115 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 139 transitions. [2024-11-10 15:28:46,592 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 139 transitions. Word has length 38 [2024-11-10 15:28:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:46,592 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 139 transitions. [2024-11-10 15:28:46,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 139 transitions. [2024-11-10 15:28:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:28:46,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:46,597 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:46,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 15:28:46,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 15:28:46,798 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:46,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1081510082, now seen corresponding path program 1 times [2024-11-10 15:28:46,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:46,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306940346] [2024-11-10 15:28:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:46,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:47,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:47,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306940346] [2024-11-10 15:28:47,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306940346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:47,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318655449] [2024-11-10 15:28:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:47,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:47,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:47,795 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:47,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 15:28:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:47,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-10 15:28:47,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:47,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:47,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:48,074 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:48,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:28:48,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:28:48,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:28:48,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:28:48,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:28:48,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:28:48,262 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:28:48,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-10 15:28:48,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-10 15:28:48,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:48,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-10 15:28:48,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:48,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:28:48,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:28:48,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:28:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:48,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:49,008 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_878 (Array Int Int))) (or (forall ((v_ArrVal_877 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_878) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (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| v_ArrVal_877)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (not (= v_ArrVal_878 (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_878 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_878 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_878) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 1)) (not (= v_ArrVal_878 (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_878 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))))) is different from false [2024-11-10 15:28:49,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:49,443 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 55 treesize of output 61 [2024-11-10 15:28:49,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:49,453 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 40 treesize of output 46 [2024-11-10 15:28:49,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2024-11-10 15:28:49,465 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 96 treesize of output 78 [2024-11-10 15:28:49,473 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 15 treesize of output 11 [2024-11-10 15:28:49,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:28:49,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:49,486 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 33 [2024-11-10 15:28:49,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:49,490 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 22 treesize of output 10 [2024-11-10 15:28:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2024-11-10 15:28:49,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318655449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:49,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:49,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2024-11-10 15:28:49,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720683241] [2024-11-10 15:28:49,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:49,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-10 15:28:49,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:49,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-10 15:28:49,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1355, Unknown=3, NotChecked=74, Total=1560 [2024-11-10 15:28:49,755 INFO L87 Difference]: Start difference. First operand 116 states and 139 transitions. Second operand has 40 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 40 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-11-10 15:28:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:50,725 INFO L93 Difference]: Finished difference Result 183 states and 224 transitions. [2024-11-10 15:28:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:28:50,726 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 40 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 38 [2024-11-10 15:28:50,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:50,727 INFO L225 Difference]: With dead ends: 183 [2024-11-10 15:28:50,727 INFO L226 Difference]: Without dead ends: 183 [2024-11-10 15:28:50,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=248, Invalid=2009, Unknown=3, NotChecked=92, Total=2352 [2024-11-10 15:28:50,728 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 74 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:50,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 970 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 806 Invalid, 0 Unknown, 92 Unchecked, 0.6s Time] [2024-11-10 15:28:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-10 15:28:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 126. [2024-11-10 15:28:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 111 states have (on average 1.3693693693693694) internal successors, (152), 125 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 152 transitions. [2024-11-10 15:28:50,732 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 152 transitions. Word has length 38 [2024-11-10 15:28:50,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:50,732 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 152 transitions. [2024-11-10 15:28:50,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 40 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-11-10 15:28:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 152 transitions. [2024-11-10 15:28:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:28:50,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:50,734 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:50,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:50,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:50,938 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:50,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1634761117, now seen corresponding path program 2 times [2024-11-10 15:28:50,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:50,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735269093] [2024-11-10 15:28:50,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:50,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:51,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735269093] [2024-11-10 15:28:51,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735269093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:51,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928562903] [2024-11-10 15:28:51,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:28:51,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:51,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:51,047 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:51,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 15:28:51,196 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:28:51,196 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:28:51,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:28:51,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:28:51,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:28:51,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928562903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:51,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:51,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-11-10 15:28:51,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104344731] [2024-11-10 15:28:51,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:51,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:51,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:51,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:51,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:51,349 INFO L87 Difference]: Start difference. First operand 126 states and 152 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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-11-10 15:28:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:51,413 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2024-11-10 15:28:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:51,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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) Word has length 42 [2024-11-10 15:28:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:51,414 INFO L225 Difference]: With dead ends: 118 [2024-11-10 15:28:51,414 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 15:28:51,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:28:51,415 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 108 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:51,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 187 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 15:28:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2024-11-10 15:28:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.316326530612245) internal successors, (129), 109 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2024-11-10 15:28:51,420 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 42 [2024-11-10 15:28:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:51,420 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2024-11-10 15:28:51,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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-11-10 15:28:51,421 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2024-11-10 15:28:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 15:28:51,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:51,422 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-11-10 15:28:51,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 15:28:51,622 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,SelfDestructingSolverStorable16 [2024-11-10 15:28:51,623 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:51,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:51,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1266764209, now seen corresponding path program 2 times [2024-11-10 15:28:51,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:51,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626019867] [2024-11-10 15:28:51,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:51,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:51,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:51,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626019867] [2024-11-10 15:28:51,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626019867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:51,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888519010] [2024-11-10 15:28:51,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:28:51,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:51,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:51,707 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:51,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:28:51,862 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:28:51,862 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:28:51,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:28:51,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:51,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:51,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888519010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:51,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:51,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-10 15:28:51,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875358502] [2024-11-10 15:28:51,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:51,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:28:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:51,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:28:51,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:28:51,931 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:51,965 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2024-11-10 15:28:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:51,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 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 43 [2024-11-10 15:28:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:51,967 INFO L225 Difference]: With dead ends: 114 [2024-11-10 15:28:51,968 INFO L226 Difference]: Without dead ends: 114 [2024-11-10 15:28:51,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:51,969 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 69 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:51,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 259 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-10 15:28:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2024-11-10 15:28:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 94 states have (on average 1.297872340425532) internal successors, (122), 105 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2024-11-10 15:28:51,972 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 43 [2024-11-10 15:28:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:51,973 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2024-11-10 15:28:51,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2024-11-10 15:28:51,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 15:28:51,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:51,973 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:51,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:52,174 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,SelfDestructingSolverStorable17 [2024-11-10 15:28:52,174 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:52,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:52,175 INFO L85 PathProgramCache]: Analyzing trace with hash 871165421, now seen corresponding path program 1 times [2024-11-10 15:28:52,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:52,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182506290] [2024-11-10 15:28:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 15:28:52,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:52,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182506290] [2024-11-10 15:28:52,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182506290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:52,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:52,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:52,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109478799] [2024-11-10 15:28:52,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:52,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:52,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:52,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:52,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:52,407 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:52,568 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2024-11-10 15:28:52,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:52,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-10 15:28:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:52,570 INFO L225 Difference]: With dead ends: 106 [2024-11-10 15:28:52,570 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 15:28:52,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:28:52,571 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 32 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:52,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 232 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 15:28:52,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-10 15:28:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2024-11-10 15:28:52,574 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 47 [2024-11-10 15:28:52,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:52,575 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2024-11-10 15:28:52,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:52,575 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2024-11-10 15:28:52,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:28:52,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:52,577 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:52,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:28:52,578 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:52,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:52,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1951853319, now seen corresponding path program 3 times [2024-11-10 15:28:52,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:52,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929402099] [2024-11-10 15:28:52,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:52,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 15:28:52,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:52,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929402099] [2024-11-10 15:28:52,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929402099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:52,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438492523] [2024-11-10 15:28:52,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 15:28:52,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:52,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:52,717 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:52,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:28:52,921 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-10 15:28:52,922 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:28:52,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:28:52,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 15:28:53,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 15:28:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438492523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:53,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:53,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-10 15:28:53,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257073722] [2024-11-10 15:28:53,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:53,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:28:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:53,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:28:53,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:28:53,125 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:53,203 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2024-11-10 15:28:53,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:53,203 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 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 48 [2024-11-10 15:28:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:53,204 INFO L225 Difference]: With dead ends: 106 [2024-11-10 15:28:53,204 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 15:28:53,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:28:53,205 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 97 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:53,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 348 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 15:28:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-10 15:28:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2024-11-10 15:28:53,208 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 48 [2024-11-10 15:28:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:53,208 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2024-11-10 15:28:53,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2024-11-10 15:28:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 15:28:53,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:53,209 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:53,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:53,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:53,414 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:53,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:53,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2023780686, now seen corresponding path program 1 times [2024-11-10 15:28:53,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:53,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307750217] [2024-11-10 15:28:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:28:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:53,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307750217] [2024-11-10 15:28:53,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307750217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:53,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:53,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:28:53,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316187116] [2024-11-10 15:28:53,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:53,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:28:53,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:53,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:28:53,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:28:53,494 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:53,522 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2024-11-10 15:28:53,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:28:53,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-10 15:28:53,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:53,523 INFO L225 Difference]: With dead ends: 96 [2024-11-10 15:28:53,523 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 15:28:53,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:53,525 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 15 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:53,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 170 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 15:28:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-11-10 15:28:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 91 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-10 15:28:53,527 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 51 [2024-11-10 15:28:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:53,528 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-10 15:28:53,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-10 15:28:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 15:28:53,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:53,528 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:53,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 15:28:53,529 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:53,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1891770511, now seen corresponding path program 1 times [2024-11-10 15:28:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006657397] [2024-11-10 15:28:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:53,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:54,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:54,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006657397] [2024-11-10 15:28:54,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006657397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:54,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672699985] [2024-11-10 15:28:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:54,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:54,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:54,592 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:54,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:28:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:54,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-10 15:28:54,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:54,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:54,854 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:54,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:28:54,891 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-11-10 15:28:54,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 15:28:54,956 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:28:54,956 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 31 treesize of output 32 [2024-11-10 15:28:55,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-10 15:28:55,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:28:55,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-10 15:28:55,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:28:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:55,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:55,682 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-10 15:28:55,697 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-10 15:28:55,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1457) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-10 15:28:55,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:55,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2024-11-10 15:28:55,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:55,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 61 [2024-11-10 15:28:55,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-10 15:28:56,118 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (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|) v_ArrVal_1451)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2024-11-10 15:28:56,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:56,129 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 28 treesize of output 34 [2024-11-10 15:28:56,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-10 15:28:56,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-10 15:28:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-10 15:28:56,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672699985] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:56,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:56,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 58 [2024-11-10 15:28:56,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723489320] [2024-11-10 15:28:56,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:56,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-10 15:28:56,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:56,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-10 15:28:56,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2656, Unknown=26, NotChecked=428, Total=3306 [2024-11-10 15:28:56,258 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 58 states, 58 states have (on average 2.413793103448276) internal successors, (140), 58 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:57,542 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2024-11-10 15:28:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 15:28:57,542 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.413793103448276) internal successors, (140), 58 states have internal predecessors, (140), 0 states have call successors, (0), 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 53 [2024-11-10 15:28:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:57,543 INFO L225 Difference]: With dead ends: 98 [2024-11-10 15:28:57,543 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 15:28:57,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=458, Invalid=4788, Unknown=26, NotChecked=580, Total=5852 [2024-11-10 15:28:57,545 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 148 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:57,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1401 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1131 Invalid, 0 Unknown, 295 Unchecked, 0.6s Time] [2024-11-10 15:28:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 15:28:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2024-11-10 15:28:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 91 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2024-11-10 15:28:57,550 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 53 [2024-11-10 15:28:57,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:57,551 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2024-11-10 15:28:57,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.413793103448276) internal successors, (140), 58 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2024-11-10 15:28:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 15:28:57,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:57,551 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:57,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:57,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-10 15:28:57,752 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:57,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 864541747, now seen corresponding path program 1 times [2024-11-10 15:28:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:57,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379145086] [2024-11-10 15:28:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:59,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:59,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379145086] [2024-11-10 15:28:59,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379145086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:59,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987608380] [2024-11-10 15:28:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:59,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:59,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:59,482 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:59,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 15:28:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:59,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-10 15:28:59,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:59,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:59,758 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:59,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:28:59,793 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-11-10 15:28:59,824 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-11-10 15:28:59,837 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:28:59,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:29:00,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:00,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-10 15:29:00,215 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:29:00,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:29:00,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:29:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 15:29:00,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:00,439 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1581 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1581) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1)) is different from false [2024-11-10 15:29:00,517 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1581 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1581) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1)) is different from false [2024-11-10 15:29:00,530 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1581 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1581) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 15:29:00,540 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_ArrVal_1581 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (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| v_ArrVal_1580)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1581)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1)) is different from false [2024-11-10 15:29:00,565 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_1580 Int) (v_ArrVal_1581 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_1580)) (select .cse0 .cse1) v_ArrVal_1581)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1))) is different from false [2024-11-10 15:29:00,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_1580 Int) (v_ArrVal_1581 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_1580)) (select .cse0 .cse1) v_ArrVal_1581)) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1))) 1))) is different from false [2024-11-10 15:29:00,882 INFO L349 Elim1Store]: treesize reduction 5, result has 87.5 percent of original size [2024-11-10 15:29:00,883 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 44 treesize of output 43 [2024-11-10 15:29:00,895 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_1580 Int) (v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1581 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (= (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1578))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_1580)) (select .cse1 .cse2) v_ArrVal_1581))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2024-11-10 15:29:00,913 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_1580 Int) (v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1576 Int) (v_ArrVal_1581 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (let ((.cse0 (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|) v_ArrVal_1576)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| v_ArrVal_1580)) (select .cse0 .cse1) v_ArrVal_1581)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2024-11-10 15:29:00,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:00,929 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 95 treesize of output 70 [2024-11-10 15:29:00,934 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 105 treesize of output 97 [2024-11-10 15:29:00,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:00,940 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 94 treesize of output 78 [2024-11-10 15:29:00,945 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:00,946 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 45 treesize of output 33 [2024-11-10 15:29:00,951 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-11-10 15:29:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 16 not checked. [2024-11-10 15:29:01,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987608380] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:01,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:01,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 19] total 54 [2024-11-10 15:29:01,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35876718] [2024-11-10 15:29:01,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:01,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-10 15:29:01,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:01,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-10 15:29:01,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1980, Unknown=67, NotChecked=776, Total=2970 [2024-11-10 15:29:01,035 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 55 states, 54 states have (on average 2.888888888888889) internal successors, (156), 55 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:02,575 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2024-11-10 15:29:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 15:29:02,575 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.888888888888889) internal successors, (156), 55 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-10 15:29:02,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:02,576 INFO L225 Difference]: With dead ends: 103 [2024-11-10 15:29:02,576 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 15:29:02,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=393, Invalid=3603, Unknown=68, NotChecked=1048, Total=5112 [2024-11-10 15:29:02,577 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 192 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 662 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:02,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1344 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1397 Invalid, 0 Unknown, 662 Unchecked, 0.7s Time] [2024-11-10 15:29:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 15:29:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2024-11-10 15:29:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.197674418604651) internal successors, (103), 96 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2024-11-10 15:29:02,580 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 59 [2024-11-10 15:29:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:02,581 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2024-11-10 15:29:02,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.888888888888889) internal successors, (156), 55 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2024-11-10 15:29:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 15:29:02,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:02,582 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:02,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-10 15:29:02,785 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-11-10 15:29:02,786 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:02,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:02,786 INFO L85 PathProgramCache]: Analyzing trace with hash 864541748, now seen corresponding path program 1 times [2024-11-10 15:29:02,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:02,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927328117] [2024-11-10 15:29:02,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:02,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:29:03,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927328117] [2024-11-10 15:29:03,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927328117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722132428] [2024-11-10 15:29:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:03,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:03,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:03,998 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:03,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 15:29:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:04,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-10 15:29:04,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:04,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:29:04,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:29:04,268 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:29:04,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:29:04,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:29:04,310 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-11-10 15:29:04,315 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-11-10 15:29:04,354 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-11-10 15:29:04,359 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 29 treesize of output 13 [2024-11-10 15:29:04,381 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:29:04,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:29:04,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:29:04,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:04,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:29:04,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:04,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-10 15:29:04,815 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:29:04,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:29:04,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:29:04,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:29:04,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:29:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 15:29:05,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:05,189 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1714 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))))) is different from false [2024-11-10 15:29:05,285 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (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))) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1714) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1713) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1714 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1714) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-10 15:29:05,312 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1714 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1714) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1714) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1713) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))))) is different from false [2024-11-10 15:29:05,364 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1711 (Array Int Int))) (or (not (= v_ArrVal_1711 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1711 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1712 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1711) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1712)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1714) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) (forall ((v_ArrVal_1711 (Array Int Int))) (or (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1712 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1712)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1711) .cse3 v_ArrVal_1714) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1713) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))) (not (= v_ArrVal_1711 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1711 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))))) is different from false [2024-11-10 15:29:05,434 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_61| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|) (forall ((v_ArrVal_1711 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| (select v_ArrVal_1711 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)) v_ArrVal_1711)) (forall ((v_ArrVal_1714 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1711) .cse1 v_ArrVal_1714) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_61| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|) (forall ((v_ArrVal_1711 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| (select v_ArrVal_1711 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)) v_ArrVal_1711)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1712 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1711) .cse1 v_ArrVal_1714) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| v_ArrVal_1712)) .cse1 v_ArrVal_1713) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))))))) is different from false [2024-11-10 15:29:05,493 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse0 (select .cse3 .cse1))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_61| Int)) (or (forall ((v_ArrVal_1711 (Array Int Int))) (or (forall ((v_ArrVal_1714 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1711) .cse0 v_ArrVal_1714) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1))) (not (= v_ArrVal_1711 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| (select v_ArrVal_1711 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_61| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|) (forall ((v_ArrVal_1711 (Array Int Int))) (or (not (= v_ArrVal_1711 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| (select v_ArrVal_1711 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1712 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1711) .cse0 v_ArrVal_1714) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| v_ArrVal_1712)) .cse0 v_ArrVal_1713) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1))))))))))) is different from false [2024-11-10 15:29:05,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_61| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|) (forall ((v_ArrVal_1711 (Array Int Int))) (or (not (= v_ArrVal_1711 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| (select v_ArrVal_1711 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)))) (forall ((v_ArrVal_1714 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1711) .cse1 v_ArrVal_1714) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_61| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|) (forall ((v_ArrVal_1711 (Array Int Int))) (or (not (= v_ArrVal_1711 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| (select v_ArrVal_1711 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1712 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1711) .cse1 v_ArrVal_1714) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| v_ArrVal_1712)) .cse1 v_ArrVal_1713) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))))))))))) is different from false [2024-11-10 15:29:05,622 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_61| Int)) (or (forall ((v_ArrVal_1711 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| (select v_ArrVal_1711 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)) v_ArrVal_1711)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1712 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1711) .cse1 v_ArrVal_1714) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| v_ArrVal_1712)) .cse1 v_ArrVal_1713) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_61| Int)) (or (forall ((v_ArrVal_1711 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| (select v_ArrVal_1711 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)) v_ArrVal_1711)) (forall ((v_ArrVal_1714 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1711) .cse1 v_ArrVal_1714) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)))))) is different from false [2024-11-10 15:29:05,662 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_61| Int) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1709))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| (select v_ArrVal_1711 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)) v_ArrVal_1711)) (forall ((v_ArrVal_1714 (Array Int Int))) (<= 0 (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1711) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1708) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1714) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_61| Int) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1709))) (or (not (= (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| (select v_ArrVal_1711 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)) v_ArrVal_1711)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1712 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1708))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse5 .cse1))) (<= (+ 4 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1711) .cse3 v_ArrVal_1714) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (select |c_#length| (select (select (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| v_ArrVal_1712)) .cse3 v_ArrVal_1713) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)))))))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|))))) is different from false [2024-11-10 15:29:05,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1707 Int) (v_ArrVal_1706 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_61| Int) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (or (forall ((v_ArrVal_1714 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1711) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1706)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1708) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_1714) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (not (= v_ArrVal_1711 (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse1 v_ArrVal_1707)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| (select v_ArrVal_1711 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|))) (forall ((v_ArrVal_1707 Int) (v_ArrVal_1706 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_61| Int) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (or (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1712 Int)) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1706)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1708) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse5 .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1711) .cse4 v_ArrVal_1714) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1708) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| v_ArrVal_1712)) .cse4 v_ArrVal_1713) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))))) (not (= v_ArrVal_1711 (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse1 v_ArrVal_1707)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_61| (select v_ArrVal_1711 |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_61|))))) is different from false [2024-11-10 15:29:05,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:05,776 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 181 treesize of output 126 [2024-11-10 15:29:05,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:05,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 189 treesize of output 194 [2024-11-10 15:29:05,799 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 129 treesize of output 121 [2024-11-10 15:29:05,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:05,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2024-11-10 15:29:05,812 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:05,815 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 103 treesize of output 87 [2024-11-10 15:29:05,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-10 15:29:05,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-10 15:29:05,842 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 111 treesize of output 105 [2024-11-10 15:29:05,847 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:05,849 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 45 treesize of output 41 [2024-11-10 15:29:05,852 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:05,854 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 47 treesize of output 39 [2024-11-10 15:29:05,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:05,870 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 42 treesize of output 48 [2024-11-10 15:29:05,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:05,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:05,886 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 75 treesize of output 80 [2024-11-10 15:29:05,891 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:05,893 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 46 treesize of output 28 [2024-11-10 15:29:05,896 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:05,898 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 22 treesize of output 18 [2024-11-10 15:29:05,903 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:05,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:05,908 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 1 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:29:05,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-10 15:29:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 19 not checked. [2024-11-10 15:29:06,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722132428] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:06,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:06,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 19] total 51 [2024-11-10 15:29:06,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555475599] [2024-11-10 15:29:06,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:06,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-10 15:29:06,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:06,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-10 15:29:06,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1579, Unknown=29, NotChecked=890, Total=2652 [2024-11-10 15:29:06,205 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 52 states, 51 states have (on average 3.215686274509804) internal successors, (164), 52 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:07,534 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2024-11-10 15:29:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:29:07,535 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 3.215686274509804) internal successors, (164), 52 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-10 15:29:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:07,535 INFO L225 Difference]: With dead ends: 103 [2024-11-10 15:29:07,535 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 15:29:07,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=292, Invalid=2581, Unknown=29, NotChecked=1130, Total=4032 [2024-11-10 15:29:07,537 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 105 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 748 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:07,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1193 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 829 Invalid, 0 Unknown, 748 Unchecked, 0.5s Time] [2024-11-10 15:29:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 15:29:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2024-11-10 15:29:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 95 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2024-11-10 15:29:07,539 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 59 [2024-11-10 15:29:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:07,540 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2024-11-10 15:29:07,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.215686274509804) internal successors, (164), 52 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2024-11-10 15:29:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 15:29:07,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:07,541 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:07,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-10 15:29:07,741 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-11-10 15:29:07,741 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:07,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:07,742 INFO L85 PathProgramCache]: Analyzing trace with hash 771106070, now seen corresponding path program 1 times [2024-11-10 15:29:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:07,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390759501] [2024-11-10 15:29:07,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:07,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:29:07,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:07,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390759501] [2024-11-10 15:29:07,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390759501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:07,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197077623] [2024-11-10 15:29:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:07,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:07,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:07,844 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:07,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-10 15:29:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:08,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:29:08,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:29:08,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:29:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197077623] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:08,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:08,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-10 15:29:08,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278352056] [2024-11-10 15:29:08,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:08,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:29:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:08,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:29:08,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:29:08,096 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:08,126 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2024-11-10 15:29:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:29:08,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-10 15:29:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:08,128 INFO L225 Difference]: With dead ends: 96 [2024-11-10 15:29:08,128 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 15:29:08,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:29:08,128 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 41 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:08,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 219 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:29:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 15:29:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 15:29:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.1647058823529413) internal successors, (99), 95 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2024-11-10 15:29:08,131 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 61 [2024-11-10 15:29:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:08,131 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2024-11-10 15:29:08,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2024-11-10 15:29:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 15:29:08,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:08,132 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:08,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-10 15:29:08,332 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-11-10 15:29:08,333 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:08,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash 956097557, now seen corresponding path program 2 times [2024-11-10 15:29:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:08,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820206754] [2024-11-10 15:29:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:29:08,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:08,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820206754] [2024-11-10 15:29:08,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820206754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:08,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973381204] [2024-11-10 15:29:08,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:29:08,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:08,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:08,428 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:08,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 15:29:08,635 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:29:08,635 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:29:08,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:29:08,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 15:29:08,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 15:29:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973381204] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:08,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:08,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-11-10 15:29:08,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377799598] [2024-11-10 15:29:08,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:08,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:29:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:08,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:29:08,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:29:08,791 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:08,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:08,840 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2024-11-10 15:29:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:29:08,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-10 15:29:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:08,841 INFO L225 Difference]: With dead ends: 86 [2024-11-10 15:29:08,841 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 15:29:08,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:29:08,841 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 33 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:08,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 250 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:29:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 15:29:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 15:29:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 85 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2024-11-10 15:29:08,843 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 63 [2024-11-10 15:29:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:08,844 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2024-11-10 15:29:08,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:08,844 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2024-11-10 15:29:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 15:29:08,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:08,844 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:08,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-10 15:29:09,045 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-11-10 15:29:09,045 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:09,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:09,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1438073736, now seen corresponding path program 1 times [2024-11-10 15:29:09,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:09,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130650703] [2024-11-10 15:29:09,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:09,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:29:10,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:10,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130650703] [2024-11-10 15:29:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130650703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:10,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520282318] [2024-11-10 15:29:10,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:10,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:10,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:10,823 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:10,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-10 15:29:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:11,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-10 15:29:11,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:11,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:29:11,206 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:29:11,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:29:11,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:29:11,261 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-11-10 15:29:11,304 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-11-10 15:29:11,308 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 29 treesize of output 13 [2024-11-10 15:29:11,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:29:11,325 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-11-10 15:29:11,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:29:11,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:11,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-10 15:29:11,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:11,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:29:12,062 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:29:12,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2024-11-10 15:29:12,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-11-10 15:29:12,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-10 15:29:12,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-10 15:29:12,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-10 15:29:12,709 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:12,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:12,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2024-11-10 15:29:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:29:12,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:13,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2024-11-10 15:29:13,602 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_2077 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)))) (and (or .cse0 (< |c_ULTIMATE.start_dll_update_at_~head#1.offset| 1)) (or .cse0 (forall ((v_ArrVal_2076 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2076) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (< .cse2 0) (< .cse2 (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 1))))) (or .cse0 (= |c_ULTIMATE.start_dll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)))))) is different from false [2024-11-10 15:29:13,669 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (forall ((v_ArrVal_2077 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)))) (and (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (< .cse0 0) (< .cse0 (+ |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset| 1))))) (or (< |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset| 1) .cse2) (or .cse2 (= |c_ULTIMATE.start_dll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (or .cse2 (forall ((v_ArrVal_2076 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2076) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))))) is different from false [2024-11-10 15:29:14,363 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2075 (Array Int Int))) (or (forall ((v_ArrVal_2073 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2073)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (forall ((v_ArrVal_2076 (Array Int Int))) (= (select (select (store .cse0 .cse1 v_ArrVal_2076) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)) (forall ((v_ArrVal_2077 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2075) .cse1 v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))))) (not (= (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2075 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2075)))) (forall ((v_ArrVal_2075 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2075))) (or (< (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1) (not (= (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2075 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2075)) (forall ((v_ArrVal_2073 Int) (v_ArrVal_2077 (Array Int Int))) (< (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2073)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))))) (forall ((v_ArrVal_2075 (Array Int Int))) (or (not (= (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2075 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2075)) (forall ((v_ArrVal_2073 Int) (v_ArrVal_2077 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2075))) (let ((.cse6 (select (select (store .cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2073)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse6 (+ (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1)) (< .cse6 0))))))) (or (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_2073 Int) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2075 (Array Int Int))) (or (not (= (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2075 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2075)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2075) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2073)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))))) is different from false [2024-11-10 15:29:14,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select .cse4 .cse1))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2075 (Array Int Int))) (or (forall ((v_ArrVal_2077 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2075) .cse0 v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)) (not (= v_ArrVal_2075 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (< (select v_ArrVal_2075 .cse1) 1))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2075 (Array Int Int))) (or (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2075) .cse0 v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (< .cse3 (+ (select v_ArrVal_2075 .cse1) 1)) (< .cse3 0)))) (not (= v_ArrVal_2075 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))))))) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2075 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (not (= v_ArrVal_2075 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2075) .cse0 v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2075 (Array Int Int))) (or (not (= v_ArrVal_2075 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (forall ((v_ArrVal_2073 Int)) (or (forall ((v_ArrVal_2076 (Array Int Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| v_ArrVal_2073)) .cse0 v_ArrVal_2076) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_2077 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2075) .cse0 v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0))))))))))) is different from false [2024-11-10 15:29:14,618 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select .cse4 .cse1))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2075 (Array Int Int))) (or (forall ((v_ArrVal_2077 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2075) .cse0 v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)) (not (= v_ArrVal_2075 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (< (select v_ArrVal_2075 .cse1) 1))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2075 (Array Int Int))) (or (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2075) .cse0 v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (< .cse3 (+ (select v_ArrVal_2075 .cse1) 1)) (< .cse3 0)))) (not (= v_ArrVal_2075 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))))))) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2075 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (not (= v_ArrVal_2075 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2075) .cse0 v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2075 (Array Int Int))) (or (not (= v_ArrVal_2075 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2075) .cse0 v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_2073 Int) (v_ArrVal_2076 (Array Int Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| v_ArrVal_2073)) .cse0 v_ArrVal_2076) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))))) is different from false [2024-11-10 15:29:14,676 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse1 (select .cse4 .cse2))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2075 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2075)) (forall ((v_ArrVal_2077 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2075) .cse1 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2) 0)) (< (select v_ArrVal_2075 .cse2) 1))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2075 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2075)) (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2075) .cse1 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2))) (or (< .cse3 0) (< .cse3 (+ (select v_ArrVal_2075 .cse2) 1))))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2073 Int) (v_ArrVal_2076 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| v_ArrVal_2073)) .cse1 v_ArrVal_2076) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2) .cse1)) (forall ((v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2075 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2075)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2075) .cse1 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2) 0))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))))) is different from false [2024-11-10 15:29:14,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (select .cse4 .cse2))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2075 (Array Int Int))) (or (not (= v_ArrVal_2075 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2075) .cse3 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (or (< .cse1 0) (< .cse1 (+ (select v_ArrVal_2075 .cse2) 1))))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2075 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2075) .cse3 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2) 0) (not (= v_ArrVal_2075 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))))) (forall ((v_ArrVal_2073 Int) (v_ArrVal_2076 (Array Int Int))) (= .cse3 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| v_ArrVal_2073)) .cse3 v_ArrVal_2076) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2075 (Array Int Int))) (or (< (select v_ArrVal_2075 .cse2) 1) (not (= v_ArrVal_2075 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (forall ((v_ArrVal_2077 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2075) .cse3 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2) 0))))))))) is different from false [2024-11-10 15:29:14,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (select .cse4 .cse2))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2075 (Array Int Int))) (or (not (= v_ArrVal_2075 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2075) .cse3 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (or (< .cse1 (+ (select v_ArrVal_2075 .cse2) 1)) (< .cse1 0)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2075 (Array Int Int))) (or (forall ((v_ArrVal_2077 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2075) .cse3 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 0)) (not (= v_ArrVal_2075 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (< (select v_ArrVal_2075 .cse2) 1))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2075 (Array Int Int))) (or (not (= v_ArrVal_2075 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2075) .cse3 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 0))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2073 Int) (v_ArrVal_2076 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| v_ArrVal_2073)) .cse3 v_ArrVal_2076) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) .cse3))))))) is different from false [2024-11-10 15:29:14,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2071 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2075 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2072))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2075)) (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2075) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2071) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (or (< .cse1 0) (< .cse1 (+ (select v_ArrVal_2075 .cse2) 1)))))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))) (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2071 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2071))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse5 .cse2))) (or (forall ((v_ArrVal_2073 Int) (v_ArrVal_2076 (Array Int Int))) (= .cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| v_ArrVal_2073)) .cse3 v_ArrVal_2076) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (forall ((v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2075 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2072))) (or (< (select (select (store (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2075) .cse3 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 0) (not (= (store (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2075))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))))) (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2071 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2075 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2072))) (or (not (= (store (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2075)) (forall ((v_ArrVal_2077 (Array Int Int))) (< (select (select (store (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2075) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2071) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 0)) (< (select v_ArrVal_2075 .cse2) 1)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))))) is different from false [2024-11-10 15:29:15,037 WARN L851 $PredicateComparison]: unable to prove that (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)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2071 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2067 Int) (v_ArrVal_2068 Int)) (or (forall ((v_ArrVal_2075 (Array Int Int))) (or (not (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2068)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2072) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2075)) (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2072) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2075) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse1 v_ArrVal_2067)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2071) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (or (< .cse2 0) (< .cse2 (+ (select v_ArrVal_2075 .cse3) 1))))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))) (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2071 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2067 Int) (v_ArrVal_2068 Int)) (or (forall ((v_ArrVal_2075 (Array Int Int))) (or (not (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2068)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2072) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2075)) (forall ((v_ArrVal_2077 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2072) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2075) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse1 v_ArrVal_2067)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2071) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) 0)) (< (select v_ArrVal_2075 .cse3) 1))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))) (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2071 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2067 Int) (v_ArrVal_2068 Int)) (let ((.cse6 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse1 v_ArrVal_2067)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2071) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse5 (select .cse6 .cse3))) (or (forall ((v_ArrVal_2073 Int) (v_ArrVal_2076 (Array Int Int))) (= .cse5 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2071) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse6 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| v_ArrVal_2073)) .cse5 v_ArrVal_2076) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (forall ((v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2075 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2072) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2075) .cse5 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) 0) (not (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2068)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2072) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2075 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2075)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))))))) is different from false [2024-11-10 15:29:15,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:15,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 423 treesize of output 376 [2024-11-10 15:29:15,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:15,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 336 treesize of output 379 [2024-11-10 15:29:15,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 350 treesize of output 325 [2024-11-10 15:29:15,177 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 322 treesize of output 294 [2024-11-10 15:29:15,197 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 220 treesize of output 196 [2024-11-10 15:29:15,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 177 [2024-11-10 15:29:15,228 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 221 treesize of output 213 [2024-11-10 15:29:15,246 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 200 treesize of output 188 [2024-11-10 15:29:15,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:15,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 158 [2024-11-10 15:29:15,268 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 149 treesize of output 145 [2024-11-10 15:29:15,276 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 154 treesize of output 146 [2024-11-10 15:29:15,283 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 131 treesize of output 127 [2024-11-10 15:29:15,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:15,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 131 [2024-11-10 15:29:15,318 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-10 15:29:15,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 149 [2024-11-10 15:29:15,329 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 117 treesize of output 113 [2024-11-10 15:29:15,336 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 113 treesize of output 109 [2024-11-10 15:29:15,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:15,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 113 [2024-11-10 15:29:15,358 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 104 treesize of output 96 [2024-11-10 15:29:15,368 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 96 treesize of output 92 [2024-11-10 15:29:15,379 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 39 treesize of output 27 [2024-11-10 15:29:15,395 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 27 treesize of output 19 [2024-11-10 15:29:15,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-10 15:29:15,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-10 15:29:15,498 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 33 treesize of output 25 [2024-11-10 15:29:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-11-10 15:29:15,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520282318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:15,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:15,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 27] total 75 [2024-11-10 15:29:15,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42378732] [2024-11-10 15:29:15,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:15,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-11-10 15:29:15,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:15,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-11-10 15:29:15,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3922, Unknown=75, NotChecked=1350, Total=5550 [2024-11-10 15:29:15,706 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 75 states, 75 states have (on average 2.4266666666666667) internal successors, (182), 75 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:18,838 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2024-11-10 15:29:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 15:29:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 2.4266666666666667) internal successors, (182), 75 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-10 15:29:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:18,839 INFO L225 Difference]: With dead ends: 88 [2024-11-10 15:29:18,839 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 15:29:18,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=521, Invalid=7447, Unknown=82, NotChecked=1850, Total=9900 [2024-11-10 15:29:18,841 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 151 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 694 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:18,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1993 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1966 Invalid, 0 Unknown, 694 Unchecked, 1.0s Time] [2024-11-10 15:29:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 15:29:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2024-11-10 15:29:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 81 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2024-11-10 15:29:18,843 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 65 [2024-11-10 15:29:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:18,844 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2024-11-10 15:29:18,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 2.4266666666666667) internal successors, (182), 75 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2024-11-10 15:29:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 15:29:18,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:18,844 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:18,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-10 15:29:19,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 15:29:19,045 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:19,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:19,045 INFO L85 PathProgramCache]: Analyzing trace with hash -606278290, now seen corresponding path program 1 times [2024-11-10 15:29:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:19,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111947102] [2024-11-10 15:29:19,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:19,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 15:29:19,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:19,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111947102] [2024-11-10 15:29:19,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111947102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:29:19,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:29:19,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:29:19,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096277902] [2024-11-10 15:29:19,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:29:19,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:29:19,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:19,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:29:19,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:29:19,157 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:19,268 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-10 15:29:19,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:29:19,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-10 15:29:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:19,269 INFO L225 Difference]: With dead ends: 84 [2024-11-10 15:29:19,269 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 15:29:19,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:29:19,270 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:19,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 142 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:29:19,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 15:29:19,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 15:29:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 83 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2024-11-10 15:29:19,275 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 68 [2024-11-10 15:29:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:19,275 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2024-11-10 15:29:19,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2024-11-10 15:29:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 15:29:19,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:19,276 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:19,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 15:29:19,276 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:19,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:19,277 INFO L85 PathProgramCache]: Analyzing trace with hash -606278289, now seen corresponding path program 1 times [2024-11-10 15:29:19,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:19,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67426954] [2024-11-10 15:29:19,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:19,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-10 15:29:19,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:19,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67426954] [2024-11-10 15:29:19,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67426954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:29:19,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:29:19,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:29:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15203761] [2024-11-10 15:29:19,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:29:19,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:29:19,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:19,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:29:19,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:29:19,484 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:19,599 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2024-11-10 15:29:19,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:29:19,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-10 15:29:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:19,600 INFO L225 Difference]: With dead ends: 86 [2024-11-10 15:29:19,600 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 15:29:19,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:29:19,601 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:19,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 169 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:29:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 15:29:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 15:29:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 85 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2024-11-10 15:29:19,602 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 68 [2024-11-10 15:29:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:19,603 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2024-11-10 15:29:19,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2024-11-10 15:29:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 15:29:19,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:19,604 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:19,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 15:29:19,604 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:19,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1482076388, now seen corresponding path program 1 times [2024-11-10 15:29:19,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:19,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375797268] [2024-11-10 15:29:19,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-10 15:29:19,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:19,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375797268] [2024-11-10 15:29:19,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375797268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:29:19,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:29:19,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:29:19,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050644931] [2024-11-10 15:29:19,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:29:19,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:29:19,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:19,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:29:19,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:29:19,710 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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-11-10 15:29:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:19,793 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2024-11-10 15:29:19,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:29:19,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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) Word has length 70 [2024-11-10 15:29:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:19,794 INFO L225 Difference]: With dead ends: 89 [2024-11-10 15:29:19,794 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 15:29:19,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:29:19,794 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:19,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 198 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:29:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 15:29:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-10 15:29:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0740740740740742) internal successors, (87), 85 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2024-11-10 15:29:19,796 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 70 [2024-11-10 15:29:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:19,797 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2024-11-10 15:29:19,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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-11-10 15:29:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2024-11-10 15:29:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 15:29:19,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:19,797 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:19,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 15:29:19,798 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:19,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1299063734, now seen corresponding path program 1 times [2024-11-10 15:29:19,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:19,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192443085] [2024-11-10 15:29:19,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:19,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-10 15:29:19,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:19,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192443085] [2024-11-10 15:29:19,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192443085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:29:19,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:29:19,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:29:19,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695599281] [2024-11-10 15:29:19,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:29:19,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:29:19,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:19,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:29:19,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:29:19,918 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 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-11-10 15:29:20,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:20,017 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2024-11-10 15:29:20,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:29:20,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 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) Word has length 71 [2024-11-10 15:29:20,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:20,018 INFO L225 Difference]: With dead ends: 87 [2024-11-10 15:29:20,018 INFO L226 Difference]: Without dead ends: 87 [2024-11-10 15:29:20,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:29:20,019 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:20,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 186 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:29:20,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-10 15:29:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-10 15:29:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 86 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2024-11-10 15:29:20,021 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 71 [2024-11-10 15:29:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:20,021 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2024-11-10 15:29:20,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 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-11-10 15:29:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2024-11-10 15:29:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 15:29:20,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:20,022 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:20,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 15:29:20,022 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:20,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:20,023 INFO L85 PathProgramCache]: Analyzing trace with hash 667893491, now seen corresponding path program 1 times [2024-11-10 15:29:20,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:20,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311783048] [2024-11-10 15:29:20,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:20,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:29:21,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:21,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311783048] [2024-11-10 15:29:21,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311783048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:21,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037324334] [2024-11-10 15:29:21,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:21,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:21,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:21,835 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:21,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-10 15:29:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:22,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-10 15:29:22,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:22,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:29:22,127 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:29:22,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:29:22,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:29:22,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:22,206 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:29:22,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:29:22,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:22,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-10 15:29:22,496 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:29:22,496 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 29 treesize of output 30 [2024-11-10 15:29:22,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:22,603 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 22 treesize of output 20 [2024-11-10 15:29:22,706 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-10 15:29:22,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:29:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 15:29:22,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:22,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2437 (Array Int Int))) (= (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_#t~mem10#1.base| v_ArrVal_2437) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) is different from false [2024-11-10 15:29:23,052 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (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| v_ArrVal_2436)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2437)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) is different from false [2024-11-10 15:29:23,068 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2437 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_81| Int) (v_ArrVal_2436 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_81|) (= 1 (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_81| v_ArrVal_2436))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2437)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2024-11-10 15:29:23,183 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2437 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_81| Int) (v_ArrVal_2436 Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_81| v_ArrVal_2436))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2437)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_81|))) is different from false [2024-11-10 15:29:23,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:23,405 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 83 treesize of output 87 [2024-11-10 15:29:23,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_81| Int)) (or (forall ((v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2436 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2434))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_81| v_ArrVal_2436)) (select .cse1 .cse2) v_ArrVal_2437))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_81|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_81| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_81|) (forall ((v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2436 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2434))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_81| v_ArrVal_2436)) (select .cse4 .cse2) v_ArrVal_2437))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))))) is different from false [2024-11-10 15:29:23,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_81| Int) (v_ArrVal_2432 Int)) (or (forall ((v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2436 Int)) (= (select (select (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_2432)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2434) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2434) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_81| v_ArrVal_2436)) (select .cse0 .cse1) v_ArrVal_2437)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_81|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_81| Int) (v_ArrVal_2432 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_81|) (forall ((v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2436 Int)) (not (= (select (select (let ((.cse4 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_2432)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2434) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2434) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_81| v_ArrVal_2436)) (select .cse4 .cse1) v_ArrVal_2437)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) is different from false [2024-11-10 15:29:23,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:23,490 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 91 treesize of output 66 [2024-11-10 15:29:23,493 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 99 treesize of output 91 [2024-11-10 15:29:23,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:23,504 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 101 treesize of output 95 [2024-11-10 15:29:23,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:23,517 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 75 treesize of output 73 [2024-11-10 15:29:23,522 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 12 treesize of output 10 [2024-11-10 15:29:23,579 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:23,586 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-10 15:29:23,586 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 77 treesize of output 1 [2024-11-10 15:29:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2024-11-10 15:29:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037324334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:23,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19, 21] total 61 [2024-11-10 15:29:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061246295] [2024-11-10 15:29:23,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-10 15:29:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-10 15:29:23,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2810, Unknown=100, NotChecked=678, Total=3782 [2024-11-10 15:29:23,659 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 62 states, 61 states have (on average 2.7704918032786887) internal successors, (169), 62 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:25,604 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2024-11-10 15:29:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 15:29:25,604 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.7704918032786887) internal successors, (169), 62 states have internal predecessors, (169), 0 states have call successors, (0), 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 76 [2024-11-10 15:29:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:25,605 INFO L225 Difference]: With dead ends: 98 [2024-11-10 15:29:25,605 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 15:29:25,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=434, Invalid=4888, Unknown=104, NotChecked=894, Total=6320 [2024-11-10 15:29:25,606 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 111 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 543 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:25,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1025 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1988 Invalid, 0 Unknown, 543 Unchecked, 1.0s Time] [2024-11-10 15:29:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 15:29:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2024-11-10 15:29:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.0919540229885059) internal successors, (95), 91 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2024-11-10 15:29:25,608 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 76 [2024-11-10 15:29:25,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:25,609 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2024-11-10 15:29:25,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.7704918032786887) internal successors, (169), 62 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2024-11-10 15:29:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 15:29:25,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:25,610 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:25,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-10 15:29:25,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:25,811 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:25,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash 667893492, now seen corresponding path program 1 times [2024-11-10 15:29:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:25,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614813468] [2024-11-10 15:29:25,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:29:28,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:28,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614813468] [2024-11-10 15:29:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614813468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:28,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087554497] [2024-11-10 15:29:28,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:28,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:28,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:28,034 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:28,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-10 15:29:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:28,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-10 15:29:28,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:28,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:29:28,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:29:28,355 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:29:28,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:29:28,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:29:28,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:29:28,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:29:28,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:28,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:28,464 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:29:28,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-10 15:29:28,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-10 15:29:28,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:28,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:28,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:28,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-10 15:29:28,834 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:29:28,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-10 15:29:28,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-10 15:29:29,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:29,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-10 15:29:29,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:29,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-10 15:29:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 15:29:29,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:29,454 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2573) |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_2572) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2573 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2573) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2024-11-10 15:29:29,472 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2573 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2573) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2573) |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_#t~mem10#1.base| v_ArrVal_2572) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2024-11-10 15:29:29,478 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (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)))) (and (forall ((v_ArrVal_2573 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2573) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2573) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2572) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) is different from false [2024-11-10 15:29:29,491 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_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2573) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2572) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2573 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2573) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))))) is different from false [2024-11-10 15:29:29,520 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2570 (Array Int Int))) (or (forall ((v_ArrVal_2571 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2571)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2570) .cse0 v_ArrVal_2573) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2572) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (not (= v_ArrVal_2570 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2570 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_2570 (Array Int Int))) (or (forall ((v_ArrVal_2571 Int) (v_ArrVal_2573 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2570) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2571)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_2573) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (not (= v_ArrVal_2570 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2570 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))))) is different from false [2024-11-10 15:29:29,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_88| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|) (forall ((v_ArrVal_2570 (Array Int Int))) (or (forall ((v_ArrVal_2573 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2570) .cse0 v_ArrVal_2573) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (not (= (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| (select v_ArrVal_2570 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)) v_ArrVal_2570)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_88| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|) (forall ((v_ArrVal_2570 (Array Int Int))) (or (forall ((v_ArrVal_2571 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2570) .cse0 v_ArrVal_2573) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| v_ArrVal_2571)) .cse0 v_ArrVal_2572) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (not (= (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| (select v_ArrVal_2570 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)) v_ArrVal_2570))))))))) is different from false [2024-11-10 15:29:29,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse0 (select .cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_88| Int)) (or (forall ((v_ArrVal_2570 (Array Int Int))) (or (forall ((v_ArrVal_2573 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2570) .cse0 v_ArrVal_2573) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))) (not (= v_ArrVal_2570 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| (select v_ArrVal_2570 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_88| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|) (forall ((v_ArrVal_2570 (Array Int Int))) (or (forall ((v_ArrVal_2571 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2570) .cse0 v_ArrVal_2573) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| v_ArrVal_2571)) .cse0 v_ArrVal_2572) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))) (not (= v_ArrVal_2570 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| (select v_ArrVal_2570 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|))))))))))) is different from false [2024-11-10 15:29:29,653 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_88| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|) (forall ((v_ArrVal_2570 (Array Int Int))) (or (forall ((v_ArrVal_2573 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2570) .cse0 v_ArrVal_2573) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 4))) (not (= (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| (select v_ArrVal_2570 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)) v_ArrVal_2570)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_88| Int)) (or (forall ((v_ArrVal_2570 (Array Int Int))) (or (forall ((v_ArrVal_2571 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2570) .cse0 v_ArrVal_2573) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| v_ArrVal_2571)) .cse0 v_ArrVal_2572) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))) (not (= (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| (select v_ArrVal_2570 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)) v_ArrVal_2570)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)))))) is different from false [2024-11-10 15:29:29,707 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_88| Int)) (or (forall ((v_ArrVal_2570 (Array Int Int))) (or (forall ((v_ArrVal_2571 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2570) .cse0 v_ArrVal_2573) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| v_ArrVal_2571)) .cse0 v_ArrVal_2572) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (not (= (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| (select v_ArrVal_2570 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)) v_ArrVal_2570)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_88| Int)) (or (forall ((v_ArrVal_2570 (Array Int Int))) (or (not (= (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| (select v_ArrVal_2570 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)) v_ArrVal_2570)) (forall ((v_ArrVal_2573 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2570) .cse0 v_ArrVal_2573) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)))))) is different from false [2024-11-10 15:29:29,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2567 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_88| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|) (forall ((v_ArrVal_2570 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2568))) (or (forall ((v_ArrVal_2573 (Array Int Int))) (<= 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2570) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2567) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_2573) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| (select v_ArrVal_2570 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)) v_ArrVal_2570))))))) (forall ((v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2567 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_88| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|) (forall ((v_ArrVal_2570 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2568))) (or (forall ((v_ArrVal_2571 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2567))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse5 .cse1))) (<= (+ (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2570) .cse3 v_ArrVal_2573) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| v_ArrVal_2571)) .cse3 v_ArrVal_2572) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))))) (not (= (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| (select v_ArrVal_2570 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)) v_ArrVal_2570))))))))) is different from false [2024-11-10 15:29:29,785 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2567 (Array Int Int)) (v_ArrVal_2566 Int) (v_ArrVal_2565 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_88| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|) (forall ((v_ArrVal_2570 (Array Int Int))) (or (forall ((v_ArrVal_2573 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2568) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2570) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2565)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2567) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_2573) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) (not (= v_ArrVal_2570 (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse1 v_ArrVal_2566)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2568) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| (select v_ArrVal_2570 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)))))))) (forall ((v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2567 (Array Int Int)) (v_ArrVal_2566 Int) (v_ArrVal_2565 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_88| Int)) (or (forall ((v_ArrVal_2570 (Array Int Int))) (or (forall ((v_ArrVal_2571 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2565)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2567) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse5 .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2568) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2570) .cse4 v_ArrVal_2573) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2567) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| v_ArrVal_2571)) .cse4 v_ArrVal_2572) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (not (= v_ArrVal_2570 (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse1 v_ArrVal_2566)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2568) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_88| (select v_ArrVal_2570 |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_88|))))) is different from false [2024-11-10 15:29:29,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:29,809 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 42 treesize of output 48 [2024-11-10 15:29:29,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:29,821 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 71 treesize of output 76 [2024-11-10 15:29:29,828 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 80 treesize of output 62 [2024-11-10 15:29:29,834 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 41 treesize of output 37 [2024-11-10 15:29:29,839 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:29,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:29,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2024-11-10 15:29:29,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:29,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2024-11-10 15:29:29,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2024-11-10 15:29:29,866 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 12 [2024-11-10 15:29:29,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-10 15:29:29,901 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:29:29,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 15:29:29,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:29,918 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 23 [2024-11-10 15:29:29,929 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:29,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:29,940 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 189 treesize of output 194 [2024-11-10 15:29:29,944 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:29,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:29,953 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 220 treesize of output 148 [2024-11-10 15:29:29,958 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:29,960 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 53 treesize of output 45 [2024-11-10 15:29:29,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:29,966 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 20 treesize of output 16 [2024-11-10 15:29:29,970 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:29,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2024-11-10 15:29:29,981 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:30,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-10 15:29:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 19 not checked. [2024-11-10 15:29:30,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087554497] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:30,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:30,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 19, 21] total 68 [2024-11-10 15:29:30,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417231328] [2024-11-10 15:29:30,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:30,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-11-10 15:29:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-11-10 15:29:30,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3093, Unknown=11, NotChecked=1342, Total=4692 [2024-11-10 15:29:30,231 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 69 states, 68 states have (on average 2.8823529411764706) internal successors, (196), 69 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:32,819 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2024-11-10 15:29:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-10 15:29:32,819 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 2.8823529411764706) internal successors, (196), 69 states have internal predecessors, (196), 0 states have call successors, (0), 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 76 [2024-11-10 15:29:32,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:32,820 INFO L225 Difference]: With dead ends: 100 [2024-11-10 15:29:32,820 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 15:29:32,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=557, Invalid=6118, Unknown=11, NotChecked=1870, Total=8556 [2024-11-10 15:29:32,821 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 103 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 3006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 951 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:32,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1325 Invalid, 3006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2030 Invalid, 0 Unknown, 951 Unchecked, 1.0s Time] [2024-11-10 15:29:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 15:29:32,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2024-11-10 15:29:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0786516853932584) internal successors, (96), 93 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2024-11-10 15:29:32,823 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 76 [2024-11-10 15:29:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:32,823 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2024-11-10 15:29:32,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 2.8823529411764706) internal successors, (196), 69 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:32,824 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2024-11-10 15:29:32,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 15:29:32,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:32,824 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:32,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-10 15:29:33,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:33,025 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:33,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1895478569, now seen corresponding path program 1 times [2024-11-10 15:29:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:33,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842187918] [2024-11-10 15:29:33,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:33,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:29:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842187918] [2024-11-10 15:29:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842187918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147229034] [2024-11-10 15:29:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:33,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:33,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:33,921 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:33,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-10 15:29:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:34,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-10 15:29:34,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:34,181 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-10 15:29:34,181 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 18 [2024-11-10 15:29:34,291 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-11-10 15:29:34,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 32 [2024-11-10 15:29:34,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:29:34,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:34,475 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:29:34,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:29:34,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:34,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-10 15:29:34,875 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:29:34,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:29:34,882 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:29:34,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2024-11-10 15:29:35,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:35,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2024-11-10 15:29:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 15:29:35,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:35,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:35,970 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 124 treesize of output 84 [2024-11-10 15:29:35,974 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 135 treesize of output 125 [2024-11-10 15:29:35,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:35,983 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 128 treesize of output 122 [2024-11-10 15:29:35,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:35,992 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 133 treesize of output 123 [2024-11-10 15:29:35,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2024-11-10 15:29:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 22 refuted. 2 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 15:29:36,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147229034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:36,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:36,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 24] total 59 [2024-11-10 15:29:36,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26516891] [2024-11-10 15:29:36,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:36,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-10 15:29:36,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:36,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-10 15:29:36,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3169, Unknown=21, NotChecked=0, Total=3422 [2024-11-10 15:29:36,399 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand has 59 states, 59 states have (on average 3.1016949152542375) internal successors, (183), 59 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:38,224 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2024-11-10 15:29:38,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 15:29:38,224 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 3.1016949152542375) internal successors, (183), 59 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-10 15:29:38,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:38,225 INFO L225 Difference]: With dead ends: 100 [2024-11-10 15:29:38,225 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 15:29:38,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=566, Invalid=6380, Unknown=26, NotChecked=0, Total=6972 [2024-11-10 15:29:38,226 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 213 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:38,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 773 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1191 Invalid, 3 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:29:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 15:29:38,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2024-11-10 15:29:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 93 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2024-11-10 15:29:38,228 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 78 [2024-11-10 15:29:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:38,228 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2024-11-10 15:29:38,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 3.1016949152542375) internal successors, (183), 59 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2024-11-10 15:29:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 15:29:38,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:38,230 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:38,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-10 15:29:38,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:38,430 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:38,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1368498011, now seen corresponding path program 1 times [2024-11-10 15:29:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:38,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92482391] [2024-11-10 15:29:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 15:29:39,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:39,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92482391] [2024-11-10 15:29:39,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92482391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:39,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174434442] [2024-11-10 15:29:39,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:39,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:39,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:39,532 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:39,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-10 15:29:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:39,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-10 15:29:39,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:39,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:29:39,845 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:29:39,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:29:39,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:29:39,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:39,949 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:29:39,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:29:40,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:40,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-10 15:29:40,382 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:29:40,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 34 treesize of output 33 [2024-11-10 15:29:40,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:40,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-10 15:29:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 15:29:40,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:40,802 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2826 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2826) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-10 15:29:40,810 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2826 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2826) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-10 15:29:40,815 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2826 (Array Int Int))) (< (select (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_2826) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-10 15:29:40,822 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2826 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2826) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-10 15:29:40,911 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_102| Int) (v_ArrVal_2824 Int) (v_ArrVal_2826 (Array Int Int))) (or (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_102| v_ArrVal_2824)) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2826)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_102|))) is different from false [2024-11-10 15:29:41,012 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_102| Int) (v_ArrVal_2824 Int) (v_ArrVal_2826 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_102|) (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_102| v_ArrVal_2824)) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2826)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-10 15:29:41,108 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2823 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_102| Int) (v_ArrVal_2824 Int) (v_ArrVal_2826 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_102|) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2823))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_102| v_ArrVal_2824)) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2826))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-10 15:29:41,123 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2823 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_102| Int) (v_ArrVal_2821 Int) (v_ArrVal_2824 Int) (v_ArrVal_2826 (Array Int Int))) (or (< (select (select (let ((.cse0 (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|) v_ArrVal_2821)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2823) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2823) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_102| v_ArrVal_2824)) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2826)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_102|))) is different from false [2024-11-10 15:29:41,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:41,131 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 91 treesize of output 66 [2024-11-10 15:29:41,134 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 105 treesize of output 97 [2024-11-10 15:29:41,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:41,143 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 109 treesize of output 103 [2024-11-10 15:29:41,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:41,152 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 85 treesize of output 83 [2024-11-10 15:29:41,156 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 12 [2024-11-10 15:29:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 18 not checked. [2024-11-10 15:29:41,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174434442] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:41,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:41,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 52 [2024-11-10 15:29:41,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955166290] [2024-11-10 15:29:41,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:41,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-10 15:29:41,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:41,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-10 15:29:41,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1813, Unknown=40, NotChecked=744, Total=2756 [2024-11-10 15:29:41,439 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 53 states, 52 states have (on average 3.4615384615384617) internal successors, (180), 53 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:42,631 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2024-11-10 15:29:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:29:42,632 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.4615384615384617) internal successors, (180), 53 states have internal predecessors, (180), 0 states have call successors, (0), 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 79 [2024-11-10 15:29:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:42,632 INFO L225 Difference]: With dead ends: 101 [2024-11-10 15:29:42,632 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 15:29:42,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 127 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=329, Invalid=3203, Unknown=40, NotChecked=984, Total=4556 [2024-11-10 15:29:42,633 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 100 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 586 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:42,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 903 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 951 Invalid, 0 Unknown, 586 Unchecked, 0.5s Time] [2024-11-10 15:29:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 15:29:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2024-11-10 15:29:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0666666666666667) internal successors, (96), 94 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2024-11-10 15:29:42,635 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 79 [2024-11-10 15:29:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:42,635 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2024-11-10 15:29:42,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.4615384615384617) internal successors, (180), 53 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2024-11-10 15:29:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-10 15:29:42,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:42,637 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:42,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-10 15:29:42,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-10 15:29:42,837 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:42,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:42,838 INFO L85 PathProgramCache]: Analyzing trace with hash 275659640, now seen corresponding path program 2 times [2024-11-10 15:29:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:42,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434436423] [2024-11-10 15:29:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:42,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:29:44,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:44,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434436423] [2024-11-10 15:29:44,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434436423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:44,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285713799] [2024-11-10 15:29:44,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:29:44,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:44,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:44,773 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:44,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-10 15:29:45,017 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:29:45,018 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:29:45,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-10 15:29:45,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:45,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:29:45,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:29:45,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:29:45,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:45,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:45,094 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:29:45,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:29:45,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:29:45,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:29:45,128 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-11-10 15:29:45,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:45,181 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 30 treesize of output 21 [2024-11-10 15:29:45,188 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 30 treesize of output 21 [2024-11-10 15:29:45,241 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-10 15:29:45,241 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2024-11-10 15:29:45,244 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 46 treesize of output 25 [2024-11-10 15:29:45,500 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-10 15:29:45,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2024-11-10 15:29:45,527 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-11-10 15:29:45,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36