./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/locks/test_locks_7.c -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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:52:05,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:52:05,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:52:05,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:52:05,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:52:05,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:52:05,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:52:05,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:52:05,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:52:05,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:52:05,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:52:05,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:52:05,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:52:05,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:52:05,985 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:52:05,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:52:05,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:52:05,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:52:05,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:52:05,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:52:05,986 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:52:05,990 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:52:05,990 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:52:05,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:52:05,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:52:05,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:52:05,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:52:05,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:52:05,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:52:05,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:52:05,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:52:05,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:52:05,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:52:05,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:52:05,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:52:05,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:52:05,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:52:05,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:52:05,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:52:05,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:52:05,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:52:05,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:52:05,997 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2024-11-17 00:52:06,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:52:06,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:52:06,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:52:06,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:52:06,242 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:52:06,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2024-11-17 00:52:07,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:52:07,726 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:52:07,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2024-11-17 00:52:07,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e2c4548/03a7fd36fd6346cda402f32c1bed3982/FLAGc274c07d8 [2024-11-17 00:52:07,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e2c4548/03a7fd36fd6346cda402f32c1bed3982 [2024-11-17 00:52:07,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:52:07,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:52:07,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:52:07,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:52:07,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:52:07,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:52:07" (1/1) ... [2024-11-17 00:52:07,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47bf95d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:07, skipping insertion in model container [2024-11-17 00:52:07,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:52:07" (1/1) ... [2024-11-17 00:52:07,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:52:07,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:52:07,970 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:52:07,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:52:08,002 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:52:08,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08 WrapperNode [2024-11-17 00:52:08,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:52:08,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:52:08,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:52:08,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:52:08,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (1/1) ... [2024-11-17 00:52:08,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (1/1) ... [2024-11-17 00:52:08,041 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 112 [2024-11-17 00:52:08,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:52:08,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:52:08,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:52:08,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:52:08,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (1/1) ... [2024-11-17 00:52:08,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (1/1) ... [2024-11-17 00:52:08,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (1/1) ... [2024-11-17 00:52:08,063 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 00:52:08,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (1/1) ... [2024-11-17 00:52:08,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (1/1) ... [2024-11-17 00:52:08,067 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (1/1) ... [2024-11-17 00:52:08,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (1/1) ... [2024-11-17 00:52:08,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (1/1) ... [2024-11-17 00:52:08,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (1/1) ... [2024-11-17 00:52:08,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:52:08,072 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:52:08,072 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:52:08,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:52:08,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (1/1) ... [2024-11-17 00:52:08,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:52:08,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:52:08,114 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-17 00:52:08,119 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-17 00:52:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:52:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:52:08,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:52:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:52:08,228 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:52:08,232 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:52:08,476 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-17 00:52:08,479 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:52:08,493 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:52:08,495 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:52:08,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:08 BoogieIcfgContainer [2024-11-17 00:52:08,495 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:52:08,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:52:08,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:52:08,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:52:08,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:52:07" (1/3) ... [2024-11-17 00:52:08,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cd6017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:52:08, skipping insertion in model container [2024-11-17 00:52:08,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:08" (2/3) ... [2024-11-17 00:52:08,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cd6017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:52:08, skipping insertion in model container [2024-11-17 00:52:08,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:08" (3/3) ... [2024-11-17 00:52:08,507 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2024-11-17 00:52:08,524 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:52:08,525 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:52:08,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:52:08,580 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;@1101c80e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:52:08,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:52:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 36 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-17 00:52:08,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:52:08,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:08,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:52:08,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:08,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash -864345195, now seen corresponding path program 1 times [2024-11-17 00:52:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:08,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186709944] [2024-11-17 00:52:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:08,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:08,760 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-17 00:52:08,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186709944] [2024-11-17 00:52:08,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186709944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:08,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:08,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:52:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644172236] [2024-11-17 00:52:08,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:08,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:52:08,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:08,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:52:08,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:52:08,799 INFO L87 Difference]: Start difference. First operand has 37 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 36 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:08,811 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. [2024-11-17 00:52:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:52:08,813 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:52:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:08,820 INFO L225 Difference]: With dead ends: 36 [2024-11-17 00:52:08,821 INFO L226 Difference]: Without dead ends: 33 [2024-11-17 00:52:08,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:52:08,828 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:08,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-17 00:52:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-17 00:52:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. [2024-11-17 00:52:08,872 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 6 [2024-11-17 00:52:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:08,873 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 53 transitions. [2024-11-17 00:52:08,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 53 transitions. [2024-11-17 00:52:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:52:08,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:08,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:08,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:52:08,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:08,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:08,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1666997380, now seen corresponding path program 1 times [2024-11-17 00:52:08,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:08,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036346667] [2024-11-17 00:52:08,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:08,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:08,942 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-17 00:52:08,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036346667] [2024-11-17 00:52:08,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036346667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:08,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:08,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:52:08,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061021123] [2024-11-17 00:52:08,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:08,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:08,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:08,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:08,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:08,947 INFO L87 Difference]: Start difference. First operand 33 states and 53 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:08,963 INFO L93 Difference]: Finished difference Result 32 states and 52 transitions. [2024-11-17 00:52:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:08,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:52:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:08,965 INFO L225 Difference]: With dead ends: 32 [2024-11-17 00:52:08,965 INFO L226 Difference]: Without dead ends: 29 [2024-11-17 00:52:08,965 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-17 00:52:08,966 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:08,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 52 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:08,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-17 00:52:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-17 00:52:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 28 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-17 00:52:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 49 transitions. [2024-11-17 00:52:08,978 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 49 transitions. Word has length 8 [2024-11-17 00:52:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:08,978 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 49 transitions. [2024-11-17 00:52:08,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 49 transitions. [2024-11-17 00:52:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:52:08,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:08,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:08,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:52:08,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:08,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:08,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1676393935, now seen corresponding path program 1 times [2024-11-17 00:52:08,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:08,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071620146] [2024-11-17 00:52:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:08,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,062 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-17 00:52:09,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071620146] [2024-11-17 00:52:09,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071620146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126694701] [2024-11-17 00:52:09,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,065 INFO L87 Difference]: Start difference. First operand 29 states and 49 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-17 00:52:09,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,086 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2024-11-17 00:52:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-17 00:52:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,088 INFO L225 Difference]: With dead ends: 55 [2024-11-17 00:52:09,088 INFO L226 Difference]: Without dead ends: 55 [2024-11-17 00:52:09,088 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-17 00:52:09,089 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 97 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-17 00:52:09,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 97 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-17 00:52:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2024-11-17 00:52:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 64 transitions. [2024-11-17 00:52:09,097 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 64 transitions. Word has length 16 [2024-11-17 00:52:09,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,098 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 64 transitions. [2024-11-17 00:52:09,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-17 00:52:09,098 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 64 transitions. [2024-11-17 00:52:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:52:09,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:52:09,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash -120557424, now seen corresponding path program 1 times [2024-11-17 00:52:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264563907] [2024-11-17 00:52:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,160 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-17 00:52:09,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264563907] [2024-11-17 00:52:09,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264563907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041793614] [2024-11-17 00:52:09,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,161 INFO L87 Difference]: Start difference. First operand 37 states and 64 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-17 00:52:09,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,175 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2024-11-17 00:52:09,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-17 00:52:09,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,177 INFO L225 Difference]: With dead ends: 55 [2024-11-17 00:52:09,178 INFO L226 Difference]: Without dead ends: 55 [2024-11-17 00:52:09,178 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-17 00:52:09,179 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 35 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:09,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-17 00:52:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-11-17 00:52:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 51 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-17 00:52:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2024-11-17 00:52:09,188 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 16 [2024-11-17 00:52:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,188 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2024-11-17 00:52:09,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-17 00:52:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2024-11-17 00:52:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 00:52:09,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:52:09,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash 429447268, now seen corresponding path program 1 times [2024-11-17 00:52:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235126672] [2024-11-17 00:52:09,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,220 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-17 00:52:09,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235126672] [2024-11-17 00:52:09,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235126672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794848062] [2024-11-17 00:52:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,223 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,234 INFO L93 Difference]: Finished difference Result 59 states and 94 transitions. [2024-11-17 00:52:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-17 00:52:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,236 INFO L225 Difference]: With dead ends: 59 [2024-11-17 00:52:09,236 INFO L226 Difference]: Without dead ends: 59 [2024-11-17 00:52:09,236 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-17 00:52:09,237 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 37 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:09,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-17 00:52:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2024-11-17 00:52:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 55 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-17 00:52:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2024-11-17 00:52:09,242 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 17 [2024-11-17 00:52:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,242 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2024-11-17 00:52:09,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2024-11-17 00:52:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 00:52:09,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:52:09,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,244 INFO L85 PathProgramCache]: Analyzing trace with hash 558529987, now seen corresponding path program 1 times [2024-11-17 00:52:09,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023148915] [2024-11-17 00:52:09,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,297 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-17 00:52:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023148915] [2024-11-17 00:52:09,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023148915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010973209] [2024-11-17 00:52:09,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,301 INFO L87 Difference]: Start difference. First operand 56 states and 92 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,315 INFO L93 Difference]: Finished difference Result 102 states and 169 transitions. [2024-11-17 00:52:09,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-17 00:52:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,316 INFO L225 Difference]: With dead ends: 102 [2024-11-17 00:52:09,316 INFO L226 Difference]: Without dead ends: 102 [2024-11-17 00:52:09,317 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-17 00:52:09,317 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 32 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 95 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-17 00:52:09,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-17 00:52:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 73. [2024-11-17 00:52:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-17 00:52:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 121 transitions. [2024-11-17 00:52:09,324 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 121 transitions. Word has length 17 [2024-11-17 00:52:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,324 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 121 transitions. [2024-11-17 00:52:09,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 121 transitions. [2024-11-17 00:52:09,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 00:52:09,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:52:09,325 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1238421372, now seen corresponding path program 1 times [2024-11-17 00:52:09,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315049096] [2024-11-17 00:52:09,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:09,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315049096] [2024-11-17 00:52:09,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315049096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067275044] [2024-11-17 00:52:09,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,369 INFO L87 Difference]: Start difference. First operand 73 states and 121 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,382 INFO L93 Difference]: Finished difference Result 104 states and 167 transitions. [2024-11-17 00:52:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-17 00:52:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,384 INFO L225 Difference]: With dead ends: 104 [2024-11-17 00:52:09,384 INFO L226 Difference]: Without dead ends: 104 [2024-11-17 00:52:09,384 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-17 00:52:09,385 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 34 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:09,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 107 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-17 00:52:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-17 00:52:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.65) internal successors, (165), 100 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-17 00:52:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 165 transitions. [2024-11-17 00:52:09,392 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 165 transitions. Word has length 17 [2024-11-17 00:52:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,392 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 165 transitions. [2024-11-17 00:52:09,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 165 transitions. [2024-11-17 00:52:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:52:09,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:52:09,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash 135396521, now seen corresponding path program 1 times [2024-11-17 00:52:09,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612588195] [2024-11-17 00:52:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,430 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-17 00:52:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612588195] [2024-11-17 00:52:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612588195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093181685] [2024-11-17 00:52:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,433 INFO L87 Difference]: Start difference. First operand 101 states and 165 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,444 INFO L93 Difference]: Finished difference Result 106 states and 167 transitions. [2024-11-17 00:52:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 00:52:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,446 INFO L225 Difference]: With dead ends: 106 [2024-11-17 00:52:09,446 INFO L226 Difference]: Without dead ends: 106 [2024-11-17 00:52:09,446 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-17 00:52:09,451 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 36 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:09,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 114 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-17 00:52:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-11-17 00:52:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.6176470588235294) internal successors, (165), 102 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-17 00:52:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 165 transitions. [2024-11-17 00:52:09,458 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 165 transitions. Word has length 18 [2024-11-17 00:52:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,458 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 165 transitions. [2024-11-17 00:52:09,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 165 transitions. [2024-11-17 00:52:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:52:09,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:52:09,459 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash 264479240, now seen corresponding path program 1 times [2024-11-17 00:52:09,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580286472] [2024-11-17 00:52:09,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,481 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-17 00:52:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580286472] [2024-11-17 00:52:09,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580286472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104369791] [2024-11-17 00:52:09,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,483 INFO L87 Difference]: Start difference. First operand 103 states and 165 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,492 INFO L93 Difference]: Finished difference Result 186 states and 299 transitions. [2024-11-17 00:52:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 00:52:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,494 INFO L225 Difference]: With dead ends: 186 [2024-11-17 00:52:09,494 INFO L226 Difference]: Without dead ends: 186 [2024-11-17 00:52:09,494 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-17 00:52:09,495 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 29 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 93 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-17 00:52:09,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-17 00:52:09,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 139. [2024-11-17 00:52:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.6014492753623188) internal successors, (221), 138 states have internal predecessors, (221), 0 states have call successors, (0), 0 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-17 00:52:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 221 transitions. [2024-11-17 00:52:09,524 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 221 transitions. Word has length 18 [2024-11-17 00:52:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,525 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 221 transitions. [2024-11-17 00:52:09,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 221 transitions. [2024-11-17 00:52:09,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:52:09,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:52:09,526 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1532472119, now seen corresponding path program 1 times [2024-11-17 00:52:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499237545] [2024-11-17 00:52:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,573 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-17 00:52:09,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499237545] [2024-11-17 00:52:09,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499237545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935252926] [2024-11-17 00:52:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,577 INFO L87 Difference]: Start difference. First operand 139 states and 221 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,603 INFO L93 Difference]: Finished difference Result 194 states and 299 transitions. [2024-11-17 00:52:09,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 00:52:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,604 INFO L225 Difference]: With dead ends: 194 [2024-11-17 00:52:09,604 INFO L226 Difference]: Without dead ends: 194 [2024-11-17 00:52:09,605 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-17 00:52:09,605 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 33 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:09,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 108 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-17 00:52:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2024-11-17 00:52:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.563157894736842) internal successors, (297), 190 states have internal predecessors, (297), 0 states have call successors, (0), 0 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-17 00:52:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 297 transitions. [2024-11-17 00:52:09,615 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 297 transitions. Word has length 18 [2024-11-17 00:52:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,615 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 297 transitions. [2024-11-17 00:52:09,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 297 transitions. [2024-11-17 00:52:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:52:09,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:52:09,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash -390248771, now seen corresponding path program 1 times [2024-11-17 00:52:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566512589] [2024-11-17 00:52:09,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,641 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-17 00:52:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566512589] [2024-11-17 00:52:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566512589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471032691] [2024-11-17 00:52:09,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,643 INFO L87 Difference]: Start difference. First operand 191 states and 297 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,655 INFO L93 Difference]: Finished difference Result 198 states and 299 transitions. [2024-11-17 00:52:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:52:09,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,658 INFO L225 Difference]: With dead ends: 198 [2024-11-17 00:52:09,658 INFO L226 Difference]: Without dead ends: 198 [2024-11-17 00:52:09,659 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-17 00:52:09,659 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:09,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 110 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-17 00:52:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2024-11-17 00:52:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.5309278350515463) internal successors, (297), 194 states have internal predecessors, (297), 0 states have call successors, (0), 0 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-17 00:52:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 297 transitions. [2024-11-17 00:52:09,665 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 297 transitions. Word has length 19 [2024-11-17 00:52:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,665 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 297 transitions. [2024-11-17 00:52:09,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 297 transitions. [2024-11-17 00:52:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:52:09,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:52:09,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,667 INFO L85 PathProgramCache]: Analyzing trace with hash -261166052, now seen corresponding path program 1 times [2024-11-17 00:52:09,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683372016] [2024-11-17 00:52:09,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,685 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-17 00:52:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683372016] [2024-11-17 00:52:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683372016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226834210] [2024-11-17 00:52:09,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,687 INFO L87 Difference]: Start difference. First operand 195 states and 297 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,696 INFO L93 Difference]: Finished difference Result 346 states and 527 transitions. [2024-11-17 00:52:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:52:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,698 INFO L225 Difference]: With dead ends: 346 [2024-11-17 00:52:09,698 INFO L226 Difference]: Without dead ends: 346 [2024-11-17 00:52:09,698 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-17 00:52:09,702 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 91 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-17 00:52:09,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-17 00:52:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 271. [2024-11-17 00:52:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.5) internal successors, (405), 270 states have internal predecessors, (405), 0 states have call successors, (0), 0 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-17 00:52:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 405 transitions. [2024-11-17 00:52:09,718 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 405 transitions. Word has length 19 [2024-11-17 00:52:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,719 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 405 transitions. [2024-11-17 00:52:09,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 405 transitions. [2024-11-17 00:52:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:52:09,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:52:09,720 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2058117411, now seen corresponding path program 1 times [2024-11-17 00:52:09,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65063953] [2024-11-17 00:52:09,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,757 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-17 00:52:09,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65063953] [2024-11-17 00:52:09,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65063953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914892806] [2024-11-17 00:52:09,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,760 INFO L87 Difference]: Start difference. First operand 271 states and 405 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,773 INFO L93 Difference]: Finished difference Result 370 states and 535 transitions. [2024-11-17 00:52:09,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:52:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,775 INFO L225 Difference]: With dead ends: 370 [2024-11-17 00:52:09,775 INFO L226 Difference]: Without dead ends: 370 [2024-11-17 00:52:09,775 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-17 00:52:09,776 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:09,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 109 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-17 00:52:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2024-11-17 00:52:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 1.4562841530054644) internal successors, (533), 366 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-17 00:52:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 533 transitions. [2024-11-17 00:52:09,785 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 533 transitions. Word has length 19 [2024-11-17 00:52:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,785 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 533 transitions. [2024-11-17 00:52:09,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 533 transitions. [2024-11-17 00:52:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:52:09,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:52:09,787 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,788 INFO L85 PathProgramCache]: Analyzing trace with hash 494609634, now seen corresponding path program 1 times [2024-11-17 00:52:09,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107552323] [2024-11-17 00:52:09,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,819 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-17 00:52:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107552323] [2024-11-17 00:52:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107552323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136915689] [2024-11-17 00:52:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,822 INFO L87 Difference]: Start difference. First operand 367 states and 533 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,835 INFO L93 Difference]: Finished difference Result 378 states and 535 transitions. [2024-11-17 00:52:09,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:52:09,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,836 INFO L225 Difference]: With dead ends: 378 [2024-11-17 00:52:09,837 INFO L226 Difference]: Without dead ends: 378 [2024-11-17 00:52:09,837 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-17 00:52:09,837 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 34 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:09,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 106 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-17 00:52:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 375. [2024-11-17 00:52:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.4251336898395721) internal successors, (533), 374 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-17 00:52:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 533 transitions. [2024-11-17 00:52:09,845 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 533 transitions. Word has length 20 [2024-11-17 00:52:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,847 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 533 transitions. [2024-11-17 00:52:09,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 533 transitions. [2024-11-17 00:52:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:52:09,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:52:09,848 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash 623692353, now seen corresponding path program 1 times [2024-11-17 00:52:09,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177849490] [2024-11-17 00:52:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,874 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-17 00:52:09,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177849490] [2024-11-17 00:52:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177849490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676788948] [2024-11-17 00:52:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,876 INFO L87 Difference]: Start difference. First operand 375 states and 533 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,885 INFO L93 Difference]: Finished difference Result 650 states and 919 transitions. [2024-11-17 00:52:09,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:52:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,887 INFO L225 Difference]: With dead ends: 650 [2024-11-17 00:52:09,887 INFO L226 Difference]: Without dead ends: 650 [2024-11-17 00:52:09,888 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-17 00:52:09,888 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 89 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-17 00:52:09,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-17 00:52:09,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 535. [2024-11-17 00:52:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.3876404494382022) internal successors, (741), 534 states have internal predecessors, (741), 0 states have call successors, (0), 0 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-17 00:52:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 741 transitions. [2024-11-17 00:52:09,897 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 741 transitions. Word has length 20 [2024-11-17 00:52:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,897 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 741 transitions. [2024-11-17 00:52:09,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 741 transitions. [2024-11-17 00:52:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:52:09,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:52:09,900 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1173259006, now seen corresponding path program 1 times [2024-11-17 00:52:09,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490843720] [2024-11-17 00:52:09,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:09,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490843720] [2024-11-17 00:52:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490843720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834116376] [2024-11-17 00:52:09,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,930 INFO L87 Difference]: Start difference. First operand 535 states and 741 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,942 INFO L93 Difference]: Finished difference Result 714 states and 951 transitions. [2024-11-17 00:52:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:52:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,944 INFO L225 Difference]: With dead ends: 714 [2024-11-17 00:52:09,944 INFO L226 Difference]: Without dead ends: 714 [2024-11-17 00:52:09,945 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-17 00:52:09,945 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:09,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 110 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-17 00:52:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 711. [2024-11-17 00:52:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.3366197183098592) internal successors, (949), 710 states have internal predecessors, (949), 0 states have call successors, (0), 0 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-17 00:52:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 949 transitions. [2024-11-17 00:52:09,957 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 949 transitions. Word has length 20 [2024-11-17 00:52:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,957 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 949 transitions. [2024-11-17 00:52:09,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 949 transitions. [2024-11-17 00:52:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:52:09,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:09,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:52:09,958 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2139557610, now seen corresponding path program 1 times [2024-11-17 00:52:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502369631] [2024-11-17 00:52:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,985 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-17 00:52:09,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502369631] [2024-11-17 00:52:09,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502369631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274984904] [2024-11-17 00:52:09,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,988 INFO L87 Difference]: Start difference. First operand 711 states and 949 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-17 00:52:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:09,998 INFO L93 Difference]: Finished difference Result 730 states and 951 transitions. [2024-11-17 00:52:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:09,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:52:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:10,001 INFO L225 Difference]: With dead ends: 730 [2024-11-17 00:52:10,002 INFO L226 Difference]: Without dead ends: 730 [2024-11-17 00:52:10,002 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-17 00:52:10,003 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 33 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:10,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 102 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-11-17 00:52:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 727. [2024-11-17 00:52:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.3071625344352618) internal successors, (949), 726 states have internal predecessors, (949), 0 states have call successors, (0), 0 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-17 00:52:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 949 transitions. [2024-11-17 00:52:10,026 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 949 transitions. Word has length 21 [2024-11-17 00:52:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:10,026 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 949 transitions. [2024-11-17 00:52:10,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-17 00:52:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 949 transitions. [2024-11-17 00:52:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:52:10,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:10,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:10,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:52:10,027 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:10,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:10,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2010474891, now seen corresponding path program 1 times [2024-11-17 00:52:10,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:10,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559050644] [2024-11-17 00:52:10,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:10,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:10,049 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-17 00:52:10,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:10,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559050644] [2024-11-17 00:52:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559050644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:10,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:10,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:10,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849475016] [2024-11-17 00:52:10,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:10,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:10,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:10,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:10,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:10,052 INFO L87 Difference]: Start difference. First operand 727 states and 949 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-17 00:52:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:10,067 INFO L93 Difference]: Finished difference Result 1226 states and 1575 transitions. [2024-11-17 00:52:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:10,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:52:10,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:10,071 INFO L225 Difference]: With dead ends: 1226 [2024-11-17 00:52:10,071 INFO L226 Difference]: Without dead ends: 1226 [2024-11-17 00:52:10,072 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-17 00:52:10,072 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 87 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-17 00:52:10,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-11-17 00:52:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1063. [2024-11-17 00:52:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.2702448210922788) internal successors, (1349), 1062 states have internal predecessors, (1349), 0 states have call successors, (0), 0 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-17 00:52:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1349 transitions. [2024-11-17 00:52:10,089 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1349 transitions. Word has length 21 [2024-11-17 00:52:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:10,090 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1349 transitions. [2024-11-17 00:52:10,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-17 00:52:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1349 transitions. [2024-11-17 00:52:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:52:10,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:10,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:10,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:52:10,091 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:10,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash 487541046, now seen corresponding path program 1 times [2024-11-17 00:52:10,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:10,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529923128] [2024-11-17 00:52:10,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:10,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:10,109 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-17 00:52:10,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:10,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529923128] [2024-11-17 00:52:10,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529923128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:10,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:10,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:10,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616682186] [2024-11-17 00:52:10,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:10,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:10,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:10,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:10,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:10,113 INFO L87 Difference]: Start difference. First operand 1063 states and 1349 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-17 00:52:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:10,127 INFO L93 Difference]: Finished difference Result 1386 states and 1671 transitions. [2024-11-17 00:52:10,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:10,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:52:10,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:10,131 INFO L225 Difference]: With dead ends: 1386 [2024-11-17 00:52:10,131 INFO L226 Difference]: Without dead ends: 1386 [2024-11-17 00:52:10,132 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-17 00:52:10,132 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:10,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 111 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:10,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-17 00:52:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1383. [2024-11-17 00:52:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.20767004341534) internal successors, (1669), 1382 states have internal predecessors, (1669), 0 states have call successors, (0), 0 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-17 00:52:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1669 transitions. [2024-11-17 00:52:10,154 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1669 transitions. Word has length 21 [2024-11-17 00:52:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:10,154 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1669 transitions. [2024-11-17 00:52:10,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-17 00:52:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1669 transitions. [2024-11-17 00:52:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:52:10,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:10,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:10,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:52:10,156 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:10,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2100597019, now seen corresponding path program 1 times [2024-11-17 00:52:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:10,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619838648] [2024-11-17 00:52:10,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:10,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-17 00:52:10,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:10,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619838648] [2024-11-17 00:52:10,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619838648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:10,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:10,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:10,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190323563] [2024-11-17 00:52:10,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:10,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:10,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:10,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:10,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:10,177 INFO L87 Difference]: Start difference. First operand 1383 states and 1669 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-17 00:52:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:10,198 INFO L93 Difference]: Finished difference Result 1418 states and 1671 transitions. [2024-11-17 00:52:10,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:10,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-17 00:52:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:10,202 INFO L225 Difference]: With dead ends: 1418 [2024-11-17 00:52:10,202 INFO L226 Difference]: Without dead ends: 1418 [2024-11-17 00:52:10,203 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-17 00:52:10,203 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:10,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2024-11-17 00:52:10,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1415. [2024-11-17 00:52:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1414 states have (on average 1.1803394625176804) internal successors, (1669), 1414 states have internal predecessors, (1669), 0 states have call successors, (0), 0 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-17 00:52:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1669 transitions. [2024-11-17 00:52:10,223 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1669 transitions. Word has length 22 [2024-11-17 00:52:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:10,224 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1669 transitions. [2024-11-17 00:52:10,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-17 00:52:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1669 transitions. [2024-11-17 00:52:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:52:10,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:10,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:10,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 00:52:10,226 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:10,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:10,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2065287558, now seen corresponding path program 1 times [2024-11-17 00:52:10,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:10,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813265964] [2024-11-17 00:52:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:10,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:10,241 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-17 00:52:10,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:10,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813265964] [2024-11-17 00:52:10,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813265964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:10,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514805093] [2024-11-17 00:52:10,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:10,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:10,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:10,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:10,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:10,243 INFO L87 Difference]: Start difference. First operand 1415 states and 1669 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-17 00:52:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:10,258 INFO L93 Difference]: Finished difference Result 2311 states and 2629 transitions. [2024-11-17 00:52:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:10,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-17 00:52:10,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:10,264 INFO L225 Difference]: With dead ends: 2311 [2024-11-17 00:52:10,264 INFO L226 Difference]: Without dead ends: 2311 [2024-11-17 00:52:10,264 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-17 00:52:10,265 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 83 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-17 00:52:10,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2024-11-17 00:52:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2119. [2024-11-17 00:52:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 2118 states have (on average 1.1506137865911237) internal successors, (2437), 2118 states have internal predecessors, (2437), 0 states have call successors, (0), 0 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-17 00:52:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 2437 transitions. [2024-11-17 00:52:10,295 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 2437 transitions. Word has length 22 [2024-11-17 00:52:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:10,295 INFO L471 AbstractCegarLoop]: Abstraction has 2119 states and 2437 transitions. [2024-11-17 00:52:10,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-17 00:52:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2437 transitions. [2024-11-17 00:52:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:52:10,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:10,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:10,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 00:52:10,298 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:10,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash 432728379, now seen corresponding path program 1 times [2024-11-17 00:52:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:10,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175439938] [2024-11-17 00:52:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:10,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:10,327 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-17 00:52:10,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:10,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175439938] [2024-11-17 00:52:10,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175439938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:10,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:10,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:10,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508890483] [2024-11-17 00:52:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:10,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:10,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:10,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:10,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:10,329 INFO L87 Difference]: Start difference. First operand 2119 states and 2437 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-17 00:52:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:10,346 INFO L93 Difference]: Finished difference Result 2692 states and 2883 transitions. [2024-11-17 00:52:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:10,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-17 00:52:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:10,347 INFO L225 Difference]: With dead ends: 2692 [2024-11-17 00:52:10,347 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 00:52:10,347 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-17 00:52:10,348 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:10,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 108 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 00:52:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 00:52:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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-17 00:52:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 00:52:10,349 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-11-17 00:52:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:10,349 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 00:52:10,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-17 00:52:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 00:52:10,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 00:52:10,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-17 00:52:10,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-17 00:52:10,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 00:52:10,354 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:10,356 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:52:10,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:52:10 BoogieIcfgContainer [2024-11-17 00:52:10,358 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:52:10,359 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:52:10,359 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:52:10,359 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:52:10,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:08" (3/4) ... [2024-11-17 00:52:10,361 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 00:52:10,367 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-17 00:52:10,368 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-17 00:52:10,368 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-17 00:52:10,368 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 00:52:10,441 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 00:52:10,442 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 00:52:10,442 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:52:10,442 INFO L158 Benchmark]: Toolchain (without parser) took 2690.59ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 91.2MB in the beginning and 159.0MB in the end (delta: -67.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:52:10,443 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 121.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:52:10,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.72ms. Allocated memory is still 159.4MB. Free memory was 90.9MB in the beginning and 78.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 00:52:10,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.11ms. Allocated memory is still 159.4MB. Free memory was 78.3MB in the beginning and 76.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:52:10,443 INFO L158 Benchmark]: Boogie Preprocessor took 29.02ms. Allocated memory is still 159.4MB. Free memory was 76.7MB in the beginning and 75.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:52:10,444 INFO L158 Benchmark]: IcfgBuilder took 423.62ms. Allocated memory is still 159.4MB. Free memory was 75.1MB in the beginning and 128.3MB in the end (delta: -53.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 00:52:10,447 INFO L158 Benchmark]: TraceAbstraction took 1861.09ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 127.9MB in the beginning and 164.2MB in the end (delta: -36.3MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-11-17 00:52:10,447 INFO L158 Benchmark]: Witness Printer took 83.44ms. Allocated memory is still 205.5MB. Free memory was 164.2MB in the beginning and 159.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 00:52:10,448 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 121.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.72ms. Allocated memory is still 159.4MB. Free memory was 90.9MB in the beginning and 78.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.11ms. Allocated memory is still 159.4MB. Free memory was 78.3MB in the beginning and 76.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.02ms. Allocated memory is still 159.4MB. Free memory was 76.7MB in the beginning and 75.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 423.62ms. Allocated memory is still 159.4MB. Free memory was 75.1MB in the beginning and 128.3MB in the end (delta: -53.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1861.09ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 127.9MB in the beginning and 164.2MB in the end (delta: -36.3MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Witness Printer took 83.44ms. Allocated memory is still 205.5MB. Free memory was 164.2MB in the beginning and 159.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 654 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 654 mSDsluCounter, 2150 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 802 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1348 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2119occurred in iteration=21, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 675 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 397 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 723 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-17 00:52:10,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE