./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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_8.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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:46:04,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:46:04,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:46:04,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:46:04,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:46:04,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:46:04,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:46:04,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:46:04,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:46:04,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:46:04,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:46:04,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:46:04,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:46:04,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:46:04,586 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:46:04,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:46:04,587 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:46:04,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:46:04,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:46:04,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:46:04,588 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:46:04,588 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:46:04,589 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:46:04,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:46:04,589 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:46:04,589 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:46:04,589 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:46:04,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:46:04,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:46:04,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:46:04,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:46:04,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:46:04,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:46:04,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:46:04,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:46:04,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:46:04,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:46:04,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:46:04,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:46:04,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:46:04,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:46:04,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:46:04,593 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2024-11-12 13:46:04,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:46:04,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:46:04,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:46:04,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:46:04,848 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:46:04,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2024-11-12 13:46:06,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:46:06,367 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:46:06,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2024-11-12 13:46:06,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46f2d0f9d/a65a51e01dca414cb594a81e96451021/FLAGc79415032 [2024-11-12 13:46:06,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46f2d0f9d/a65a51e01dca414cb594a81e96451021 [2024-11-12 13:46:06,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:46:06,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:46:06,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:46:06,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:46:06,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:46:06,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49217fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06, skipping insertion in model container [2024-11-12 13:46:06,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:46:06,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:46:06,578 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:46:06,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:46:06,622 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:46:06,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06 WrapperNode [2024-11-12 13:46:06,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:46:06,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:46:06,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:46:06,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:46:06,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,657 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2024-11-12 13:46:06,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:46:06,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:46:06,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:46:06,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:46:06,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,693 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-12 13:46:06,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:46:06,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:46:06,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:46:06,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:46:06,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:46:06,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:46:06,757 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-12 13:46:06,765 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-12 13:46:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:46:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:46:06,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:46:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:46:06,862 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:46:06,866 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:46:07,065 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 13:46:07,066 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:46:07,084 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:46:07,085 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 13:46:07,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:46:07 BoogieIcfgContainer [2024-11-12 13:46:07,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:46:07,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:46:07,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:46:07,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:46:07,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:46:06" (1/3) ... [2024-11-12 13:46:07,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb5a857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:46:07, skipping insertion in model container [2024-11-12 13:46:07,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (2/3) ... [2024-11-12 13:46:07,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb5a857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:46:07, skipping insertion in model container [2024-11-12 13:46:07,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:46:07" (3/3) ... [2024-11-12 13:46:07,095 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2024-11-12 13:46:07,112 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:46:07,113 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 13:46:07,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:46:07,163 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;@c48f93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:46:07,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 13:46:07,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:46:07,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:46:07,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash 28702382, now seen corresponding path program 1 times [2024-11-12 13:46:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302571088] [2024-11-12 13:46:07,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,304 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-12 13:46:07,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302571088] [2024-11-12 13:46:07,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302571088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:46:07,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487578601] [2024-11-12 13:46:07,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:46:07,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:46:07,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:46:07,344 INFO L87 Difference]: Start difference. First operand has 37 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,356 INFO L93 Difference]: Finished difference Result 36 states and 59 transitions. [2024-11-12 13:46:07,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:46:07,358 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:46:07,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,364 INFO L225 Difference]: With dead ends: 36 [2024-11-12 13:46:07,365 INFO L226 Difference]: Without dead ends: 34 [2024-11-12 13:46:07,366 INFO L434 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-12 13:46:07,372 INFO L435 NwaCegarLoop]: 59 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, 59 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-12 13:46:07,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-12 13:46:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-12 13:46:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.78125) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2024-11-12 13:46:07,417 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 5 [2024-11-12 13:46:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,421 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2024-11-12 13:46:07,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2024-11-12 13:46:07,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:46:07,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:46:07,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,425 INFO L85 PathProgramCache]: Analyzing trace with hash 889696878, now seen corresponding path program 1 times [2024-11-12 13:46:07,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267087537] [2024-11-12 13:46:07,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,513 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-12 13:46:07,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267087537] [2024-11-12 13:46:07,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267087537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:46:07,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153067285] [2024-11-12 13:46:07,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,521 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,532 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. [2024-11-12 13:46:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:46:07,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,534 INFO L225 Difference]: With dead ends: 33 [2024-11-12 13:46:07,535 INFO L226 Difference]: Without dead ends: 31 [2024-11-12 13:46:07,535 INFO L434 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-12 13:46:07,536 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 56 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-12 13:46:07,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-12 13:46:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-12 13:46:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2024-11-12 13:46:07,543 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 6 [2024-11-12 13:46:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,544 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2024-11-12 13:46:07,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,544 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2024-11-12 13:46:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:46:07,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:46:07,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1657621598, now seen corresponding path program 1 times [2024-11-12 13:46:07,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958384059] [2024-11-12 13:46:07,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,619 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-12 13:46:07,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958384059] [2024-11-12 13:46:07,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958384059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:07,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031139425] [2024-11-12 13:46:07,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,625 INFO L87 Difference]: Start difference. First operand 31 states and 54 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-12 13:46:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,650 INFO L93 Difference]: Finished difference Result 59 states and 103 transitions. [2024-11-12 13:46:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,651 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-12 13:46:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,653 INFO L225 Difference]: With dead ends: 59 [2024-11-12 13:46:07,653 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 13:46:07,654 INFO L434 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-12 13:46:07,654 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 106 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-12 13:46:07,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 106 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 13:46:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 40. [2024-11-12 13:46:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 71 transitions. [2024-11-12 13:46:07,666 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 71 transitions. Word has length 16 [2024-11-12 13:46:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,667 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 71 transitions. [2024-11-12 13:46:07,667 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-12 13:46:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 71 transitions. [2024-11-12 13:46:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:46:07,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:46:07,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1399456160, now seen corresponding path program 1 times [2024-11-12 13:46:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24908226] [2024-11-12 13:46:07,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,732 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-12 13:46:07,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24908226] [2024-11-12 13:46:07,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24908226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:07,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801589891] [2024-11-12 13:46:07,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,737 INFO L87 Difference]: Start difference. First operand 40 states and 71 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-12 13:46:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,755 INFO L93 Difference]: Finished difference Result 59 states and 101 transitions. [2024-11-12 13:46:07,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,755 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-12 13:46:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,757 INFO L225 Difference]: With dead ends: 59 [2024-11-12 13:46:07,758 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 13:46:07,758 INFO L434 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-12 13:46:07,759 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 39 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 117 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-12 13:46:07,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 117 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 13:46:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2024-11-12 13:46:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 99 transitions. [2024-11-12 13:46:07,767 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 99 transitions. Word has length 16 [2024-11-12 13:46:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,767 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 99 transitions. [2024-11-12 13:46:07,767 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-12 13:46:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 99 transitions. [2024-11-12 13:46:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:46:07,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:46:07,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash 159967120, now seen corresponding path program 1 times [2024-11-12 13:46:07,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656772769] [2024-11-12 13:46:07,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,824 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-12 13:46:07,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656772769] [2024-11-12 13:46:07,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656772769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:07,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467275896] [2024-11-12 13:46:07,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,828 INFO L87 Difference]: Start difference. First operand 56 states and 99 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-12 13:46:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,848 INFO L93 Difference]: Finished difference Result 62 states and 103 transitions. [2024-11-12 13:46:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,849 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-12 13:46:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,849 INFO L225 Difference]: With dead ends: 62 [2024-11-12 13:46:07,849 INFO L226 Difference]: Without dead ends: 62 [2024-11-12 13:46:07,849 INFO L434 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-12 13:46:07,850 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 41 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 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-12 13:46:07,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-12 13:46:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-11-12 13:46:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 101 transitions. [2024-11-12 13:46:07,859 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 101 transitions. Word has length 17 [2024-11-12 13:46:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,860 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 101 transitions. [2024-11-12 13:46:07,860 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-12 13:46:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 101 transitions. [2024-11-12 13:46:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:46:07,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:46:07,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,862 INFO L85 PathProgramCache]: Analyzing trace with hash -426838894, now seen corresponding path program 1 times [2024-11-12 13:46:07,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260351086] [2024-11-12 13:46:07,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,930 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-12 13:46:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260351086] [2024-11-12 13:46:07,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260351086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:07,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164714803] [2024-11-12 13:46:07,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,934 INFO L87 Difference]: Start difference. First operand 59 states and 101 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-12 13:46:07,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,945 INFO L93 Difference]: Finished difference Result 109 states and 188 transitions. [2024-11-12 13:46:07,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,945 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-12 13:46:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,946 INFO L225 Difference]: With dead ends: 109 [2024-11-12 13:46:07,946 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 13:46:07,946 INFO L434 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-12 13:46:07,947 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 104 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-12 13:46:07,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 13:46:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 78. [2024-11-12 13:46:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 134 transitions. [2024-11-12 13:46:07,952 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 134 transitions. Word has length 17 [2024-11-12 13:46:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,952 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 134 transitions. [2024-11-12 13:46:07,952 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-12 13:46:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 134 transitions. [2024-11-12 13:46:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:46:07,953 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:46:07,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash -168673456, now seen corresponding path program 1 times [2024-11-12 13:46:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336494919] [2024-11-12 13:46:07,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,975 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-12 13:46:07,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336494919] [2024-11-12 13:46:07,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336494919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:07,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376309585] [2024-11-12 13:46:07,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,977 INFO L87 Difference]: Start difference. First operand 78 states and 134 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-12 13:46:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,987 INFO L93 Difference]: Finished difference Result 111 states and 186 transitions. [2024-11-12 13:46:07,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,987 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-12 13:46:07,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,988 INFO L225 Difference]: With dead ends: 111 [2024-11-12 13:46:07,988 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 13:46:07,988 INFO L434 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-12 13:46:07,989 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 118 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-12 13:46:07,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 13:46:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2024-11-12 13:46:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 184 transitions. [2024-11-12 13:46:07,994 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 184 transitions. Word has length 17 [2024-11-12 13:46:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,995 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 184 transitions. [2024-11-12 13:46:07,995 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-12 13:46:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 184 transitions. [2024-11-12 13:46:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:46:07,996 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:46:07,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash -340464149, now seen corresponding path program 1 times [2024-11-12 13:46:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265579075] [2024-11-12 13:46:07,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,015 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-12 13:46:08,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265579075] [2024-11-12 13:46:08,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265579075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32370056] [2024-11-12 13:46:08,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,017 INFO L87 Difference]: Start difference. First operand 108 states and 184 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-12 13:46:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,026 INFO L93 Difference]: Finished difference Result 113 states and 186 transitions. [2024-11-12 13:46:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,026 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-12 13:46:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,027 INFO L225 Difference]: With dead ends: 113 [2024-11-12 13:46:08,027 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 13:46:08,027 INFO L434 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-12 13:46:08,028 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 40 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 127 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-12 13:46:08,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 13:46:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2024-11-12 13:46:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 184 transitions. [2024-11-12 13:46:08,032 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 184 transitions. Word has length 18 [2024-11-12 13:46:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,033 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 184 transitions. [2024-11-12 13:46:08,033 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-12 13:46:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 184 transitions. [2024-11-12 13:46:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:46:08,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:46:08,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash -927270163, now seen corresponding path program 1 times [2024-11-12 13:46:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942115449] [2024-11-12 13:46:08,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,052 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-12 13:46:08,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942115449] [2024-11-12 13:46:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942115449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516968294] [2024-11-12 13:46:08,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,055 INFO L87 Difference]: Start difference. First operand 110 states and 184 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-12 13:46:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,063 INFO L93 Difference]: Finished difference Result 209 states and 342 transitions. [2024-11-12 13:46:08,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,064 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-12 13:46:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,064 INFO L225 Difference]: With dead ends: 209 [2024-11-12 13:46:08,065 INFO L226 Difference]: Without dead ends: 209 [2024-11-12 13:46:08,065 INFO L434 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-12 13:46:08,065 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 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-12 13:46:08,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-12 13:46:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-12 13:46:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.6585365853658536) internal successors, (340), 205 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 340 transitions. [2024-11-12 13:46:08,072 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 340 transitions. Word has length 18 [2024-11-12 13:46:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,072 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 340 transitions. [2024-11-12 13:46:08,072 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-12 13:46:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 340 transitions. [2024-11-12 13:46:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:46:08,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:46:08,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1185435601, now seen corresponding path program 1 times [2024-11-12 13:46:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109360623] [2024-11-12 13:46:08,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,092 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-12 13:46:08,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109360623] [2024-11-12 13:46:08,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109360623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831599797] [2024-11-12 13:46:08,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,094 INFO L87 Difference]: Start difference. First operand 206 states and 340 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-12 13:46:08,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,101 INFO L93 Difference]: Finished difference Result 257 states and 426 transitions. [2024-11-12 13:46:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,101 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-12 13:46:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,102 INFO L225 Difference]: With dead ends: 257 [2024-11-12 13:46:08,102 INFO L226 Difference]: Without dead ends: 257 [2024-11-12 13:46:08,102 INFO L434 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-12 13:46:08,103 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 33 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:08,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 137 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-12 13:46:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 206. [2024-11-12 13:46:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 336 transitions. [2024-11-12 13:46:08,109 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 336 transitions. Word has length 18 [2024-11-12 13:46:08,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,109 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 336 transitions. [2024-11-12 13:46:08,109 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-12 13:46:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 336 transitions. [2024-11-12 13:46:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:46:08,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:46:08,111 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1326046267, now seen corresponding path program 1 times [2024-11-12 13:46:08,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007507937] [2024-11-12 13:46:08,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,134 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-12 13:46:08,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007507937] [2024-11-12 13:46:08,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007507937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163366494] [2024-11-12 13:46:08,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,136 INFO L87 Difference]: Start difference. First operand 206 states and 336 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-12 13:46:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,144 INFO L93 Difference]: Finished difference Result 373 states and 610 transitions. [2024-11-12 13:46:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,144 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-12 13:46:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,145 INFO L225 Difference]: With dead ends: 373 [2024-11-12 13:46:08,145 INFO L226 Difference]: Without dead ends: 373 [2024-11-12 13:46:08,145 INFO L434 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-12 13:46:08,146 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 30 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 100 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-12 13:46:08,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 100 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-12 13:46:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 290. [2024-11-12 13:46:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 1.6055363321799307) internal successors, (464), 289 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 464 transitions. [2024-11-12 13:46:08,154 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 464 transitions. Word has length 19 [2024-11-12 13:46:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,154 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 464 transitions. [2024-11-12 13:46:08,154 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-12 13:46:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 464 transitions. [2024-11-12 13:46:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:46:08,156 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:46:08,156 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1584211705, now seen corresponding path program 1 times [2024-11-12 13:46:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406562274] [2024-11-12 13:46:08,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,173 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-12 13:46:08,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406562274] [2024-11-12 13:46:08,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406562274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097792044] [2024-11-12 13:46:08,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,175 INFO L87 Difference]: Start difference. First operand 290 states and 464 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-12 13:46:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,183 INFO L93 Difference]: Finished difference Result 397 states and 622 transitions. [2024-11-12 13:46:08,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,184 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-12 13:46:08,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,185 INFO L225 Difference]: With dead ends: 397 [2024-11-12 13:46:08,185 INFO L226 Difference]: Without dead ends: 397 [2024-11-12 13:46:08,185 INFO L434 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-12 13:46:08,186 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 36 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 120 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-12 13:46:08,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-12 13:46:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 394. [2024-11-12 13:46:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 620 transitions. [2024-11-12 13:46:08,196 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 620 transitions. Word has length 19 [2024-11-12 13:46:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,196 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 620 transitions. [2024-11-12 13:46:08,196 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-12 13:46:08,196 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 620 transitions. [2024-11-12 13:46:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:46:08,197 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,197 INFO L218 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-12 13:46:08,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:46:08,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1835577864, now seen corresponding path program 1 times [2024-11-12 13:46:08,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476715433] [2024-11-12 13:46:08,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,233 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-12 13:46:08,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476715433] [2024-11-12 13:46:08,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476715433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365509672] [2024-11-12 13:46:08,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,235 INFO L87 Difference]: Start difference. First operand 394 states and 620 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-12 13:46:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,245 INFO L93 Difference]: Finished difference Result 409 states and 630 transitions. [2024-11-12 13:46:08,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,246 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-12 13:46:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,247 INFO L225 Difference]: With dead ends: 409 [2024-11-12 13:46:08,247 INFO L226 Difference]: Without dead ends: 409 [2024-11-12 13:46:08,247 INFO L434 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-12 13:46:08,248 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 38 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 119 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-12 13:46:08,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 119 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-12 13:46:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2024-11-12 13:46:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 628 transitions. [2024-11-12 13:46:08,255 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 628 transitions. Word has length 20 [2024-11-12 13:46:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,255 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 628 transitions. [2024-11-12 13:46:08,255 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-12 13:46:08,255 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 628 transitions. [2024-11-12 13:46:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:46:08,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,257 INFO L218 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-12 13:46:08,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:46:08,257 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1872583418, now seen corresponding path program 1 times [2024-11-12 13:46:08,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999937892] [2024-11-12 13:46:08,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,284 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-12 13:46:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999937892] [2024-11-12 13:46:08,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999937892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366930516] [2024-11-12 13:46:08,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,288 INFO L87 Difference]: Start difference. First operand 406 states and 628 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-12 13:46:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,297 INFO L93 Difference]: Finished difference Result 713 states and 1102 transitions. [2024-11-12 13:46:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,298 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-12 13:46:08,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,300 INFO L225 Difference]: With dead ends: 713 [2024-11-12 13:46:08,301 INFO L226 Difference]: Without dead ends: 713 [2024-11-12 13:46:08,301 INFO L434 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-12 13:46:08,301 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 98 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-12 13:46:08,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-11-12 13:46:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 582. [2024-11-12 13:46:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 876 transitions. [2024-11-12 13:46:08,310 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 876 transitions. Word has length 20 [2024-11-12 13:46:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,310 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 876 transitions. [2024-11-12 13:46:08,310 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-12 13:46:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 876 transitions. [2024-11-12 13:46:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:46:08,311 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,311 INFO L218 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-12 13:46:08,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:46:08,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2130748856, now seen corresponding path program 1 times [2024-11-12 13:46:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797928976] [2024-11-12 13:46:08,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,341 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-12 13:46:08,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797928976] [2024-11-12 13:46:08,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797928976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404524243] [2024-11-12 13:46:08,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,342 INFO L87 Difference]: Start difference. First operand 582 states and 876 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-12 13:46:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,356 INFO L93 Difference]: Finished difference Result 777 states and 1142 transitions. [2024-11-12 13:46:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,356 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-12 13:46:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,358 INFO L225 Difference]: With dead ends: 777 [2024-11-12 13:46:08,358 INFO L226 Difference]: Without dead ends: 777 [2024-11-12 13:46:08,358 INFO L434 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-12 13:46:08,359 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 121 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-12 13:46:08,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-12 13:46:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 774. [2024-11-12 13:46:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1140 transitions. [2024-11-12 13:46:08,372 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1140 transitions. Word has length 20 [2024-11-12 13:46:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,372 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1140 transitions. [2024-11-12 13:46:08,373 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-12 13:46:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1140 transitions. [2024-11-12 13:46:08,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:46:08,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,374 INFO L218 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-12 13:46:08,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:46:08,375 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2072784796, now seen corresponding path program 1 times [2024-11-12 13:46:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653135614] [2024-11-12 13:46:08,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,410 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-12 13:46:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653135614] [2024-11-12 13:46:08,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653135614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748266562] [2024-11-12 13:46:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,411 INFO L87 Difference]: Start difference. First operand 774 states and 1140 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-12 13:46:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,423 INFO L93 Difference]: Finished difference Result 793 states and 1142 transitions. [2024-11-12 13:46:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,424 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-12 13:46:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,425 INFO L225 Difference]: With dead ends: 793 [2024-11-12 13:46:08,426 INFO L226 Difference]: Without dead ends: 793 [2024-11-12 13:46:08,426 INFO L434 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-12 13:46:08,426 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 115 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-12 13:46:08,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-11-12 13:46:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 790. [2024-11-12 13:46:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1140 transitions. [2024-11-12 13:46:08,437 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1140 transitions. Word has length 21 [2024-11-12 13:46:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,437 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1140 transitions. [2024-11-12 13:46:08,437 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-12 13:46:08,437 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1140 transitions. [2024-11-12 13:46:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:46:08,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,438 INFO L218 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-12 13:46:08,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:46:08,438 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1635376486, now seen corresponding path program 1 times [2024-11-12 13:46:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10291599] [2024-11-12 13:46:08,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,459 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-12 13:46:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10291599] [2024-11-12 13:46:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10291599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625147688] [2024-11-12 13:46:08,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,462 INFO L87 Difference]: Start difference. First operand 790 states and 1140 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-12 13:46:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,476 INFO L93 Difference]: Finished difference Result 1353 states and 1942 transitions. [2024-11-12 13:46:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,479 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-12 13:46:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,482 INFO L225 Difference]: With dead ends: 1353 [2024-11-12 13:46:08,483 INFO L226 Difference]: Without dead ends: 1353 [2024-11-12 13:46:08,483 INFO L434 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-12 13:46:08,484 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 96 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-12 13:46:08,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 96 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-12 13:46:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1158. [2024-11-12 13:46:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1620 transitions. [2024-11-12 13:46:08,499 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1620 transitions. Word has length 21 [2024-11-12 13:46:08,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,500 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1620 transitions. [2024-11-12 13:46:08,500 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-12 13:46:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1620 transitions. [2024-11-12 13:46:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:46:08,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,501 INFO L218 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-12 13:46:08,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:46:08,501 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1893541924, now seen corresponding path program 1 times [2024-11-12 13:46:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133846884] [2024-11-12 13:46:08,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,520 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-12 13:46:08,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133846884] [2024-11-12 13:46:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133846884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712062293] [2024-11-12 13:46:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,522 INFO L87 Difference]: Start difference. First operand 1158 states and 1620 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-12 13:46:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,537 INFO L93 Difference]: Finished difference Result 1513 states and 2054 transitions. [2024-11-12 13:46:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,538 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-12 13:46:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,541 INFO L225 Difference]: With dead ends: 1513 [2024-11-12 13:46:08,541 INFO L226 Difference]: Without dead ends: 1513 [2024-11-12 13:46:08,542 INFO L434 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-12 13:46:08,542 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 34 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 122 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-12 13:46:08,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 122 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-12 13:46:08,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1510. [2024-11-12 13:46:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2052 transitions. [2024-11-12 13:46:08,565 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2052 transitions. Word has length 21 [2024-11-12 13:46:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,565 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2052 transitions. [2024-11-12 13:46:08,566 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-12 13:46:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2052 transitions. [2024-11-12 13:46:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:46:08,567 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,567 INFO L218 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-12 13:46:08,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:46:08,568 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash -836254525, now seen corresponding path program 1 times [2024-11-12 13:46:08,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96455769] [2024-11-12 13:46:08,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,588 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-12 13:46:08,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96455769] [2024-11-12 13:46:08,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96455769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553628931] [2024-11-12 13:46:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,591 INFO L87 Difference]: Start difference. First operand 1510 states and 2052 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-12 13:46:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,601 INFO L93 Difference]: Finished difference Result 1545 states and 2054 transitions. [2024-11-12 13:46:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,601 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-12 13:46:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,604 INFO L225 Difference]: With dead ends: 1545 [2024-11-12 13:46:08,605 INFO L226 Difference]: Without dead ends: 1545 [2024-11-12 13:46:08,605 INFO L434 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-12 13:46:08,606 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 111 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-12 13:46:08,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-12 13:46:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1542. [2024-11-12 13:46:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2052 transitions. [2024-11-12 13:46:08,626 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2052 transitions. Word has length 22 [2024-11-12 13:46:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,627 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2052 transitions. [2024-11-12 13:46:08,627 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-12 13:46:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2052 transitions. [2024-11-12 13:46:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:46:08,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,628 INFO L218 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-12 13:46:08,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 13:46:08,628 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1423060539, now seen corresponding path program 1 times [2024-11-12 13:46:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144449887] [2024-11-12 13:46:08,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,654 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-12 13:46:08,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144449887] [2024-11-12 13:46:08,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144449887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779316910] [2024-11-12 13:46:08,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,660 INFO L87 Difference]: Start difference. First operand 1542 states and 2052 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-12 13:46:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,683 INFO L93 Difference]: Finished difference Result 2569 states and 3366 transitions. [2024-11-12 13:46:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,684 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-12 13:46:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,692 INFO L225 Difference]: With dead ends: 2569 [2024-11-12 13:46:08,692 INFO L226 Difference]: Without dead ends: 2569 [2024-11-12 13:46:08,692 INFO L434 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-12 13:46:08,692 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 94 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-12 13:46:08,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 94 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2024-11-12 13:46:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2310. [2024-11-12 13:46:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 2980 transitions. [2024-11-12 13:46:08,750 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 2980 transitions. Word has length 22 [2024-11-12 13:46:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,751 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 2980 transitions. [2024-11-12 13:46:08,751 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-12 13:46:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 2980 transitions. [2024-11-12 13:46:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:46:08,753 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,753 INFO L218 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-12 13:46:08,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 13:46:08,755 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1164895101, now seen corresponding path program 1 times [2024-11-12 13:46:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732012068] [2024-11-12 13:46:08,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,775 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-12 13:46:08,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732012068] [2024-11-12 13:46:08,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732012068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574183141] [2024-11-12 13:46:08,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,778 INFO L87 Difference]: Start difference. First operand 2310 states and 2980 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-12 13:46:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,793 INFO L93 Difference]: Finished difference Result 2953 states and 3654 transitions. [2024-11-12 13:46:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,793 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-12 13:46:08,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,799 INFO L225 Difference]: With dead ends: 2953 [2024-11-12 13:46:08,800 INFO L226 Difference]: Without dead ends: 2953 [2024-11-12 13:46:08,800 INFO L434 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-12 13:46:08,800 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 123 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-12 13:46:08,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 123 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2024-11-12 13:46:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2950. [2024-11-12 13:46:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 3652 transitions. [2024-11-12 13:46:08,856 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 3652 transitions. Word has length 22 [2024-11-12 13:46:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,856 INFO L471 AbstractCegarLoop]: Abstraction has 2950 states and 3652 transitions. [2024-11-12 13:46:08,856 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-12 13:46:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3652 transitions. [2024-11-12 13:46:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:46:08,860 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,860 INFO L218 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, 1] [2024-11-12 13:46:08,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 13:46:08,860 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1158511217, now seen corresponding path program 1 times [2024-11-12 13:46:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074294544] [2024-11-12 13:46:08,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,884 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-12 13:46:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074294544] [2024-11-12 13:46:08,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074294544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011025199] [2024-11-12 13:46:08,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,889 INFO L87 Difference]: Start difference. First operand 2950 states and 3652 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,912 INFO L93 Difference]: Finished difference Result 3017 states and 3654 transitions. [2024-11-12 13:46:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-12 13:46:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,920 INFO L225 Difference]: With dead ends: 3017 [2024-11-12 13:46:08,920 INFO L226 Difference]: Without dead ends: 3017 [2024-11-12 13:46:08,922 INFO L434 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-12 13:46:08,922 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 35 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 107 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-12 13:46:08,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2024-11-12 13:46:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 3014. [2024-11-12 13:46:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3014 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 3652 transitions. [2024-11-12 13:46:08,964 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 3652 transitions. Word has length 23 [2024-11-12 13:46:08,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,965 INFO L471 AbstractCegarLoop]: Abstraction has 3014 states and 3652 transitions. [2024-11-12 13:46:08,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 3652 transitions. [2024-11-12 13:46:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:46:08,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,967 INFO L218 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, 1] [2024-11-12 13:46:08,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 13:46:08,967 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1745317231, now seen corresponding path program 1 times [2024-11-12 13:46:08,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868776104] [2024-11-12 13:46:08,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,981 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-12 13:46:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868776104] [2024-11-12 13:46:08,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868776104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111403859] [2024-11-12 13:46:08,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,983 INFO L87 Difference]: Start difference. First operand 3014 states and 3652 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:09,003 INFO L93 Difference]: Finished difference Result 4870 states and 5700 transitions. [2024-11-12 13:46:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:09,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-12 13:46:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:09,013 INFO L225 Difference]: With dead ends: 4870 [2024-11-12 13:46:09,013 INFO L226 Difference]: Without dead ends: 4870 [2024-11-12 13:46:09,013 INFO L434 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-12 13:46:09,014 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 90 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-12 13:46:09,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 90 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2024-11-12 13:46:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4614. [2024-11-12 13:46:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4614 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 5444 transitions. [2024-11-12 13:46:09,079 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 5444 transitions. Word has length 23 [2024-11-12 13:46:09,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:09,079 INFO L471 AbstractCegarLoop]: Abstraction has 4614 states and 5444 transitions. [2024-11-12 13:46:09,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 5444 transitions. [2024-11-12 13:46:09,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:46:09,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:09,086 INFO L218 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, 1] [2024-11-12 13:46:09,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 13:46:09,086 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:09,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:09,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1487151793, now seen corresponding path program 1 times [2024-11-12 13:46:09,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:09,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655877799] [2024-11-12 13:46:09,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:09,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:09,125 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-12 13:46:09,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655877799] [2024-11-12 13:46:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655877799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:09,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:09,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:09,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232324175] [2024-11-12 13:46:09,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:09,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:09,128 INFO L87 Difference]: Start difference. First operand 4614 states and 5444 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:09,152 INFO L93 Difference]: Finished difference Result 5763 states and 6402 transitions. [2024-11-12 13:46:09,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:09,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-12 13:46:09,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:09,153 INFO L225 Difference]: With dead ends: 5763 [2024-11-12 13:46:09,153 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 13:46:09,153 INFO L434 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-12 13:46:09,155 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 30 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 120 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-12 13:46:09,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:09,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 13:46:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 13:46:09,155 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-12 13:46:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 13:46:09,155 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-11-12 13:46:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:09,156 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 13:46:09,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 13:46:09,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 13:46:09,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-12 13:46:09,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-12 13:46:09,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 13:46:09,163 INFO L421 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, 1, 1] [2024-11-12 13:46:09,165 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 13:46:09,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:46:09 BoogieIcfgContainer [2024-11-12 13:46:09,168 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 13:46:09,169 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 13:46:09,169 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 13:46:09,169 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 13:46:09,169 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:46:07" (3/4) ... [2024-11-12 13:46:09,171 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 13:46:09,179 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-12 13:46:09,179 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-12 13:46:09,180 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 13:46:09,180 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 13:46:09,254 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 13:46:09,256 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 13:46:09,256 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 13:46:09,256 INFO L158 Benchmark]: Toolchain (without parser) took 2861.83ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 136.1MB in the beginning and 189.6MB in the end (delta: -53.5MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-12 13:46:09,256 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:46:09,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.74ms. Allocated memory is still 184.5MB. Free memory was 135.6MB in the beginning and 122.2MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 13:46:09,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.66ms. Allocated memory is still 184.5MB. Free memory was 122.2MB in the beginning and 120.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:46:09,257 INFO L158 Benchmark]: Boogie Preprocessor took 56.68ms. Allocated memory is still 184.5MB. Free memory was 120.1MB in the beginning and 118.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:46:09,257 INFO L158 Benchmark]: RCFGBuilder took 369.80ms. Allocated memory is still 184.5MB. Free memory was 118.8MB in the beginning and 104.7MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 13:46:09,257 INFO L158 Benchmark]: TraceAbstraction took 2080.01ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 104.1MB in the beginning and 194.8MB in the end (delta: -90.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:46:09,257 INFO L158 Benchmark]: Witness Printer took 87.20ms. Allocated memory is still 243.3MB. Free memory was 194.8MB in the beginning and 189.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 13:46:09,258 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.15ms. Allocated memory is still 184.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.74ms. Allocated memory is still 184.5MB. Free memory was 135.6MB in the beginning and 122.2MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.66ms. Allocated memory is still 184.5MB. Free memory was 122.2MB in the beginning and 120.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.68ms. Allocated memory is still 184.5MB. Free memory was 120.1MB in the beginning and 118.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 369.80ms. Allocated memory is still 184.5MB. Free memory was 118.8MB in the beginning and 104.7MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2080.01ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 104.1MB in the beginning and 194.8MB in the end (delta: -90.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 87.20ms. Allocated memory is still 243.3MB. Free memory was 194.8MB in the beginning and 189.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: 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: 2.0s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 787 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 787 mSDsluCounter, 2597 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 981 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1616 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4614occurred in iteration=23, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 1064 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 420 ConstructedInterpolants, 0 QuantifiedInterpolants, 844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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-12 13:46:09,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE