./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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_12.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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:07:54,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:07:54,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:07:54,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:07:54,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:07:54,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:07:54,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:07:54,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:07:54,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:07:54,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:07:54,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:07:54,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:07:54,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:07:54,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:07:54,230 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:07:54,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:07:54,230 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:07:54,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:07:54,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:07:54,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:07:54,232 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:07:54,232 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:07:54,233 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:07:54,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:07:54,233 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:07:54,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:07:54,233 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:07:54,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:07:54,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:07:54,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:07:54,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:07:54,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:07:54,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:07:54,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:07:54,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:07:54,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:07:54,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:07:54,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:07:54,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:07:54,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:07:54,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:07:54,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:07:54,237 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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2024-11-09 08:07:54,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:07:54,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:07:54,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:07:54,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:07:54,453 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:07:54,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2024-11-09 08:07:55,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:07:55,964 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:07:55,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2024-11-09 08:07:55,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99695b805/23278a532c0f4aeb8283d672d93dcefc/FLAG5764e74df [2024-11-09 08:07:56,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99695b805/23278a532c0f4aeb8283d672d93dcefc [2024-11-09 08:07:56,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:07:56,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:07:56,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:07:56,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:07:56,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:07:56,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7ad723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56, skipping insertion in model container [2024-11-09 08:07:56,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:07:56,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:07:56,628 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:07:56,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:07:56,673 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:07:56,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56 WrapperNode [2024-11-09 08:07:56,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:07:56,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:07:56,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:07:56,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:07:56,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,704 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 173 [2024-11-09 08:07:56,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:07:56,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:07:56,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:07:56,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:07:56,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,729 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-09 08:07:56,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:07:56,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:07:56,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:07:56,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:07:56,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (1/1) ... [2024-11-09 08:07:56,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:07:56,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:07:56,779 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-09 08:07:56,785 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-09 08:07:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:07:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:07:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:07:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:07:56,892 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:07:56,898 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:07:57,103 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-09 08:07:57,104 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:07:57,117 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:07:57,117 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 08:07:57,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:57 BoogieIcfgContainer [2024-11-09 08:07:57,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:07:57,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:07:57,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:07:57,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:07:57,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:07:56" (1/3) ... [2024-11-09 08:07:57,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20de8291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:07:57, skipping insertion in model container [2024-11-09 08:07:57,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:56" (2/3) ... [2024-11-09 08:07:57,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20de8291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:07:57, skipping insertion in model container [2024-11-09 08:07:57,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:57" (3/3) ... [2024-11-09 08:07:57,128 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2024-11-09 08:07:57,141 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:07:57,142 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 08:07:57,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:07:57,187 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;@5af2a3c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:07:57,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 08:07:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 46 states have (on average 1.891304347826087) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 08:07:57,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:57,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 08:07:57,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:57,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:57,203 INFO L85 PathProgramCache]: Analyzing trace with hash 28704558, now seen corresponding path program 1 times [2024-11-09 08:07:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:57,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414373469] [2024-11-09 08:07:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:57,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:57,339 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-09 08:07:57,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:57,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414373469] [2024-11-09 08:07:57,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414373469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:57,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:57,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:07:57,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581696411] [2024-11-09 08:07:57,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:57,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 08:07:57,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:57,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 08:07:57,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 08:07:57,368 INFO L87 Difference]: Start difference. First operand has 49 states, 46 states have (on average 1.891304347826087) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-09 08:07:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:57,380 INFO L93 Difference]: Finished difference Result 48 states and 83 transitions. [2024-11-09 08:07:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 08:07:57,382 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-09 08:07:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:57,388 INFO L225 Difference]: With dead ends: 48 [2024-11-09 08:07:57,388 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 08:07:57,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 08:07:57,399 INFO L432 NwaCegarLoop]: 83 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, 83 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-09 08:07:57,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 08:07:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-09 08:07:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 45 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2024-11-09 08:07:57,440 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 5 [2024-11-09 08:07:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:57,441 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2024-11-09 08:07:57,441 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-09 08:07:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2024-11-09 08:07:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:07:57,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:57,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:07:57,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:07:57,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:57,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash 889699054, now seen corresponding path program 1 times [2024-11-09 08:07:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:57,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396169075] [2024-11-09 08:07:57,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:57,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:57,568 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-09 08:07:57,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:57,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396169075] [2024-11-09 08:07:57,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396169075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:57,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:57,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:07:57,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484749077] [2024-11-09 08:07:57,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:57,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:57,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:57,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:57,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:57,575 INFO L87 Difference]: Start difference. First operand 46 states and 81 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-09 08:07:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:57,594 INFO L93 Difference]: Finished difference Result 45 states and 80 transitions. [2024-11-09 08:07:57,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:57,595 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-09 08:07:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:57,596 INFO L225 Difference]: With dead ends: 45 [2024-11-09 08:07:57,596 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 08:07:57,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:57,600 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 80 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-09 08:07:57,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 80 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 08:07:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 08:07:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2024-11-09 08:07:57,609 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 6 [2024-11-09 08:07:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:57,613 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2024-11-09 08:07:57,613 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-09 08:07:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2024-11-09 08:07:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 08:07:57,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:57,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:57,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:07:57,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:57,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1359893460, now seen corresponding path program 1 times [2024-11-09 08:07:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:57,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876940820] [2024-11-09 08:07:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:57,694 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-09 08:07:57,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:57,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876940820] [2024-11-09 08:07:57,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876940820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:57,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:57,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:57,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594196273] [2024-11-09 08:07:57,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:57,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:57,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:57,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:57,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:57,697 INFO L87 Difference]: Start difference. First operand 43 states and 78 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-09 08:07:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:57,715 INFO L93 Difference]: Finished difference Result 83 states and 151 transitions. [2024-11-09 08:07:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:57,716 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-09 08:07:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:57,717 INFO L225 Difference]: With dead ends: 83 [2024-11-09 08:07:57,717 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 08:07:57,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:57,718 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 154 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-09 08:07:57,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 08:07:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2024-11-09 08:07:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 103 transitions. [2024-11-09 08:07:57,724 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 103 transitions. Word has length 20 [2024-11-09 08:07:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:57,725 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 103 transitions. [2024-11-09 08:07:57,725 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-09 08:07:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 103 transitions. [2024-11-09 08:07:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 08:07:57,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:57,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:57,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:07:57,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:57,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:57,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1914005482, now seen corresponding path program 1 times [2024-11-09 08:07:57,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:57,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223683724] [2024-11-09 08:07:57,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:57,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:57,776 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-09 08:07:57,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223683724] [2024-11-09 08:07:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223683724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:57,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:57,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:57,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734784446] [2024-11-09 08:07:57,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:57,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:57,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:57,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:57,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:57,780 INFO L87 Difference]: Start difference. First operand 56 states and 103 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-09 08:07:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:57,807 INFO L93 Difference]: Finished difference Result 83 states and 149 transitions. [2024-11-09 08:07:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:57,808 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-09 08:07:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:57,809 INFO L225 Difference]: With dead ends: 83 [2024-11-09 08:07:57,809 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 08:07:57,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:57,810 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 173 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-09 08:07:57,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 08:07:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-11-09 08:07:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 147 transitions. [2024-11-09 08:07:57,835 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 147 transitions. Word has length 20 [2024-11-09 08:07:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:57,835 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 147 transitions. [2024-11-09 08:07:57,836 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-09 08:07:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 147 transitions. [2024-11-09 08:07:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 08:07:57,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:57,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:57,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:07:57,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:57,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:57,846 INFO L85 PathProgramCache]: Analyzing trace with hash 799562590, now seen corresponding path program 1 times [2024-11-09 08:07:57,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:57,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925637283] [2024-11-09 08:07:57,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:57,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:57,940 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-09 08:07:57,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:57,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925637283] [2024-11-09 08:07:57,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925637283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:57,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:57,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:57,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994347501] [2024-11-09 08:07:57,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:57,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:57,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:57,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:57,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:57,942 INFO L87 Difference]: Start difference. First operand 80 states and 147 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-09 08:07:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:57,964 INFO L93 Difference]: Finished difference Result 86 states and 151 transitions. [2024-11-09 08:07:57,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:57,964 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-09 08:07:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:57,965 INFO L225 Difference]: With dead ends: 86 [2024-11-09 08:07:57,965 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 08:07:57,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:57,966 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 61 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 195 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-09 08:07:57,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 08:07:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-11-09 08:07:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 149 transitions. [2024-11-09 08:07:57,978 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 149 transitions. Word has length 21 [2024-11-09 08:07:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:57,978 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 149 transitions. [2024-11-09 08:07:57,978 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-09 08:07:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 149 transitions. [2024-11-09 08:07:57,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 08:07:57,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:57,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:57,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:07:57,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:57,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:57,982 INFO L85 PathProgramCache]: Analyzing trace with hash -788785312, now seen corresponding path program 1 times [2024-11-09 08:07:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:57,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909375229] [2024-11-09 08:07:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:57,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,034 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-09 08:07:58,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909375229] [2024-11-09 08:07:58,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909375229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550985928] [2024-11-09 08:07:58,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,039 INFO L87 Difference]: Start difference. First operand 83 states and 149 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-09 08:07:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,058 INFO L93 Difference]: Finished difference Result 157 states and 284 transitions. [2024-11-09 08:07:58,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,058 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-09 08:07:58,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,059 INFO L225 Difference]: With dead ends: 157 [2024-11-09 08:07:58,060 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 08:07:58,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,061 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 56 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 152 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-09 08:07:58,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 08:07:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2024-11-09 08:07:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 198 transitions. [2024-11-09 08:07:58,077 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 198 transitions. Word has length 21 [2024-11-09 08:07:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,077 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 198 transitions. [2024-11-09 08:07:58,077 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-09 08:07:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 198 transitions. [2024-11-09 08:07:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 08:07:58,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 08:07:58,078 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1809853666, now seen corresponding path program 1 times [2024-11-09 08:07:58,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092245808] [2024-11-09 08:07:58,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,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-09 08:07:58,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092245808] [2024-11-09 08:07:58,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092245808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053716577] [2024-11-09 08:07:58,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,129 INFO L87 Difference]: Start difference. First operand 110 states and 198 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-09 08:07:58,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,150 INFO L93 Difference]: Finished difference Result 159 states and 282 transitions. [2024-11-09 08:07:58,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,151 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-09 08:07:58,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,151 INFO L225 Difference]: With dead ends: 159 [2024-11-09 08:07:58,151 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 08:07:58,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,156 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 174 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-09 08:07:58,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 08:07:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2024-11-09 08:07:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 280 transitions. [2024-11-09 08:07:58,166 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 280 transitions. Word has length 21 [2024-11-09 08:07:58,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,168 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 280 transitions. [2024-11-09 08:07:58,169 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-09 08:07:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 280 transitions. [2024-11-09 08:07:58,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 08:07:58,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 08:07:58,170 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1324056565, now seen corresponding path program 1 times [2024-11-09 08:07:58,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701597457] [2024-11-09 08:07:58,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,214 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-09 08:07:58,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701597457] [2024-11-09 08:07:58,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701597457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542916109] [2024-11-09 08:07:58,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,217 INFO L87 Difference]: Start difference. First operand 156 states and 280 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-09 08:07:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,231 INFO L93 Difference]: Finished difference Result 161 states and 282 transitions. [2024-11-09 08:07:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,231 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-09 08:07:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,232 INFO L225 Difference]: With dead ends: 161 [2024-11-09 08:07:58,232 INFO L226 Difference]: Without dead ends: 161 [2024-11-09 08:07:58,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,233 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 191 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-09 08:07:58,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-09 08:07:58,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2024-11-09 08:07:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 280 transitions. [2024-11-09 08:07:58,248 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 280 transitions. Word has length 22 [2024-11-09 08:07:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,249 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 280 transitions. [2024-11-09 08:07:58,249 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-09 08:07:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 280 transitions. [2024-11-09 08:07:58,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 08:07:58,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 08:07:58,250 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash -264291337, now seen corresponding path program 1 times [2024-11-09 08:07:58,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773080283] [2024-11-09 08:07:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,289 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-09 08:07:58,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773080283] [2024-11-09 08:07:58,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773080283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941899303] [2024-11-09 08:07:58,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,293 INFO L87 Difference]: Start difference. First operand 158 states and 280 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-09 08:07:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,305 INFO L93 Difference]: Finished difference Result 305 states and 534 transitions. [2024-11-09 08:07:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,305 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-09 08:07:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,309 INFO L225 Difference]: With dead ends: 305 [2024-11-09 08:07:58,309 INFO L226 Difference]: Without dead ends: 305 [2024-11-09 08:07:58,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,310 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 154 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-09 08:07:58,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-09 08:07:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2024-11-09 08:07:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.7674418604651163) internal successors, (532), 301 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 532 transitions. [2024-11-09 08:07:58,326 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 532 transitions. Word has length 22 [2024-11-09 08:07:58,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,328 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 532 transitions. [2024-11-09 08:07:58,328 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-09 08:07:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 532 transitions. [2024-11-09 08:07:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 08:07:58,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 08:07:58,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash 756777017, now seen corresponding path program 1 times [2024-11-09 08:07:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446005358] [2024-11-09 08:07:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,360 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-09 08:07:58,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446005358] [2024-11-09 08:07:58,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446005358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182710599] [2024-11-09 08:07:58,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,364 INFO L87 Difference]: Start difference. First operand 302 states and 532 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-09 08:07:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,375 INFO L93 Difference]: Finished difference Result 385 states and 682 transitions. [2024-11-09 08:07:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,375 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-09 08:07:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,376 INFO L225 Difference]: With dead ends: 385 [2024-11-09 08:07:58,376 INFO L226 Difference]: Without dead ends: 385 [2024-11-09 08:07:58,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,377 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 209 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-09 08:07:58,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 209 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-09 08:07:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 302. [2024-11-09 08:07:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 528 transitions. [2024-11-09 08:07:58,391 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 528 transitions. Word has length 22 [2024-11-09 08:07:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,391 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 528 transitions. [2024-11-09 08:07:58,391 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-09 08:07:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 528 transitions. [2024-11-09 08:07:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:07:58,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 08:07:58,395 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash 403511177, now seen corresponding path program 1 times [2024-11-09 08:07:58,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936958834] [2024-11-09 08:07:58,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,423 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-09 08:07:58,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936958834] [2024-11-09 08:07:58,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936958834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205338566] [2024-11-09 08:07:58,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,424 INFO L87 Difference]: Start difference. First operand 302 states and 528 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-09 08:07:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,436 INFO L93 Difference]: Finished difference Result 565 states and 994 transitions. [2024-11-09 08:07:58,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,437 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-09 08:07:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,438 INFO L225 Difference]: With dead ends: 565 [2024-11-09 08:07:58,438 INFO L226 Difference]: Without dead ends: 565 [2024-11-09 08:07:58,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,439 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 50 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 148 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-09 08:07:58,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-09 08:07:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 418. [2024-11-09 08:07:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.7266187050359711) internal successors, (720), 417 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 720 transitions. [2024-11-09 08:07:58,446 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 720 transitions. Word has length 23 [2024-11-09 08:07:58,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,446 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 720 transitions. [2024-11-09 08:07:58,447 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-09 08:07:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 720 transitions. [2024-11-09 08:07:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:07:58,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 08:07:58,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash -617557177, now seen corresponding path program 1 times [2024-11-09 08:07:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888958173] [2024-11-09 08:07:58,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,468 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-09 08:07:58,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888958173] [2024-11-09 08:07:58,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888958173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44050876] [2024-11-09 08:07:58,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,470 INFO L87 Difference]: Start difference. First operand 418 states and 720 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-09 08:07:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,480 INFO L93 Difference]: Finished difference Result 589 states and 1006 transitions. [2024-11-09 08:07:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,481 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-09 08:07:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,483 INFO L225 Difference]: With dead ends: 589 [2024-11-09 08:07:58,483 INFO L226 Difference]: Without dead ends: 589 [2024-11-09 08:07:58,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,483 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 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-09 08:07:58,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-09 08:07:58,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 586. [2024-11-09 08:07:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 1.7162393162393161) internal successors, (1004), 585 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1004 transitions. [2024-11-09 08:07:58,500 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1004 transitions. Word has length 23 [2024-11-09 08:07:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,500 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 1004 transitions. [2024-11-09 08:07:58,500 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-09 08:07:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1004 transitions. [2024-11-09 08:07:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:07:58,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 08:07:58,501 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash -369436798, now seen corresponding path program 1 times [2024-11-09 08:07:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544912897] [2024-11-09 08:07:58,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,528 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-09 08:07:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544912897] [2024-11-09 08:07:58,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544912897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411821052] [2024-11-09 08:07:58,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,530 INFO L87 Difference]: Start difference. First operand 586 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,540 INFO L93 Difference]: Finished difference Result 601 states and 1014 transitions. [2024-11-09 08:07:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 08:07:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,542 INFO L225 Difference]: With dead ends: 601 [2024-11-09 08:07:58,542 INFO L226 Difference]: Without dead ends: 601 [2024-11-09 08:07:58,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,543 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 183 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-09 08:07:58,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-09 08:07:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 598. [2024-11-09 08:07:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1012 transitions. [2024-11-09 08:07:58,551 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1012 transitions. Word has length 24 [2024-11-09 08:07:58,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,552 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 1012 transitions. [2024-11-09 08:07:58,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1012 transitions. [2024-11-09 08:07:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:07:58,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 08:07:58,553 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1957784700, now seen corresponding path program 1 times [2024-11-09 08:07:58,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900259483] [2024-11-09 08:07:58,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,571 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-09 08:07:58,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900259483] [2024-11-09 08:07:58,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900259483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068497509] [2024-11-09 08:07:58,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,572 INFO L87 Difference]: Start difference. First operand 598 states and 1012 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,583 INFO L93 Difference]: Finished difference Result 1097 states and 1870 transitions. [2024-11-09 08:07:58,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 08:07:58,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,586 INFO L225 Difference]: With dead ends: 1097 [2024-11-09 08:07:58,586 INFO L226 Difference]: Without dead ends: 1097 [2024-11-09 08:07:58,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,587 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 146 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-09 08:07:58,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 146 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-09 08:07:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 838. [2024-11-09 08:07:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1388 transitions. [2024-11-09 08:07:58,599 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1388 transitions. Word has length 24 [2024-11-09 08:07:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,600 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1388 transitions. [2024-11-09 08:07:58,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1388 transitions. [2024-11-09 08:07:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:07:58,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 08:07:58,601 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1316114242, now seen corresponding path program 1 times [2024-11-09 08:07:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628368282] [2024-11-09 08:07:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,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-09 08:07:58,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628368282] [2024-11-09 08:07:58,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628368282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730461154] [2024-11-09 08:07:58,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,621 INFO L87 Difference]: Start difference. First operand 838 states and 1388 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,634 INFO L93 Difference]: Finished difference Result 1161 states and 1910 transitions. [2024-11-09 08:07:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 08:07:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,638 INFO L225 Difference]: With dead ends: 1161 [2024-11-09 08:07:58,638 INFO L226 Difference]: Without dead ends: 1161 [2024-11-09 08:07:58,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,639 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 177 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-09 08:07:58,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-11-09 08:07:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1158. [2024-11-09 08:07:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1908 transitions. [2024-11-09 08:07:58,675 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1908 transitions. Word has length 24 [2024-11-09 08:07:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,676 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1908 transitions. [2024-11-09 08:07:58,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1908 transitions. [2024-11-09 08:07:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:07:58,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 08:07:58,677 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,677 INFO L85 PathProgramCache]: Analyzing trace with hash -555154382, now seen corresponding path program 1 times [2024-11-09 08:07:58,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742739173] [2024-11-09 08:07:58,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,693 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-09 08:07:58,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742739173] [2024-11-09 08:07:58,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742739173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39911148] [2024-11-09 08:07:58,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,695 INFO L87 Difference]: Start difference. First operand 1158 states and 1908 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,707 INFO L93 Difference]: Finished difference Result 1177 states and 1910 transitions. [2024-11-09 08:07:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 08:07:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,710 INFO L225 Difference]: With dead ends: 1177 [2024-11-09 08:07:58,710 INFO L226 Difference]: Without dead ends: 1177 [2024-11-09 08:07:58,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,711 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 179 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-09 08:07:58,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2024-11-09 08:07:58,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1174. [2024-11-09 08:07:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1908 transitions. [2024-11-09 08:07:58,729 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1908 transitions. Word has length 25 [2024-11-09 08:07:58,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,729 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1908 transitions. [2024-11-09 08:07:58,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1908 transitions. [2024-11-09 08:07:58,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:07:58,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 08:07:58,731 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2143502284, now seen corresponding path program 1 times [2024-11-09 08:07:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409531516] [2024-11-09 08:07:58,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,755 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-09 08:07:58,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409531516] [2024-11-09 08:07:58,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409531516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691380746] [2024-11-09 08:07:58,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,758 INFO L87 Difference]: Start difference. First operand 1174 states and 1908 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,775 INFO L93 Difference]: Finished difference Result 2121 states and 3478 transitions. [2024-11-09 08:07:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 08:07:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,781 INFO L225 Difference]: With dead ends: 2121 [2024-11-09 08:07:58,781 INFO L226 Difference]: Without dead ends: 2121 [2024-11-09 08:07:58,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,782 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 44 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 144 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-09 08:07:58,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2024-11-09 08:07:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1670. [2024-11-09 08:07:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2644 transitions. [2024-11-09 08:07:58,810 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2644 transitions. Word has length 25 [2024-11-09 08:07:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,811 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2644 transitions. [2024-11-09 08:07:58,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2644 transitions. [2024-11-09 08:07:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:07:58,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 08:07:58,813 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1130396658, now seen corresponding path program 1 times [2024-11-09 08:07:58,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942018065] [2024-11-09 08:07:58,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,833 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-09 08:07:58,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942018065] [2024-11-09 08:07:58,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942018065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98239487] [2024-11-09 08:07:58,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,834 INFO L87 Difference]: Start difference. First operand 1670 states and 2644 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,864 INFO L93 Difference]: Finished difference Result 2281 states and 3590 transitions. [2024-11-09 08:07:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 08:07:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,873 INFO L225 Difference]: With dead ends: 2281 [2024-11-09 08:07:58,873 INFO L226 Difference]: Without dead ends: 2281 [2024-11-09 08:07:58,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,875 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 178 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-09 08:07:58,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2024-11-09 08:07:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2278. [2024-11-09 08:07:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 3588 transitions. [2024-11-09 08:07:58,908 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 3588 transitions. Word has length 25 [2024-11-09 08:07:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,908 INFO L471 AbstractCegarLoop]: Abstraction has 2278 states and 3588 transitions. [2024-11-09 08:07:58,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 3588 transitions. [2024-11-09 08:07:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:07:58,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 08:07:58,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2017421619, now seen corresponding path program 1 times [2024-11-09 08:07:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456501574] [2024-11-09 08:07:58,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,943 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-09 08:07:58,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456501574] [2024-11-09 08:07:58,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456501574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91553938] [2024-11-09 08:07:58,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,944 INFO L87 Difference]: Start difference. First operand 2278 states and 3588 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,982 INFO L93 Difference]: Finished difference Result 2313 states and 3590 transitions. [2024-11-09 08:07:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 08:07:58,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,996 INFO L225 Difference]: With dead ends: 2313 [2024-11-09 08:07:58,996 INFO L226 Difference]: Without dead ends: 2313 [2024-11-09 08:07:58,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,999 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 175 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-09 08:07:59,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-11-09 08:07:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2310. [2024-11-09 08:07:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3588 transitions. [2024-11-09 08:07:59,072 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3588 transitions. Word has length 26 [2024-11-09 08:07:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,072 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 3588 transitions. [2024-11-09 08:07:59,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3588 transitions. [2024-11-09 08:07:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:07:59,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 08:07:59,078 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash 689197775, now seen corresponding path program 1 times [2024-11-09 08:07:59,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093050622] [2024-11-09 08:07:59,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,117 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-09 08:07:59,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093050622] [2024-11-09 08:07:59,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093050622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348411445] [2024-11-09 08:07:59,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,119 INFO L87 Difference]: Start difference. First operand 2310 states and 3588 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,193 INFO L93 Difference]: Finished difference Result 4105 states and 6438 transitions. [2024-11-09 08:07:59,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 08:07:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,216 INFO L225 Difference]: With dead ends: 4105 [2024-11-09 08:07:59,216 INFO L226 Difference]: Without dead ends: 4105 [2024-11-09 08:07:59,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,217 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 142 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-09 08:07:59,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 142 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2024-11-09 08:07:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 3334. [2024-11-09 08:07:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 5028 transitions. [2024-11-09 08:07:59,311 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 5028 transitions. Word has length 26 [2024-11-09 08:07:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,311 INFO L471 AbstractCegarLoop]: Abstraction has 3334 states and 5028 transitions. [2024-11-09 08:07:59,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 5028 transitions. [2024-11-09 08:07:59,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:07:59,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 08:07:59,314 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,315 INFO L85 PathProgramCache]: Analyzing trace with hash -331870579, now seen corresponding path program 1 times [2024-11-09 08:07:59,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136782832] [2024-11-09 08:07:59,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,332 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-09 08:07:59,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136782832] [2024-11-09 08:07:59,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136782832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564732400] [2024-11-09 08:07:59,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,333 INFO L87 Difference]: Start difference. First operand 3334 states and 5028 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,356 INFO L93 Difference]: Finished difference Result 4489 states and 6726 transitions. [2024-11-09 08:07:59,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 08:07:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,367 INFO L225 Difference]: With dead ends: 4489 [2024-11-09 08:07:59,367 INFO L226 Difference]: Without dead ends: 4489 [2024-11-09 08:07:59,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,368 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 179 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-09 08:07:59,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2024-11-09 08:07:59,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4486. [2024-11-09 08:07:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4486 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4486 states to 4486 states and 6724 transitions. [2024-11-09 08:07:59,441 INFO L78 Accepts]: Start accepts. Automaton has 4486 states and 6724 transitions. Word has length 26 [2024-11-09 08:07:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,441 INFO L471 AbstractCegarLoop]: Abstraction has 4486 states and 6724 transitions. [2024-11-09 08:07:59,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4486 states and 6724 transitions. [2024-11-09 08:07:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 08:07:59,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 08:07:59,444 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash -103055139, now seen corresponding path program 1 times [2024-11-09 08:07:59,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624037317] [2024-11-09 08:07:59,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,461 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-09 08:07:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624037317] [2024-11-09 08:07:59,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624037317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944705174] [2024-11-09 08:07:59,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,462 INFO L87 Difference]: Start difference. First operand 4486 states and 6724 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,492 INFO L93 Difference]: Finished difference Result 4553 states and 6726 transitions. [2024-11-09 08:07:59,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 08:07:59,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,512 INFO L225 Difference]: With dead ends: 4553 [2024-11-09 08:07:59,512 INFO L226 Difference]: Without dead ends: 4553 [2024-11-09 08:07:59,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,513 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 171 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-09 08:07:59,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2024-11-09 08:07:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 4550. [2024-11-09 08:07:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4550 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 6724 transitions. [2024-11-09 08:07:59,632 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 6724 transitions. Word has length 27 [2024-11-09 08:07:59,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,633 INFO L471 AbstractCegarLoop]: Abstraction has 4550 states and 6724 transitions. [2024-11-09 08:07:59,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 6724 transitions. [2024-11-09 08:07:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 08:07:59,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 08:07:59,639 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1691403041, now seen corresponding path program 1 times [2024-11-09 08:07:59,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103693876] [2024-11-09 08:07:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,660 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-09 08:07:59,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103693876] [2024-11-09 08:07:59,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103693876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707192071] [2024-11-09 08:07:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,663 INFO L87 Difference]: Start difference. First operand 4550 states and 6724 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,741 INFO L93 Difference]: Finished difference Result 7945 states and 11846 transitions. [2024-11-09 08:07:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 08:07:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,761 INFO L225 Difference]: With dead ends: 7945 [2024-11-09 08:07:59,761 INFO L226 Difference]: Without dead ends: 7945 [2024-11-09 08:07:59,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,762 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 38 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 140 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-09 08:07:59,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7945 states. [2024-11-09 08:07:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7945 to 6662. [2024-11-09 08:07:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6662 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 9540 transitions. [2024-11-09 08:07:59,891 INFO L78 Accepts]: Start accepts. Automaton has 6662 states and 9540 transitions. Word has length 27 [2024-11-09 08:07:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,892 INFO L471 AbstractCegarLoop]: Abstraction has 6662 states and 9540 transitions. [2024-11-09 08:07:59,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 6662 states and 9540 transitions. [2024-11-09 08:07:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 08:07:59,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 08:07:59,898 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1582495901, now seen corresponding path program 1 times [2024-11-09 08:07:59,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053541536] [2024-11-09 08:07:59,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,914 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-09 08:07:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053541536] [2024-11-09 08:07:59,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053541536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703517307] [2024-11-09 08:07:59,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,916 INFO L87 Difference]: Start difference. First operand 6662 states and 9540 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,949 INFO L93 Difference]: Finished difference Result 8841 states and 12550 transitions. [2024-11-09 08:07:59,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 08:07:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,961 INFO L225 Difference]: With dead ends: 8841 [2024-11-09 08:07:59,961 INFO L226 Difference]: Without dead ends: 8841 [2024-11-09 08:07:59,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,962 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 180 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-09 08:07:59,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8841 states. [2024-11-09 08:08:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8841 to 8838. [2024-11-09 08:08:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8838 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8838 states to 8838 states and 12548 transitions. [2024-11-09 08:08:00,109 INFO L78 Accepts]: Start accepts. Automaton has 8838 states and 12548 transitions. Word has length 27 [2024-11-09 08:08:00,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:00,109 INFO L471 AbstractCegarLoop]: Abstraction has 8838 states and 12548 transitions. [2024-11-09 08:08:00,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 8838 states and 12548 transitions. [2024-11-09 08:08:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 08:08:00,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:00,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:00,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 08:08:00,116 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:00,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash -887225832, now seen corresponding path program 1 times [2024-11-09 08:08:00,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:00,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970326110] [2024-11-09 08:08:00,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:00,133 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-09 08:08:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:00,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970326110] [2024-11-09 08:08:00,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970326110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:00,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:00,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:00,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192472254] [2024-11-09 08:08:00,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:00,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:00,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:00,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:00,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,135 INFO L87 Difference]: Start difference. First operand 8838 states and 12548 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:00,169 INFO L93 Difference]: Finished difference Result 8969 states and 12550 transitions. [2024-11-09 08:08:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:00,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 08:08:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:00,182 INFO L225 Difference]: With dead ends: 8969 [2024-11-09 08:08:00,182 INFO L226 Difference]: Without dead ends: 8969 [2024-11-09 08:08:00,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,183 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 167 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-09 08:08:00,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8969 states. [2024-11-09 08:08:00,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8969 to 8966. [2024-11-09 08:08:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8966 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 12548 transitions. [2024-11-09 08:08:00,298 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 12548 transitions. Word has length 28 [2024-11-09 08:08:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:00,298 INFO L471 AbstractCegarLoop]: Abstraction has 8966 states and 12548 transitions. [2024-11-09 08:08:00,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 12548 transitions. [2024-11-09 08:08:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 08:08:00,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:00,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:00,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 08:08:00,305 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:00,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1819393562, now seen corresponding path program 1 times [2024-11-09 08:08:00,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:00,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886031072] [2024-11-09 08:08:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:00,320 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-09 08:08:00,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:00,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886031072] [2024-11-09 08:08:00,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886031072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:00,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:00,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:00,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284737588] [2024-11-09 08:08:00,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:00,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:00,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:00,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:00,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,322 INFO L87 Difference]: Start difference. First operand 8966 states and 12548 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:00,410 INFO L93 Difference]: Finished difference Result 15369 states and 21638 transitions. [2024-11-09 08:08:00,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:00,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 08:08:00,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:00,429 INFO L225 Difference]: With dead ends: 15369 [2024-11-09 08:08:00,429 INFO L226 Difference]: Without dead ends: 15369 [2024-11-09 08:08:00,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,430 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 138 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-09 08:08:00,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:00,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15369 states. [2024-11-09 08:08:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15369 to 13318. [2024-11-09 08:08:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13318 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13318 states to 13318 states and 18052 transitions. [2024-11-09 08:08:00,640 INFO L78 Accepts]: Start accepts. Automaton has 13318 states and 18052 transitions. Word has length 28 [2024-11-09 08:08:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:00,640 INFO L471 AbstractCegarLoop]: Abstraction has 13318 states and 18052 transitions. [2024-11-09 08:08:00,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 13318 states and 18052 transitions. [2024-11-09 08:08:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 08:08:00,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:00,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:00,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 08:08:00,652 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:00,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash 798325208, now seen corresponding path program 1 times [2024-11-09 08:08:00,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:00,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324136602] [2024-11-09 08:08:00,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:00,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:00,675 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-09 08:08:00,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:00,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324136602] [2024-11-09 08:08:00,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324136602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:00,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:00,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:00,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971064143] [2024-11-09 08:08:00,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:00,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:00,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:00,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,677 INFO L87 Difference]: Start difference. First operand 13318 states and 18052 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:00,811 INFO L93 Difference]: Finished difference Result 17417 states and 23302 transitions. [2024-11-09 08:08:00,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:00,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 08:08:00,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:00,838 INFO L225 Difference]: With dead ends: 17417 [2024-11-09 08:08:00,838 INFO L226 Difference]: Without dead ends: 17417 [2024-11-09 08:08:00,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,839 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 181 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-09 08:08:00,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17417 states. [2024-11-09 08:08:01,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17417 to 17414. [2024-11-09 08:08:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17414 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17414 states to 17414 states and 23300 transitions. [2024-11-09 08:08:01,058 INFO L78 Accepts]: Start accepts. Automaton has 17414 states and 23300 transitions. Word has length 28 [2024-11-09 08:08:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:01,059 INFO L471 AbstractCegarLoop]: Abstraction has 17414 states and 23300 transitions. [2024-11-09 08:08:01,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 17414 states and 23300 transitions. [2024-11-09 08:08:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:08:01,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:01,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:01,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 08:08:01,072 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:01,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash 573297032, now seen corresponding path program 1 times [2024-11-09 08:08:01,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:01,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938535727] [2024-11-09 08:08:01,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:01,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:01,088 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-09 08:08:01,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:01,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938535727] [2024-11-09 08:08:01,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938535727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:01,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:01,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:01,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578236765] [2024-11-09 08:08:01,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:01,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:01,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:01,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:01,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:01,162 INFO L87 Difference]: Start difference. First operand 17414 states and 23300 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:01,308 INFO L93 Difference]: Finished difference Result 17673 states and 23302 transitions. [2024-11-09 08:08:01,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:01,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 08:08:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:01,336 INFO L225 Difference]: With dead ends: 17673 [2024-11-09 08:08:01,336 INFO L226 Difference]: Without dead ends: 17673 [2024-11-09 08:08:01,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:01,336 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 163 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-09 08:08:01,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17673 states. [2024-11-09 08:08:01,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17673 to 17670. [2024-11-09 08:08:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17670 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17670 states to 17670 states and 23300 transitions. [2024-11-09 08:08:01,635 INFO L78 Accepts]: Start accepts. Automaton has 17670 states and 23300 transitions. Word has length 29 [2024-11-09 08:08:01,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:01,636 INFO L471 AbstractCegarLoop]: Abstraction has 17670 states and 23300 transitions. [2024-11-09 08:08:01,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 17670 states and 23300 transitions. [2024-11-09 08:08:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:08:01,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:01,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:01,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 08:08:01,654 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:01,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1015050870, now seen corresponding path program 1 times [2024-11-09 08:08:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:01,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466647038] [2024-11-09 08:08:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:01,677 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-09 08:08:01,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:01,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466647038] [2024-11-09 08:08:01,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466647038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:01,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:01,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:01,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92628003] [2024-11-09 08:08:01,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:01,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:01,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:01,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:01,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:01,679 INFO L87 Difference]: Start difference. First operand 17670 states and 23300 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:01,768 INFO L93 Difference]: Finished difference Result 29705 states and 39174 transitions. [2024-11-09 08:08:01,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:01,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 08:08:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:01,821 INFO L225 Difference]: With dead ends: 29705 [2024-11-09 08:08:01,822 INFO L226 Difference]: Without dead ends: 29705 [2024-11-09 08:08:01,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:01,823 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 32 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 136 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-09 08:08:01,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29705 states. [2024-11-09 08:08:02,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29705 to 26630. [2024-11-09 08:08:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26630 states, 26629 states have (on average 1.2787562431935109) internal successors, (34052), 26629 states have internal predecessors, (34052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:02,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26630 states to 26630 states and 34052 transitions. [2024-11-09 08:08:02,278 INFO L78 Accepts]: Start accepts. Automaton has 26630 states and 34052 transitions. Word has length 29 [2024-11-09 08:08:02,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:02,278 INFO L471 AbstractCegarLoop]: Abstraction has 26630 states and 34052 transitions. [2024-11-09 08:08:02,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:02,279 INFO L276 IsEmpty]: Start isEmpty. Operand 26630 states and 34052 transitions. [2024-11-09 08:08:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:08:02,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:02,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:02,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 08:08:02,299 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:02,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2036119224, now seen corresponding path program 1 times [2024-11-09 08:08:02,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:02,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294358455] [2024-11-09 08:08:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:02,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:02,317 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-09 08:08:02,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:02,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294358455] [2024-11-09 08:08:02,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294358455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:02,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:02,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:02,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287467469] [2024-11-09 08:08:02,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:02,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:02,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:02,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:02,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:02,319 INFO L87 Difference]: Start difference. First operand 26630 states and 34052 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:02,381 INFO L93 Difference]: Finished difference Result 34313 states and 43014 transitions. [2024-11-09 08:08:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 08:08:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:02,427 INFO L225 Difference]: With dead ends: 34313 [2024-11-09 08:08:02,428 INFO L226 Difference]: Without dead ends: 34313 [2024-11-09 08:08:02,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:02,428 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 182 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-09 08:08:02,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34313 states. [2024-11-09 08:08:02,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34313 to 34310. [2024-11-09 08:08:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34310 states, 34309 states have (on average 1.2536652190387363) internal successors, (43012), 34309 states have internal predecessors, (43012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34310 states to 34310 states and 43012 transitions. [2024-11-09 08:08:03,069 INFO L78 Accepts]: Start accepts. Automaton has 34310 states and 43012 transitions. Word has length 29 [2024-11-09 08:08:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:03,070 INFO L471 AbstractCegarLoop]: Abstraction has 34310 states and 43012 transitions. [2024-11-09 08:08:03,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 34310 states and 43012 transitions. [2024-11-09 08:08:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:08:03,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:03,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:03,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 08:08:03,085 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:03,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:03,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1395123869, now seen corresponding path program 1 times [2024-11-09 08:08:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:03,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846041216] [2024-11-09 08:08:03,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:03,112 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-09 08:08:03,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:03,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846041216] [2024-11-09 08:08:03,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846041216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:03,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:03,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:03,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842331651] [2024-11-09 08:08:03,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:03,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:03,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:03,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:03,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:03,114 INFO L87 Difference]: Start difference. First operand 34310 states and 43012 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:03,179 INFO L93 Difference]: Finished difference Result 34825 states and 43014 transitions. [2024-11-09 08:08:03,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:03,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 08:08:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:03,227 INFO L225 Difference]: With dead ends: 34825 [2024-11-09 08:08:03,228 INFO L226 Difference]: Without dead ends: 34825 [2024-11-09 08:08:03,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:03,228 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 159 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-09 08:08:03,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34825 states. [2024-11-09 08:08:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34825 to 34822. [2024-11-09 08:08:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34822 states, 34821 states have (on average 1.235231613107033) internal successors, (43012), 34821 states have internal predecessors, (43012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34822 states to 34822 states and 43012 transitions. [2024-11-09 08:08:04,023 INFO L78 Accepts]: Start accepts. Automaton has 34822 states and 43012 transitions. Word has length 30 [2024-11-09 08:08:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:04,023 INFO L471 AbstractCegarLoop]: Abstraction has 34822 states and 43012 transitions. [2024-11-09 08:08:04,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 34822 states and 43012 transitions. [2024-11-09 08:08:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:08:04,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:04,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:04,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 08:08:04,152 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:04,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:04,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1311495525, now seen corresponding path program 1 times [2024-11-09 08:08:04,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:04,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807186466] [2024-11-09 08:08:04,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:04,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:04,180 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-09 08:08:04,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:04,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807186466] [2024-11-09 08:08:04,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807186466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:04,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785037555] [2024-11-09 08:08:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:04,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:04,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:04,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:04,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:04,182 INFO L87 Difference]: Start difference. First operand 34822 states and 43012 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:04,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:04,286 INFO L93 Difference]: Finished difference Result 67593 states and 79878 transitions. [2024-11-09 08:08:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:04,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 08:08:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:04,362 INFO L225 Difference]: With dead ends: 67593 [2024-11-09 08:08:04,363 INFO L226 Difference]: Without dead ends: 67593 [2024-11-09 08:08:04,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:04,363 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 154 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-09 08:08:04,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67593 states. [2024-11-09 08:08:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67593 to 67590. [2024-11-09 08:08:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67590 states, 67589 states have (on average 1.181789936232227) internal successors, (79876), 67589 states have internal predecessors, (79876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67590 states to 67590 states and 79876 transitions. [2024-11-09 08:08:05,562 INFO L78 Accepts]: Start accepts. Automaton has 67590 states and 79876 transitions. Word has length 30 [2024-11-09 08:08:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:05,562 INFO L471 AbstractCegarLoop]: Abstraction has 67590 states and 79876 transitions. [2024-11-09 08:08:05,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 67590 states and 79876 transitions. [2024-11-09 08:08:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:08:05,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:05,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:05,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 08:08:05,640 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:05,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:05,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1962403417, now seen corresponding path program 1 times [2024-11-09 08:08:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:05,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396282603] [2024-11-09 08:08:05,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:05,675 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-09 08:08:05,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:05,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396282603] [2024-11-09 08:08:05,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396282603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:05,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:05,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:05,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887561142] [2024-11-09 08:08:05,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:05,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:05,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:05,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:05,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:05,677 INFO L87 Difference]: Start difference. First operand 67590 states and 79876 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:05,796 INFO L93 Difference]: Finished difference Result 71689 states and 84998 transitions. [2024-11-09 08:08:05,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:05,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 08:08:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:05,869 INFO L225 Difference]: With dead ends: 71689 [2024-11-09 08:08:05,869 INFO L226 Difference]: Without dead ends: 71689 [2024-11-09 08:08:05,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:05,870 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 29 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 169 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-09 08:08:05,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 169 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71689 states. [2024-11-09 08:08:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71689 to 67590. [2024-11-09 08:08:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67590 states, 67589 states have (on average 1.1666395419372975) internal successors, (78852), 67589 states have internal predecessors, (78852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67590 states to 67590 states and 78852 transitions. [2024-11-09 08:08:07,129 INFO L78 Accepts]: Start accepts. Automaton has 67590 states and 78852 transitions. Word has length 30 [2024-11-09 08:08:07,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:07,130 INFO L471 AbstractCegarLoop]: Abstraction has 67590 states and 78852 transitions. [2024-11-09 08:08:07,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 67590 states and 78852 transitions. [2024-11-09 08:08:07,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 08:08:07,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:07,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:07,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 08:08:07,174 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:07,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2008348211, now seen corresponding path program 1 times [2024-11-09 08:08:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:07,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014550162] [2024-11-09 08:08:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:07,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:07,191 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-09 08:08:07,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014550162] [2024-11-09 08:08:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014550162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:07,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:07,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:07,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342147297] [2024-11-09 08:08:07,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:07,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:07,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:07,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:07,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:07,194 INFO L87 Difference]: Start difference. First operand 67590 states and 78852 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:07,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:07,646 INFO L93 Difference]: Finished difference Result 109574 states and 124932 transitions. [2024-11-09 08:08:07,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:07,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 08:08:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:07,765 INFO L225 Difference]: With dead ends: 109574 [2024-11-09 08:08:07,765 INFO L226 Difference]: Without dead ends: 109574 [2024-11-09 08:08:07,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:07,766 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 130 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-09 08:08:07,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109574 states. [2024-11-09 08:08:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109574 to 105478. [2024-11-09 08:08:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105478 states, 105477 states have (on average 1.1456146837699215) internal successors, (120836), 105477 states have internal predecessors, (120836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105478 states to 105478 states and 120836 transitions. [2024-11-09 08:08:09,099 INFO L78 Accepts]: Start accepts. Automaton has 105478 states and 120836 transitions. Word has length 31 [2024-11-09 08:08:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:09,100 INFO L471 AbstractCegarLoop]: Abstraction has 105478 states and 120836 transitions. [2024-11-09 08:08:09,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 105478 states and 120836 transitions. [2024-11-09 08:08:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 08:08:09,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:09,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:09,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 08:08:09,153 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:09,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:09,154 INFO L85 PathProgramCache]: Analyzing trace with hash 987279857, now seen corresponding path program 1 times [2024-11-09 08:08:09,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:09,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352498134] [2024-11-09 08:08:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:09,195 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-09 08:08:09,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:09,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352498134] [2024-11-09 08:08:09,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352498134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:09,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:09,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:09,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445286346] [2024-11-09 08:08:09,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:09,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:09,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:09,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:09,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:09,200 INFO L87 Difference]: Start difference. First operand 105478 states and 120836 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:09,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:09,949 INFO L93 Difference]: Finished difference Result 132099 states and 145410 transitions. [2024-11-09 08:08:09,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:09,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 08:08:09,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:09,951 INFO L225 Difference]: With dead ends: 132099 [2024-11-09 08:08:09,951 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 08:08:09,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:09,951 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 180 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-09 08:08:09,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 08:08:09,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 08:08:09,952 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-09 08:08:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 08:08:09,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2024-11-09 08:08:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:09,953 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 08:08:09,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 08:08:09,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 08:08:09,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-09 08:08:09,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-09 08:08:09,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 08:08:09,959 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:09,961 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 08:08:09,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:08:09 BoogieIcfgContainer [2024-11-09 08:08:09,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 08:08:09,964 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 08:08:09,964 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 08:08:09,964 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 08:08:09,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:57" (3/4) ... [2024-11-09 08:08:09,966 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 08:08:09,973 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-09 08:08:09,973 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-09 08:08:09,973 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 08:08:09,974 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 08:08:10,048 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 08:08:10,049 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 08:08:10,049 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 08:08:10,049 INFO L158 Benchmark]: Toolchain (without parser) took 13690.82ms. Allocated memory was 155.2MB in the beginning and 11.3GB in the end (delta: 11.1GB). Free memory was 82.9MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 918.9MB. Max. memory is 16.1GB. [2024-11-09 08:08:10,049 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory was 105.6MB in the beginning and 105.5MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:08:10,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.34ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 82.8MB in the beginning and 189.3MB in the end (delta: -106.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-09 08:08:10,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.63ms. Allocated memory is still 226.5MB. Free memory was 189.3MB in the beginning and 188.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:08:10,050 INFO L158 Benchmark]: Boogie Preprocessor took 40.36ms. Allocated memory is still 226.5MB. Free memory was 188.3MB in the beginning and 186.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:08:10,050 INFO L158 Benchmark]: RCFGBuilder took 372.58ms. Allocated memory is still 226.5MB. Free memory was 186.0MB in the beginning and 168.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 08:08:10,050 INFO L158 Benchmark]: TraceAbstraction took 12841.49ms. Allocated memory was 226.5MB in the beginning and 11.3GB in the end (delta: 11.0GB). Free memory was 167.3MB in the beginning and 10.3GB in the end (delta: -10.1GB). Peak memory consumption was 924.4MB. Max. memory is 16.1GB. [2024-11-09 08:08:10,050 INFO L158 Benchmark]: Witness Printer took 85.06ms. Allocated memory is still 11.3GB. Free memory was 10.3GB in the beginning and 10.3GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 08:08:10,051 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.17ms. Allocated memory is still 155.2MB. Free memory was 105.6MB in the beginning and 105.5MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.34ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 82.8MB in the beginning and 189.3MB in the end (delta: -106.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.63ms. Allocated memory is still 226.5MB. Free memory was 189.3MB in the beginning and 188.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.36ms. Allocated memory is still 226.5MB. Free memory was 188.3MB in the beginning and 186.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.58ms. Allocated memory is still 226.5MB. Free memory was 186.0MB in the beginning and 168.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12841.49ms. Allocated memory was 226.5MB in the beginning and 11.3GB in the end (delta: 11.0GB). Free memory was 167.3MB in the beginning and 10.3GB in the end (delta: -10.1GB). Peak memory consumption was 924.4MB. Max. memory is 16.1GB. * Witness Printer took 85.06ms. Allocated memory is still 11.3GB. Free memory was 10.3GB in the beginning and 10.3GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 49 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1731 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1731 mSDsluCounter, 5642 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2202 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 3440 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105478occurred in iteration=34, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 16449 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 820 ConstructedInterpolants, 0 QuantifiedInterpolants, 1752 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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-09 08:08:10,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE