./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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_8.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:08:24,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:08:24,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:08:24,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:08:24,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:08:24,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:08:24,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:08:24,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:08:24,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:08:24,556 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:08:24,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:08:24,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:08:24,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:08:24,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:08:24,558 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:08:24,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:08:24,558 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:08:24,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:08:24,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:08:24,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:08:24,559 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:08:24,561 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:08:24,561 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:08:24,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:08:24,561 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:08:24,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:08:24,561 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:08:24,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:08:24,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:08:24,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:08:24,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:08:24,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:08:24,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:08:24,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:08:24,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:08:24,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:08:24,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:08:24,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:08:24,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:08:24,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:08:24,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:08:24,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:08:24,565 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2024-11-09 08:08:24,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:08:24,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:08:24,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:08:24,862 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:08:24,863 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:08:24,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2024-11-09 08:08:26,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:08:26,351 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:08:26,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2024-11-09 08:08:26,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2005f623c/89c5b59b191242709d5321a49a987a0d/FLAG2be312901 [2024-11-09 08:08:26,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2005f623c/89c5b59b191242709d5321a49a987a0d [2024-11-09 08:08:26,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:08:26,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:08:26,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:08:26,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:08:26,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:08:26,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:08:26" (1/1) ... [2024-11-09 08:08:26,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356d686d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:26, skipping insertion in model container [2024-11-09 08:08:26,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:08:26" (1/1) ... [2024-11-09 08:08:26,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:08:26,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:08:27,000 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:08:27,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:08:27,044 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:08:27,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:27 WrapperNode [2024-11-09 08:08:27,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:08:27,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:08:27,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:08:27,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:08:27,053 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:08:27" (1/1) ... [2024-11-09 08:08:27,062 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:08:27" (1/1) ... [2024-11-09 08:08:27,085 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2024-11-09 08:08:27,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:08:27,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:08:27,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:08:27,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:08:27,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:27" (1/1) ... [2024-11-09 08:08:27,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:27" (1/1) ... [2024-11-09 08:08:27,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:27" (1/1) ... [2024-11-09 08:08:27,115 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:08:27,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:27" (1/1) ... [2024-11-09 08:08:27,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:27" (1/1) ... [2024-11-09 08:08:27,118 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:27" (1/1) ... [2024-11-09 08:08:27,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:27" (1/1) ... [2024-11-09 08:08:27,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:27" (1/1) ... [2024-11-09 08:08:27,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:27" (1/1) ... [2024-11-09 08:08:27,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:08:27,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:08:27,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:08:27,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:08:27,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:27" (1/1) ... [2024-11-09 08:08:27,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:08:27,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:08:27,166 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:08:27,168 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:08:27,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:08:27,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:08:27,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:08:27,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:08:27,269 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:08:27,274 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:08:27,474 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-09 08:08:27,475 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:08:27,486 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:08:27,486 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 08:08:27,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:08:27 BoogieIcfgContainer [2024-11-09 08:08:27,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:08:27,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:08:27,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:08:27,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:08:27,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:08:26" (1/3) ... [2024-11-09 08:08:27,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0835b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:08:27, skipping insertion in model container [2024-11-09 08:08:27,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:27" (2/3) ... [2024-11-09 08:08:27,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0835b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:08:27, skipping insertion in model container [2024-11-09 08:08:27,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:08:27" (3/3) ... [2024-11-09 08:08:27,493 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2024-11-09 08:08:27,507 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:08:27,508 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 08:08:27,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:08:27,551 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;@1b52bdd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:08:27,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 08:08:27,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 08:08:27,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:27,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 08:08:27,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:27,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash 28702382, now seen corresponding path program 1 times [2024-11-09 08:08:27,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:27,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515220542] [2024-11-09 08:08:27,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:27,713 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:27,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:27,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515220542] [2024-11-09 08:08:27,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515220542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:27,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:27,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:08:27,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019529013] [2024-11-09 08:08:27,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:27,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 08:08:27,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:27,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 08:08:27,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 08:08:27,754 INFO L87 Difference]: Start difference. First operand has 37 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:27,767 INFO L93 Difference]: Finished difference Result 36 states and 59 transitions. [2024-11-09 08:08:27,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 08:08:27,769 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:08:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:27,775 INFO L225 Difference]: With dead ends: 36 [2024-11-09 08:08:27,775 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 08:08:27,777 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:08:27,782 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:27,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 08:08:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 08:08:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.78125) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2024-11-09 08:08:27,809 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 5 [2024-11-09 08:08:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:27,809 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2024-11-09 08:08:27,809 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:08:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2024-11-09 08:08:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:08:27,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:27,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:08:27,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:08:27,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:27,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash 889696878, now seen corresponding path program 1 times [2024-11-09 08:08:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:27,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087017155] [2024-11-09 08:08:27,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:27,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:27,888 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:27,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087017155] [2024-11-09 08:08:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087017155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:27,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:27,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:08:27,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939712235] [2024-11-09 08:08:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:27,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:27,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:27,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:27,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:27,891 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:27,904 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. [2024-11-09 08:08:27,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:27,905 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:08:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:27,905 INFO L225 Difference]: With dead ends: 33 [2024-11-09 08:08:27,905 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 08:08:27,905 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:08:27,906 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:27,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 08:08:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 08:08:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2024-11-09 08:08:27,912 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 6 [2024-11-09 08:08:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:27,912 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2024-11-09 08:08:27,912 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:08:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2024-11-09 08:08:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 08:08:27,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:27,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:27,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:08:27,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:27,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:27,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1657621598, now seen corresponding path program 1 times [2024-11-09 08:08:27,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:27,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287006148] [2024-11-09 08:08:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:27,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:27,965 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:27,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:27,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287006148] [2024-11-09 08:08:27,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287006148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:27,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:27,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:27,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311268111] [2024-11-09 08:08:27,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:27,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:27,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:27,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:27,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:27,969 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:27,995 INFO L93 Difference]: Finished difference Result 59 states and 103 transitions. [2024-11-09 08:08:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:27,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 08:08:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:27,996 INFO L225 Difference]: With dead ends: 59 [2024-11-09 08:08:27,997 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 08:08:27,997 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:27,998 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:27,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 106 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 08:08:28,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 40. [2024-11-09 08:08:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 71 transitions. [2024-11-09 08:08:28,007 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 71 transitions. Word has length 16 [2024-11-09 08:08:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,007 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 71 transitions. [2024-11-09 08:08:28,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 71 transitions. [2024-11-09 08:08:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 08:08:28,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:28,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:08:28,008 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1399456160, now seen corresponding path program 1 times [2024-11-09 08:08:28,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620781242] [2024-11-09 08:08:28,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,085 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:28,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620781242] [2024-11-09 08:08:28,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620781242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641525870] [2024-11-09 08:08:28,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,087 INFO L87 Difference]: Start difference. First operand 40 states and 71 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,104 INFO L93 Difference]: Finished difference Result 59 states and 101 transitions. [2024-11-09 08:08:28,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 08:08:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,105 INFO L225 Difference]: With dead ends: 59 [2024-11-09 08:08:28,105 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 08:08:28,105 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:28,106 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 39 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 117 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 08:08:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2024-11-09 08:08:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 99 transitions. [2024-11-09 08:08:28,112 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 99 transitions. Word has length 16 [2024-11-09 08:08:28,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,112 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 99 transitions. [2024-11-09 08:08:28,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 99 transitions. [2024-11-09 08:08:28,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 08:08:28,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:28,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:08:28,114 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 159967120, now seen corresponding path program 1 times [2024-11-09 08:08:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575728579] [2024-11-09 08:08:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,169 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:28,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575728579] [2024-11-09 08:08:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575728579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553034187] [2024-11-09 08:08:28,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,172 INFO L87 Difference]: Start difference. First operand 56 states and 99 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,193 INFO L93 Difference]: Finished difference Result 62 states and 103 transitions. [2024-11-09 08:08:28,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 08:08:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,194 INFO L225 Difference]: With dead ends: 62 [2024-11-09 08:08:28,194 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 08:08:28,194 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:28,195 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 41 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 08:08:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-11-09 08:08:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 101 transitions. [2024-11-09 08:08:28,201 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 101 transitions. Word has length 17 [2024-11-09 08:08:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,201 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 101 transitions. [2024-11-09 08:08:28,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 101 transitions. [2024-11-09 08:08:28,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 08:08:28,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:28,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:08:28,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash -426838894, now seen corresponding path program 1 times [2024-11-09 08:08:28,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023029248] [2024-11-09 08:08:28,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,254 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:28,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023029248] [2024-11-09 08:08:28,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023029248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770556818] [2024-11-09 08:08:28,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,259 INFO L87 Difference]: Start difference. First operand 59 states and 101 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,277 INFO L93 Difference]: Finished difference Result 109 states and 188 transitions. [2024-11-09 08:08:28,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 08:08:28,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,279 INFO L225 Difference]: With dead ends: 109 [2024-11-09 08:08:28,279 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 08:08:28,279 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:28,280 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 08:08:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 78. [2024-11-09 08:08:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 134 transitions. [2024-11-09 08:08:28,293 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 134 transitions. Word has length 17 [2024-11-09 08:08:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,293 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 134 transitions. [2024-11-09 08:08:28,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 134 transitions. [2024-11-09 08:08:28,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 08:08:28,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:28,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 08:08:28,295 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash -168673456, now seen corresponding path program 1 times [2024-11-09 08:08:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614285867] [2024-11-09 08:08:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,330 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:28,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614285867] [2024-11-09 08:08:28,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614285867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765719494] [2024-11-09 08:08:28,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,332 INFO L87 Difference]: Start difference. First operand 78 states and 134 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,350 INFO L93 Difference]: Finished difference Result 111 states and 186 transitions. [2024-11-09 08:08:28,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 08:08:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,351 INFO L225 Difference]: With dead ends: 111 [2024-11-09 08:08:28,353 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 08:08:28,353 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:28,354 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 08:08:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2024-11-09 08:08:28,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 184 transitions. [2024-11-09 08:08:28,365 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 184 transitions. Word has length 17 [2024-11-09 08:08:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,366 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 184 transitions. [2024-11-09 08:08:28,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 184 transitions. [2024-11-09 08:08:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 08:08:28,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:28,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 08:08:28,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,371 INFO L85 PathProgramCache]: Analyzing trace with hash -340464149, now seen corresponding path program 1 times [2024-11-09 08:08:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683554574] [2024-11-09 08:08:28,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,403 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:28,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683554574] [2024-11-09 08:08:28,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683554574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134585018] [2024-11-09 08:08:28,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,407 INFO L87 Difference]: Start difference. First operand 108 states and 184 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,423 INFO L93 Difference]: Finished difference Result 113 states and 186 transitions. [2024-11-09 08:08:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 08:08:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,425 INFO L225 Difference]: With dead ends: 113 [2024-11-09 08:08:28,425 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 08:08:28,425 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:28,426 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 40 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 08:08:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2024-11-09 08:08:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 184 transitions. [2024-11-09 08:08:28,431 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 184 transitions. Word has length 18 [2024-11-09 08:08:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,431 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 184 transitions. [2024-11-09 08:08:28,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 184 transitions. [2024-11-09 08:08:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 08:08:28,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:28,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 08:08:28,433 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash -927270163, now seen corresponding path program 1 times [2024-11-09 08:08:28,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165260415] [2024-11-09 08:08:28,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,473 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:28,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165260415] [2024-11-09 08:08:28,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165260415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833009343] [2024-11-09 08:08:28,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,475 INFO L87 Difference]: Start difference. First operand 110 states and 184 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,494 INFO L93 Difference]: Finished difference Result 209 states and 342 transitions. [2024-11-09 08:08:28,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 08:08:28,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,495 INFO L225 Difference]: With dead ends: 209 [2024-11-09 08:08:28,495 INFO L226 Difference]: Without dead ends: 209 [2024-11-09 08:08:28,495 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:28,496 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-09 08:08:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-09 08:08:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.6585365853658536) internal successors, (340), 205 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 340 transitions. [2024-11-09 08:08:28,510 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 340 transitions. Word has length 18 [2024-11-09 08:08:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,510 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 340 transitions. [2024-11-09 08:08:28,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 340 transitions. [2024-11-09 08:08:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 08:08:28,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:28,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 08:08:28,512 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1185435601, now seen corresponding path program 1 times [2024-11-09 08:08:28,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518326901] [2024-11-09 08:08:28,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,547 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:28,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518326901] [2024-11-09 08:08:28,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518326901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029239279] [2024-11-09 08:08:28,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,549 INFO L87 Difference]: Start difference. First operand 206 states and 340 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,559 INFO L93 Difference]: Finished difference Result 257 states and 426 transitions. [2024-11-09 08:08:28,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 08:08:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,561 INFO L225 Difference]: With dead ends: 257 [2024-11-09 08:08:28,561 INFO L226 Difference]: Without dead ends: 257 [2024-11-09 08:08:28,561 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:28,562 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 33 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 137 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-09 08:08:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 206. [2024-11-09 08:08:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 336 transitions. [2024-11-09 08:08:28,568 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 336 transitions. Word has length 18 [2024-11-09 08:08:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,568 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 336 transitions. [2024-11-09 08:08:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 336 transitions. [2024-11-09 08:08:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 08:08:28,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:28,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 08:08:28,569 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1326046267, now seen corresponding path program 1 times [2024-11-09 08:08:28,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349091666] [2024-11-09 08:08:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,585 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:28,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349091666] [2024-11-09 08:08:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349091666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035293040] [2024-11-09 08:08:28,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,587 INFO L87 Difference]: Start difference. First operand 206 states and 336 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,595 INFO L93 Difference]: Finished difference Result 373 states and 610 transitions. [2024-11-09 08:08:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 08:08:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,597 INFO L225 Difference]: With dead ends: 373 [2024-11-09 08:08:28,597 INFO L226 Difference]: Without dead ends: 373 [2024-11-09 08:08:28,597 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:28,598 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 30 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 100 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-09 08:08:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 290. [2024-11-09 08:08:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 1.6055363321799307) internal successors, (464), 289 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 464 transitions. [2024-11-09 08:08:28,603 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 464 transitions. Word has length 19 [2024-11-09 08:08:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,604 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 464 transitions. [2024-11-09 08:08:28,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,604 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 464 transitions. [2024-11-09 08:08:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 08:08:28,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:28,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 08:08:28,605 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1584211705, now seen corresponding path program 1 times [2024-11-09 08:08:28,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078023619] [2024-11-09 08:08:28,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,628 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:28,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078023619] [2024-11-09 08:08:28,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078023619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154697421] [2024-11-09 08:08:28,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,629 INFO L87 Difference]: Start difference. First operand 290 states and 464 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,643 INFO L93 Difference]: Finished difference Result 397 states and 622 transitions. [2024-11-09 08:08:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 08:08:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,647 INFO L225 Difference]: With dead ends: 397 [2024-11-09 08:08:28,647 INFO L226 Difference]: Without dead ends: 397 [2024-11-09 08:08:28,647 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:28,647 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 36 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-09 08:08:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 394. [2024-11-09 08:08:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 620 transitions. [2024-11-09 08:08:28,660 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 620 transitions. Word has length 19 [2024-11-09 08:08:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,660 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 620 transitions. [2024-11-09 08:08:28,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 620 transitions. [2024-11-09 08:08:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 08:08:28,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,662 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:08:28,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 08:08:28,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1835577864, now seen corresponding path program 1 times [2024-11-09 08:08:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446496765] [2024-11-09 08:08:28,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,686 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:28,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446496765] [2024-11-09 08:08:28,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446496765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700278771] [2024-11-09 08:08:28,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,688 INFO L87 Difference]: Start difference. First operand 394 states and 620 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,701 INFO L93 Difference]: Finished difference Result 409 states and 630 transitions. [2024-11-09 08:08:28,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,701 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:08:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,703 INFO L225 Difference]: With dead ends: 409 [2024-11-09 08:08:28,703 INFO L226 Difference]: Without dead ends: 409 [2024-11-09 08:08:28,703 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:28,704 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 38 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 119 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-09 08:08:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2024-11-09 08:08:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 628 transitions. [2024-11-09 08:08:28,712 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 628 transitions. Word has length 20 [2024-11-09 08:08:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,712 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 628 transitions. [2024-11-09 08:08:28,712 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:08:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 628 transitions. [2024-11-09 08:08:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 08:08:28,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,714 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:08:28,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 08:08:28,714 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1872583418, now seen corresponding path program 1 times [2024-11-09 08:08:28,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197395233] [2024-11-09 08:08:28,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,737 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:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197395233] [2024-11-09 08:08:28,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197395233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973605936] [2024-11-09 08:08:28,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,739 INFO L87 Difference]: Start difference. First operand 406 states and 628 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,752 INFO L93 Difference]: Finished difference Result 713 states and 1102 transitions. [2024-11-09 08:08:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,753 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:08:28,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,755 INFO L225 Difference]: With dead ends: 713 [2024-11-09 08:08:28,755 INFO L226 Difference]: Without dead ends: 713 [2024-11-09 08:08:28,756 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:28,757 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-11-09 08:08:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 582. [2024-11-09 08:08:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 876 transitions. [2024-11-09 08:08:28,767 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 876 transitions. Word has length 20 [2024-11-09 08:08:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,768 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 876 transitions. [2024-11-09 08:08:28,768 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:08:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 876 transitions. [2024-11-09 08:08:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 08:08:28,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,769 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:08:28,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 08:08:28,769 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2130748856, now seen corresponding path program 1 times [2024-11-09 08:08:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248614302] [2024-11-09 08:08:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,794 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:28,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248614302] [2024-11-09 08:08:28,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248614302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563914020] [2024-11-09 08:08:28,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,800 INFO L87 Difference]: Start difference. First operand 582 states and 876 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,812 INFO L93 Difference]: Finished difference Result 777 states and 1142 transitions. [2024-11-09 08:08:28,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,812 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:08:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,814 INFO L225 Difference]: With dead ends: 777 [2024-11-09 08:08:28,814 INFO L226 Difference]: Without dead ends: 777 [2024-11-09 08:08:28,815 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:28,815 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-09 08:08:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 774. [2024-11-09 08:08:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1140 transitions. [2024-11-09 08:08:28,834 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1140 transitions. Word has length 20 [2024-11-09 08:08:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,835 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1140 transitions. [2024-11-09 08:08:28,835 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:08:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1140 transitions. [2024-11-09 08:08:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 08:08:28,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,836 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:08:28,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 08:08:28,836 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2072784796, now seen corresponding path program 1 times [2024-11-09 08:08:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506936364] [2024-11-09 08:08:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,855 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:28,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506936364] [2024-11-09 08:08:28,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506936364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825734709] [2024-11-09 08:08:28,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,856 INFO L87 Difference]: Start difference. First operand 774 states and 1140 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,871 INFO L93 Difference]: Finished difference Result 793 states and 1142 transitions. [2024-11-09 08:08:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,871 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:08:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,873 INFO L225 Difference]: With dead ends: 793 [2024-11-09 08:08:28,873 INFO L226 Difference]: Without dead ends: 793 [2024-11-09 08:08:28,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:08:28,874 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-11-09 08:08:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 790. [2024-11-09 08:08:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1140 transitions. [2024-11-09 08:08:28,886 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1140 transitions. Word has length 21 [2024-11-09 08:08:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,886 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1140 transitions. [2024-11-09 08:08:28,886 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:08:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1140 transitions. [2024-11-09 08:08:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 08:08:28,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,887 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:08:28,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 08:08:28,887 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1635376486, now seen corresponding path program 1 times [2024-11-09 08:08:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606650684] [2024-11-09 08:08:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,903 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:28,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606650684] [2024-11-09 08:08:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606650684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006973028] [2024-11-09 08:08:28,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,905 INFO L87 Difference]: Start difference. First operand 790 states and 1140 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,916 INFO L93 Difference]: Finished difference Result 1353 states and 1942 transitions. [2024-11-09 08:08:28,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,916 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:08:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,919 INFO L225 Difference]: With dead ends: 1353 [2024-11-09 08:08:28,920 INFO L226 Difference]: Without dead ends: 1353 [2024-11-09 08:08:28,920 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:28,920 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 96 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-09 08:08:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1158. [2024-11-09 08:08:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1620 transitions. [2024-11-09 08:08:28,937 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1620 transitions. Word has length 21 [2024-11-09 08:08:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,937 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1620 transitions. [2024-11-09 08:08:28,937 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:08:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1620 transitions. [2024-11-09 08:08:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 08:08:28,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,938 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:08:28,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 08:08:28,938 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1893541924, now seen corresponding path program 1 times [2024-11-09 08:08:28,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541461833] [2024-11-09 08:08:28,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:28,953 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:28,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:28,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541461833] [2024-11-09 08:08:28,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541461833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:28,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:28,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:28,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857309633] [2024-11-09 08:08:28,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:28,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:28,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:28,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:28,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:28,954 INFO L87 Difference]: Start difference. First operand 1158 states and 1620 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:28,966 INFO L93 Difference]: Finished difference Result 1513 states and 2054 transitions. [2024-11-09 08:08:28,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:28,967 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:08:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:28,971 INFO L225 Difference]: With dead ends: 1513 [2024-11-09 08:08:28,971 INFO L226 Difference]: Without dead ends: 1513 [2024-11-09 08:08:28,971 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:28,971 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 34 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:28,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 122 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-09 08:08:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1510. [2024-11-09 08:08:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2052 transitions. [2024-11-09 08:08:28,996 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2052 transitions. Word has length 21 [2024-11-09 08:08:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:28,996 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2052 transitions. [2024-11-09 08:08:28,996 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:08:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2052 transitions. [2024-11-09 08:08:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 08:08:28,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:28,997 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:08:28,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 08:08:28,998 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:28,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:28,998 INFO L85 PathProgramCache]: Analyzing trace with hash -836254525, now seen corresponding path program 1 times [2024-11-09 08:08:28,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:28,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866134998] [2024-11-09 08:08:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:28,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:29,012 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:29,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866134998] [2024-11-09 08:08:29,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866134998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:29,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:29,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:29,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137884984] [2024-11-09 08:08:29,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:29,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:29,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:29,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:29,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:29,013 INFO L87 Difference]: Start difference. First operand 1510 states and 2052 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:29,026 INFO L93 Difference]: Finished difference Result 1545 states and 2054 transitions. [2024-11-09 08:08:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:29,026 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:08:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:29,030 INFO L225 Difference]: With dead ends: 1545 [2024-11-09 08:08:29,030 INFO L226 Difference]: Without dead ends: 1545 [2024-11-09 08:08:29,031 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:29,031 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:29,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:29,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-09 08:08:29,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1542. [2024-11-09 08:08:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2052 transitions. [2024-11-09 08:08:29,058 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2052 transitions. Word has length 22 [2024-11-09 08:08:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:29,058 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2052 transitions. [2024-11-09 08:08:29,058 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:08:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2052 transitions. [2024-11-09 08:08:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 08:08:29,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:29,060 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:08:29,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 08:08:29,060 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:29,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1423060539, now seen corresponding path program 1 times [2024-11-09 08:08:29,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:29,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107543025] [2024-11-09 08:08:29,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:29,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:29,080 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:29,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:29,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107543025] [2024-11-09 08:08:29,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107543025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:29,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:29,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:29,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151453355] [2024-11-09 08:08:29,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:29,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:29,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:29,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:29,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:29,081 INFO L87 Difference]: Start difference. First operand 1542 states and 2052 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:29,096 INFO L93 Difference]: Finished difference Result 2569 states and 3366 transitions. [2024-11-09 08:08:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:29,096 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:08:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:29,105 INFO L225 Difference]: With dead ends: 2569 [2024-11-09 08:08:29,105 INFO L226 Difference]: Without dead ends: 2569 [2024-11-09 08:08:29,105 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:29,106 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:29,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 94 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:29,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2024-11-09 08:08:29,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2310. [2024-11-09 08:08:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 2980 transitions. [2024-11-09 08:08:29,172 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 2980 transitions. Word has length 22 [2024-11-09 08:08:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:29,173 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 2980 transitions. [2024-11-09 08:08:29,173 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:08:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 2980 transitions. [2024-11-09 08:08:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 08:08:29,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:29,176 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:08:29,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 08:08:29,177 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:29,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1164895101, now seen corresponding path program 1 times [2024-11-09 08:08:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124512531] [2024-11-09 08:08:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:29,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:29,194 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:29,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124512531] [2024-11-09 08:08:29,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124512531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:29,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:29,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:29,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061369229] [2024-11-09 08:08:29,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:29,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:29,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:29,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:29,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:29,196 INFO L87 Difference]: Start difference. First operand 2310 states and 2980 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:29,215 INFO L93 Difference]: Finished difference Result 2953 states and 3654 transitions. [2024-11-09 08:08:29,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:29,216 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:08:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:29,223 INFO L225 Difference]: With dead ends: 2953 [2024-11-09 08:08:29,223 INFO L226 Difference]: Without dead ends: 2953 [2024-11-09 08:08:29,223 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:29,224 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:29,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 123 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2024-11-09 08:08:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2950. [2024-11-09 08:08:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 3652 transitions. [2024-11-09 08:08:29,267 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 3652 transitions. Word has length 22 [2024-11-09 08:08:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:29,267 INFO L471 AbstractCegarLoop]: Abstraction has 2950 states and 3652 transitions. [2024-11-09 08:08:29,267 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:08:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3652 transitions. [2024-11-09 08:08:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:29,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:29,271 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:08:29,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 08:08:29,271 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:29,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:29,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1158511217, now seen corresponding path program 1 times [2024-11-09 08:08:29,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:29,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75010556] [2024-11-09 08:08:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:29,296 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:29,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75010556] [2024-11-09 08:08:29,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75010556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:29,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:29,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:29,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767003199] [2024-11-09 08:08:29,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:29,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:29,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:29,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:29,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:29,298 INFO L87 Difference]: Start difference. First operand 2950 states and 3652 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:29,315 INFO L93 Difference]: Finished difference Result 3017 states and 3654 transitions. [2024-11-09 08:08:29,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:29,315 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:08:29,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:29,329 INFO L225 Difference]: With dead ends: 3017 [2024-11-09 08:08:29,329 INFO L226 Difference]: Without dead ends: 3017 [2024-11-09 08:08:29,329 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:29,330 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 35 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:29,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2024-11-09 08:08:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 3014. [2024-11-09 08:08:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3014 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 3652 transitions. [2024-11-09 08:08:29,373 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 3652 transitions. Word has length 23 [2024-11-09 08:08:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:29,374 INFO L471 AbstractCegarLoop]: Abstraction has 3014 states and 3652 transitions. [2024-11-09 08:08:29,374 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:08:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 3652 transitions. [2024-11-09 08:08:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:29,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:29,377 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:08:29,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 08:08:29,377 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:29,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:29,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1745317231, now seen corresponding path program 1 times [2024-11-09 08:08:29,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:29,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339063586] [2024-11-09 08:08:29,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:29,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:29,397 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:29,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:29,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339063586] [2024-11-09 08:08:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339063586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:29,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:29,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617836046] [2024-11-09 08:08:29,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:29,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:29,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:29,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:29,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:29,401 INFO L87 Difference]: Start difference. First operand 3014 states and 3652 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:29,420 INFO L93 Difference]: Finished difference Result 4870 states and 5700 transitions. [2024-11-09 08:08:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:29,421 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:08:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:29,433 INFO L225 Difference]: With dead ends: 4870 [2024-11-09 08:08:29,433 INFO L226 Difference]: Without dead ends: 4870 [2024-11-09 08:08:29,434 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:29,434 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:29,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 90 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:29,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2024-11-09 08:08:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4614. [2024-11-09 08:08:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4614 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 5444 transitions. [2024-11-09 08:08:29,517 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 5444 transitions. Word has length 23 [2024-11-09 08:08:29,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:29,517 INFO L471 AbstractCegarLoop]: Abstraction has 4614 states and 5444 transitions. [2024-11-09 08:08:29,517 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:08:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 5444 transitions. [2024-11-09 08:08:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:29,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:29,522 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:08:29,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 08:08:29,522 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:29,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1487151793, now seen corresponding path program 1 times [2024-11-09 08:08:29,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:29,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613114510] [2024-11-09 08:08:29,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:29,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:29,542 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:29,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:29,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613114510] [2024-11-09 08:08:29,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613114510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:29,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:29,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:29,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003938163] [2024-11-09 08:08:29,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:29,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:29,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:29,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:29,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:29,544 INFO L87 Difference]: Start difference. First operand 4614 states and 5444 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:29,569 INFO L93 Difference]: Finished difference Result 5763 states and 6402 transitions. [2024-11-09 08:08:29,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:29,570 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:08:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:29,570 INFO L225 Difference]: With dead ends: 5763 [2024-11-09 08:08:29,570 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 08:08:29,571 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:29,571 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 30 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:29,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:29,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 08:08:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 08:08:29,572 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:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 08:08:29,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-11-09 08:08:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:29,572 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 08:08:29,572 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:08:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 08:08:29,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 08:08:29,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-09 08:08:29,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-09 08:08:29,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 08:08:29,579 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] [2024-11-09 08:08:29,582 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 08:08:29,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:08:29 BoogieIcfgContainer [2024-11-09 08:08:29,585 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 08:08:29,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 08:08:29,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 08:08:29,586 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 08:08:29,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:08:27" (3/4) ... [2024-11-09 08:08:29,588 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 08:08:29,597 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-09 08:08:29,597 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-09 08:08:29,598 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 08:08:29,598 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 08:08:29,681 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 08:08:29,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 08:08:29,682 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 08:08:29,682 INFO L158 Benchmark]: Toolchain (without parser) took 2913.85ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 115.9MB in the beginning and 96.5MB in the end (delta: 19.5MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2024-11-09 08:08:29,682 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:08:29,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.02ms. Allocated memory is still 153.1MB. Free memory was 115.9MB in the beginning and 102.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 08:08:29,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.31ms. Allocated memory is still 153.1MB. Free memory was 102.8MB in the beginning and 101.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:08:29,683 INFO L158 Benchmark]: Boogie Preprocessor took 43.89ms. Allocated memory is still 153.1MB. Free memory was 101.2MB in the beginning and 99.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:08:29,683 INFO L158 Benchmark]: RCFGBuilder took 353.65ms. Allocated memory is still 153.1MB. Free memory was 99.1MB in the beginning and 113.5MB in the end (delta: -14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 08:08:29,683 INFO L158 Benchmark]: TraceAbstraction took 2096.83ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 112.8MB in the beginning and 101.7MB in the end (delta: 11.1MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2024-11-09 08:08:29,684 INFO L158 Benchmark]: Witness Printer took 96.52ms. Allocated memory is still 184.5MB. Free memory was 101.7MB in the beginning and 96.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 08:08:29,685 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.19ms. Allocated memory is still 153.1MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.02ms. Allocated memory is still 153.1MB. Free memory was 115.9MB in the beginning and 102.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.31ms. Allocated memory is still 153.1MB. Free memory was 102.8MB in the beginning and 101.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.89ms. Allocated memory is still 153.1MB. Free memory was 101.2MB in the beginning and 99.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 353.65ms. Allocated memory is still 153.1MB. Free memory was 99.1MB in the beginning and 113.5MB in the end (delta: -14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2096.83ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 112.8MB in the beginning and 101.7MB in the end (delta: 11.1MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * Witness Printer took 96.52ms. Allocated memory is still 184.5MB. Free memory was 101.7MB in the beginning and 96.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 787 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 787 mSDsluCounter, 2597 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 981 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1616 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4614occurred in iteration=23, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 1064 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 420 ConstructedInterpolants, 0 QuantifiedInterpolants, 844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 08:08:29,706 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