./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_11.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_11.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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:07:54,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:07:54,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:07:54,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:07:54,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:07:54,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:07:54,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:07:54,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:07:54,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:07:54,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:07:54,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:07:54,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:07:54,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:07:54,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:07:54,604 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:07:54,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:07:54,605 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:07:54,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:07:54,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:07:54,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:07:54,607 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:07:54,611 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:07:54,612 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:07:54,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:07:54,612 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:07:54,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:07:54,613 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:07:54,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:07:54,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:07:54,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:07:54,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:07:54,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:07:54,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:07:54,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:07:54,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:07:54,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:07:54,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:07:54,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:07:54,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:07:54,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:07:54,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:07:54,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:07:54,622 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2024-11-09 08:07:54,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:07:54,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:07:54,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:07:54,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:07:54,913 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:07:54,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2024-11-09 08:07:56,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:07:56,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:07:56,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2024-11-09 08:07:56,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fbd39b75/0bd4fcbe036b4e9e8da65b1998162db2/FLAGe34ea965b [2024-11-09 08:07:57,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fbd39b75/0bd4fcbe036b4e9e8da65b1998162db2 [2024-11-09 08:07:57,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:07:57,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:07:57,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:07:57,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:07:57,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:07:57,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137f3a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57, skipping insertion in model container [2024-11-09 08:07:57,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:07:57,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:07:57,374 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:07:57,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:07:57,429 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:07:57,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57 WrapperNode [2024-11-09 08:07:57,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:07:57,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:07:57,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:07:57,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:07:57,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,477 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 161 [2024-11-09 08:07:57,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:07:57,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:07:57,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:07:57,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:07:57,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,511 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 08:07:57,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:07:57,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:07:57,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:07:57,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:07:57,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (1/1) ... [2024-11-09 08:07:57,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:07:57,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:07:57,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 08:07:57,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 08:07:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:07:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:07:57,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:07:57,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:07:57,678 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:07:57,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:07:57,973 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-09 08:07:57,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:07:57,992 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:07:57,993 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 08:07:57,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:57 BoogieIcfgContainer [2024-11-09 08:07:57,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:07:57,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:07:57,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:07:58,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:07:58,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:07:57" (1/3) ... [2024-11-09 08:07:58,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5261b22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:07:58, skipping insertion in model container [2024-11-09 08:07:58,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:57" (2/3) ... [2024-11-09 08:07:58,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5261b22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:07:58, skipping insertion in model container [2024-11-09 08:07:58,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:57" (3/3) ... [2024-11-09 08:07:58,009 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2024-11-09 08:07:58,027 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:07:58,028 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 08:07:58,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:07:58,083 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;@6817eced, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:07:58,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 08:07:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 45 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 08:07:58,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 08:07:58,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,098 INFO L85 PathProgramCache]: Analyzing trace with hash 28704014, now seen corresponding path program 1 times [2024-11-09 08:07:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006501305] [2024-11-09 08:07:58,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,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:07:58,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006501305] [2024-11-09 08:07:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006501305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:07:58,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808496394] [2024-11-09 08:07:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 08:07:58,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 08:07:58,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 08:07:58,343 INFO L87 Difference]: Start difference. First operand has 46 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 45 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,361 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2024-11-09 08:07:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 08:07:58,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 08:07:58,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,374 INFO L225 Difference]: With dead ends: 45 [2024-11-09 08:07:58,374 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 08:07:58,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 08:07:58,381 INFO L432 NwaCegarLoop]: 77 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, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:58,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 08:07:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 08:07:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.829268292682927) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2024-11-09 08:07:58,421 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 75 transitions. Word has length 5 [2024-11-09 08:07:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,422 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 75 transitions. [2024-11-09 08:07:58,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 75 transitions. [2024-11-09 08:07:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:07:58,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:07:58,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,426 INFO L85 PathProgramCache]: Analyzing trace with hash 889698510, now seen corresponding path program 1 times [2024-11-09 08:07:58,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083239118] [2024-11-09 08:07:58,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:58,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083239118] [2024-11-09 08:07:58,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083239118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:07:58,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848855013] [2024-11-09 08:07:58,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,535 INFO L87 Difference]: Start difference. First operand 43 states and 75 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,555 INFO L93 Difference]: Finished difference Result 42 states and 74 transitions. [2024-11-09 08:07:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 08:07:58,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,557 INFO L225 Difference]: With dead ends: 42 [2024-11-09 08:07:58,557 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 08:07:58,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,558 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:58,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 74 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 08:07:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 08:07:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 72 transitions. [2024-11-09 08:07:58,569 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 72 transitions. Word has length 6 [2024-11-09 08:07:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,571 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 72 transitions. [2024-11-09 08:07:58,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 72 transitions. [2024-11-09 08:07:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 08:07:58,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,573 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:07:58,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:07:58,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1341606449, now seen corresponding path program 1 times [2024-11-09 08:07:58,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484298627] [2024-11-09 08:07:58,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:58,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484298627] [2024-11-09 08:07:58,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484298627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007863360] [2024-11-09 08:07:58,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,696 INFO L87 Difference]: Start difference. First operand 40 states and 72 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:07:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,738 INFO L93 Difference]: Finished difference Result 77 states and 139 transitions. [2024-11-09 08:07:58,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,739 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:07:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,741 INFO L225 Difference]: With dead ends: 77 [2024-11-09 08:07:58,742 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 08:07:58,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,744 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:58,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 142 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 08:07:58,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 52. [2024-11-09 08:07:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 95 transitions. [2024-11-09 08:07:58,756 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 95 transitions. Word has length 19 [2024-11-09 08:07:58,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,756 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 95 transitions. [2024-11-09 08:07:58,757 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:07:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 95 transitions. [2024-11-09 08:07:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 08:07:58,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,758 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:07:58,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:07:58,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash 61742771, now seen corresponding path program 1 times [2024-11-09 08:07:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468053990] [2024-11-09 08:07:58,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:58,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468053990] [2024-11-09 08:07:58,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468053990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843021080] [2024-11-09 08:07:58,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,854 INFO L87 Difference]: Start difference. First operand 52 states and 95 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:07:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:58,886 INFO L93 Difference]: Finished difference Result 77 states and 137 transitions. [2024-11-09 08:07:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:58,887 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:07:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:58,888 INFO L225 Difference]: With dead ends: 77 [2024-11-09 08:07:58,888 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 08:07:58,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,890 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 54 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:58,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 159 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 08:07:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-11-09 08:07:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 135 transitions. [2024-11-09 08:07:58,909 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 135 transitions. Word has length 19 [2024-11-09 08:07:58,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:58,910 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 135 transitions. [2024-11-09 08:07:58,910 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:07:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 135 transitions. [2024-11-09 08:07:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 08:07:58,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:58,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:58,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:07:58,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:58,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:58,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1353275597, now seen corresponding path program 1 times [2024-11-09 08:07:58,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:58,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034848118] [2024-11-09 08:07:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:58,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:58,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:58,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034848118] [2024-11-09 08:07:58,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034848118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:58,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:58,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:58,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770846328] [2024-11-09 08:07:58,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:58,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:58,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:58,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:58,982 INFO L87 Difference]: Start difference. First operand 74 states and 135 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,010 INFO L93 Difference]: Finished difference Result 80 states and 139 transitions. [2024-11-09 08:07:59,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 08:07:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,012 INFO L225 Difference]: With dead ends: 80 [2024-11-09 08:07:59,012 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 08:07:59,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,017 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 56 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:59,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 08:07:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-11-09 08:07:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 137 transitions. [2024-11-09 08:07:59,031 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 137 transitions. Word has length 20 [2024-11-09 08:07:59,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,032 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 137 transitions. [2024-11-09 08:07:59,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,032 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 137 transitions. [2024-11-09 08:07:59,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 08:07:59,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:07:59,035 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1920623345, now seen corresponding path program 1 times [2024-11-09 08:07:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765583067] [2024-11-09 08:07:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:59,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765583067] [2024-11-09 08:07:59,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765583067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68720457] [2024-11-09 08:07:59,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,106 INFO L87 Difference]: Start difference. First operand 77 states and 137 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,135 INFO L93 Difference]: Finished difference Result 145 states and 260 transitions. [2024-11-09 08:07:59,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 08:07:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,138 INFO L225 Difference]: With dead ends: 145 [2024-11-09 08:07:59,138 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 08:07:59,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,139 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 51 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:59,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 08:07:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 102. [2024-11-09 08:07:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.801980198019802) internal successors, (182), 101 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 182 transitions. [2024-11-09 08:07:59,150 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 182 transitions. Word has length 20 [2024-11-09 08:07:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,150 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 182 transitions. [2024-11-09 08:07:59,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 182 transitions. [2024-11-09 08:07:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 08:07:59,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 08:07:59,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,154 INFO L85 PathProgramCache]: Analyzing trace with hash 640759667, now seen corresponding path program 1 times [2024-11-09 08:07:59,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859929400] [2024-11-09 08:07:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:59,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859929400] [2024-11-09 08:07:59,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859929400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709678216] [2024-11-09 08:07:59,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,205 INFO L87 Difference]: Start difference. First operand 102 states and 182 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,230 INFO L93 Difference]: Finished difference Result 147 states and 258 transitions. [2024-11-09 08:07:59,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 08:07:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,232 INFO L225 Difference]: With dead ends: 147 [2024-11-09 08:07:59,232 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 08:07:59,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,233 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:59,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 08:07:59,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-11-09 08:07:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 256 transitions. [2024-11-09 08:07:59,251 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 256 transitions. Word has length 20 [2024-11-09 08:07:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,251 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 256 transitions. [2024-11-09 08:07:59,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 256 transitions. [2024-11-09 08:07:59,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 08:07:59,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 08:07:59,255 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,256 INFO L85 PathProgramCache]: Analyzing trace with hash -583610434, now seen corresponding path program 1 times [2024-11-09 08:07:59,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832735867] [2024-11-09 08:07:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:59,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832735867] [2024-11-09 08:07:59,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832735867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348269314] [2024-11-09 08:07:59,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,316 INFO L87 Difference]: Start difference. First operand 144 states and 256 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,333 INFO L93 Difference]: Finished difference Result 149 states and 258 transitions. [2024-11-09 08:07:59,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 08:07:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,335 INFO L225 Difference]: With dead ends: 149 [2024-11-09 08:07:59,335 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 08:07:59,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,336 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:59,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 08:07:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-09 08:07:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 145 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 256 transitions. [2024-11-09 08:07:59,347 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 256 transitions. Word has length 21 [2024-11-09 08:07:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,348 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 256 transitions. [2024-11-09 08:07:59,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 256 transitions. [2024-11-09 08:07:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 08:07:59,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 08:07:59,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1604678788, now seen corresponding path program 1 times [2024-11-09 08:07:59,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599257819] [2024-11-09 08:07:59,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:59,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599257819] [2024-11-09 08:07:59,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599257819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540793217] [2024-11-09 08:07:59,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,398 INFO L87 Difference]: Start difference. First operand 146 states and 256 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,418 INFO L93 Difference]: Finished difference Result 281 states and 486 transitions. [2024-11-09 08:07:59,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 08:07:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,420 INFO L225 Difference]: With dead ends: 281 [2024-11-09 08:07:59,420 INFO L226 Difference]: Without dead ends: 281 [2024-11-09 08:07:59,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,421 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:59,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-09 08:07:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2024-11-09 08:07:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.7472924187725631) internal successors, (484), 277 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 484 transitions. [2024-11-09 08:07:59,434 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 484 transitions. Word has length 21 [2024-11-09 08:07:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,434 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 484 transitions. [2024-11-09 08:07:59,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 484 transitions. [2024-11-09 08:07:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 08:07:59,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 08:07:59,436 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,437 INFO L85 PathProgramCache]: Analyzing trace with hash -324815110, now seen corresponding path program 1 times [2024-11-09 08:07:59,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939091891] [2024-11-09 08:07:59,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:59,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939091891] [2024-11-09 08:07:59,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939091891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776109431] [2024-11-09 08:07:59,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,491 INFO L87 Difference]: Start difference. First operand 278 states and 484 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,506 INFO L93 Difference]: Finished difference Result 353 states and 618 transitions. [2024-11-09 08:07:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 08:07:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,508 INFO L225 Difference]: With dead ends: 353 [2024-11-09 08:07:59,508 INFO L226 Difference]: Without dead ends: 353 [2024-11-09 08:07:59,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,509 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 48 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:59,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 191 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-09 08:07:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 278. [2024-11-09 08:07:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.7328519855595668) internal successors, (480), 277 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 480 transitions. [2024-11-09 08:07:59,522 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 480 transitions. Word has length 21 [2024-11-09 08:07:59,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,522 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 480 transitions. [2024-11-09 08:07:59,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 480 transitions. [2024-11-09 08:07:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 08:07:59,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 08:07:59,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1801183710, now seen corresponding path program 1 times [2024-11-09 08:07:59,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320718886] [2024-11-09 08:07:59,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:59,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320718886] [2024-11-09 08:07:59,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320718886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325978018] [2024-11-09 08:07:59,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,564 INFO L87 Difference]: Start difference. First operand 278 states and 480 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,576 INFO L93 Difference]: Finished difference Result 517 states and 898 transitions. [2024-11-09 08:07:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 08:07:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,579 INFO L225 Difference]: With dead ends: 517 [2024-11-09 08:07:59,579 INFO L226 Difference]: Without dead ends: 517 [2024-11-09 08:07:59,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,582 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 45 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:59,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-09 08:07:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 386. [2024-11-09 08:07:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.7038961038961038) internal successors, (656), 385 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 656 transitions. [2024-11-09 08:07:59,603 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 656 transitions. Word has length 22 [2024-11-09 08:07:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,604 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 656 transitions. [2024-11-09 08:07:59,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 656 transitions. [2024-11-09 08:07:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 08:07:59,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 08:07:59,607 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,608 INFO L85 PathProgramCache]: Analyzing trace with hash 521320032, now seen corresponding path program 1 times [2024-11-09 08:07:59,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942679048] [2024-11-09 08:07:59,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:59,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942679048] [2024-11-09 08:07:59,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942679048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460560220] [2024-11-09 08:07:59,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,642 INFO L87 Difference]: Start difference. First operand 386 states and 656 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,657 INFO L93 Difference]: Finished difference Result 541 states and 910 transitions. [2024-11-09 08:07:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 08:07:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,660 INFO L225 Difference]: With dead ends: 541 [2024-11-09 08:07:59,660 INFO L226 Difference]: Without dead ends: 541 [2024-11-09 08:07:59,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,661 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:59,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-09 08:07:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 538. [2024-11-09 08:07:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.690875232774674) internal successors, (908), 537 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 908 transitions. [2024-11-09 08:07:59,674 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 908 transitions. Word has length 22 [2024-11-09 08:07:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,674 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 908 transitions. [2024-11-09 08:07:59,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 908 transitions. [2024-11-09 08:07:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:07:59,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 08:07:59,676 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash 8749319, now seen corresponding path program 1 times [2024-11-09 08:07:59,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548425767] [2024-11-09 08:07:59,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:59,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548425767] [2024-11-09 08:07:59,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548425767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291102190] [2024-11-09 08:07:59,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,703 INFO L87 Difference]: Start difference. First operand 538 states and 908 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,740 INFO L93 Difference]: Finished difference Result 553 states and 918 transitions. [2024-11-09 08:07:59,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 08:07:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,751 INFO L225 Difference]: With dead ends: 553 [2024-11-09 08:07:59,751 INFO L226 Difference]: Without dead ends: 553 [2024-11-09 08:07:59,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,752 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 53 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:59,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-09 08:07:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 550. [2024-11-09 08:07:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 916 transitions. [2024-11-09 08:07:59,770 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 916 transitions. Word has length 23 [2024-11-09 08:07:59,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,771 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 916 transitions. [2024-11-09 08:07:59,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 916 transitions. [2024-11-09 08:07:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:07:59,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 08:07:59,774 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1012319035, now seen corresponding path program 1 times [2024-11-09 08:07:59,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757856881] [2024-11-09 08:07:59,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:59,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757856881] [2024-11-09 08:07:59,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757856881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635585516] [2024-11-09 08:07:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,813 INFO L87 Difference]: Start difference. First operand 550 states and 916 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,832 INFO L93 Difference]: Finished difference Result 1001 states and 1678 transitions. [2024-11-09 08:07:59,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 08:07:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,837 INFO L225 Difference]: With dead ends: 1001 [2024-11-09 08:07:59,837 INFO L226 Difference]: Without dead ends: 1001 [2024-11-09 08:07:59,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,838 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 42 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:59,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 134 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-09 08:07:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 774. [2024-11-09 08:07:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1260 transitions. [2024-11-09 08:07:59,859 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1260 transitions. Word has length 23 [2024-11-09 08:07:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,859 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1260 transitions. [2024-11-09 08:07:59,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1260 transitions. [2024-11-09 08:07:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:07:59,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 08:07:59,862 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2002784583, now seen corresponding path program 1 times [2024-11-09 08:07:59,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878532024] [2024-11-09 08:07:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:59,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878532024] [2024-11-09 08:07:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878532024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297073849] [2024-11-09 08:07:59,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,896 INFO L87 Difference]: Start difference. First operand 774 states and 1260 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:07:59,913 INFO L93 Difference]: Finished difference Result 1065 states and 1718 transitions. [2024-11-09 08:07:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:07:59,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 08:07:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:07:59,920 INFO L225 Difference]: With dead ends: 1065 [2024-11-09 08:07:59,920 INFO L226 Difference]: Without dead ends: 1065 [2024-11-09 08:07:59,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,922 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:07:59,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:07:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-09 08:07:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1062. [2024-11-09 08:07:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1716 transitions. [2024-11-09 08:07:59,948 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1716 transitions. Word has length 23 [2024-11-09 08:07:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:07:59,949 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1716 transitions. [2024-11-09 08:07:59,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1716 transitions. [2024-11-09 08:07:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:07:59,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:59,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:07:59,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 08:07:59,952 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:07:59,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:59,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1310479285, now seen corresponding path program 1 times [2024-11-09 08:07:59,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:59,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79033793] [2024-11-09 08:07:59,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:59,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79033793] [2024-11-09 08:07:59,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79033793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:59,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:59,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:59,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275311915] [2024-11-09 08:07:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:59,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:07:59,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:59,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:07:59,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:07:59,983 INFO L87 Difference]: Start difference. First operand 1062 states and 1716 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:00,004 INFO L93 Difference]: Finished difference Result 1081 states and 1718 transitions. [2024-11-09 08:08:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:00,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 08:08:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:00,011 INFO L225 Difference]: With dead ends: 1081 [2024-11-09 08:08:00,011 INFO L226 Difference]: Without dead ends: 1081 [2024-11-09 08:08:00,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,012 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:00,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2024-11-09 08:08:00,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1078. [2024-11-09 08:08:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1716 transitions. [2024-11-09 08:08:00,038 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1716 transitions. Word has length 24 [2024-11-09 08:08:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:00,039 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1716 transitions. [2024-11-09 08:08:00,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1716 transitions. [2024-11-09 08:08:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:08:00,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:00,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:00,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 08:08:00,041 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:00,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:00,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1963419657, now seen corresponding path program 1 times [2024-11-09 08:08:00,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:00,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281558005] [2024-11-09 08:08:00,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:00,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:00,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281558005] [2024-11-09 08:08:00,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281558005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:00,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:00,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:00,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685602340] [2024-11-09 08:08:00,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:00,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:00,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:00,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,077 INFO L87 Difference]: Start difference. First operand 1078 states and 1716 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:00,096 INFO L93 Difference]: Finished difference Result 1929 states and 3094 transitions. [2024-11-09 08:08:00,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:00,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 08:08:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:00,104 INFO L225 Difference]: With dead ends: 1929 [2024-11-09 08:08:00,104 INFO L226 Difference]: Without dead ends: 1929 [2024-11-09 08:08:00,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,105 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:00,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2024-11-09 08:08:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1542. [2024-11-09 08:08:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2388 transitions. [2024-11-09 08:08:00,141 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2388 transitions. Word has length 24 [2024-11-09 08:08:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:00,141 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2388 transitions. [2024-11-09 08:08:00,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2388 transitions. [2024-11-09 08:08:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:08:00,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:00,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:00,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 08:08:00,144 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:00,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash 683555979, now seen corresponding path program 1 times [2024-11-09 08:08:00,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:00,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267401241] [2024-11-09 08:08:00,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:00,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:00,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:00,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267401241] [2024-11-09 08:08:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267401241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:00,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:00,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765745137] [2024-11-09 08:08:00,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:00,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:00,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:00,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:00,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,182 INFO L87 Difference]: Start difference. First operand 1542 states and 2388 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:00,203 INFO L93 Difference]: Finished difference Result 2089 states and 3206 transitions. [2024-11-09 08:08:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:00,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 08:08:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:00,222 INFO L225 Difference]: With dead ends: 2089 [2024-11-09 08:08:00,223 INFO L226 Difference]: Without dead ends: 2089 [2024-11-09 08:08:00,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:00,224 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:00,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:00,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-09 08:08:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2086. [2024-11-09 08:08:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 3204 transitions. [2024-11-09 08:08:00,273 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 3204 transitions. Word has length 24 [2024-11-09 08:08:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:00,273 INFO L471 AbstractCegarLoop]: Abstraction has 2086 states and 3204 transitions. [2024-11-09 08:08:00,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 3204 transitions. [2024-11-09 08:08:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:08:00,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:00,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:00,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 08:08:00,277 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:00,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:00,277 INFO L85 PathProgramCache]: Analyzing trace with hash 743117522, now seen corresponding path program 1 times [2024-11-09 08:08:00,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:00,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027329968] [2024-11-09 08:08:00,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:00,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:00,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:00,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027329968] [2024-11-09 08:08:00,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027329968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:00,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:00,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:00,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30015057] [2024-11-09 08:08:00,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:00,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:00,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:00,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:00,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,316 INFO L87 Difference]: Start difference. First operand 2086 states and 3204 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:00,337 INFO L93 Difference]: Finished difference Result 2121 states and 3206 transitions. [2024-11-09 08:08:00,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:00,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 08:08:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:00,345 INFO L225 Difference]: With dead ends: 2121 [2024-11-09 08:08:00,345 INFO L226 Difference]: Without dead ends: 2121 [2024-11-09 08:08:00,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,347 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:00,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2024-11-09 08:08:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2118. [2024-11-09 08:08:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2118 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 3204 transitions. [2024-11-09 08:08:00,395 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 3204 transitions. Word has length 25 [2024-11-09 08:08:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:00,395 INFO L471 AbstractCegarLoop]: Abstraction has 2118 states and 3204 transitions. [2024-11-09 08:08:00,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 3204 transitions. [2024-11-09 08:08:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:08:00,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:00,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:00,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 08:08:00,399 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:00,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash -277950832, now seen corresponding path program 1 times [2024-11-09 08:08:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:00,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325619838] [2024-11-09 08:08:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:00,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:00,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:00,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325619838] [2024-11-09 08:08:00,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325619838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:00,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:00,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:00,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206142563] [2024-11-09 08:08:00,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:00,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:00,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:00,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,425 INFO L87 Difference]: Start difference. First operand 2118 states and 3204 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:00,451 INFO L93 Difference]: Finished difference Result 3721 states and 5670 transitions. [2024-11-09 08:08:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 08:08:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:00,464 INFO L225 Difference]: With dead ends: 3721 [2024-11-09 08:08:00,465 INFO L226 Difference]: Without dead ends: 3721 [2024-11-09 08:08:00,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,466 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 36 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:00,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2024-11-09 08:08:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3078. [2024-11-09 08:08:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4516 transitions. [2024-11-09 08:08:00,552 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4516 transitions. Word has length 25 [2024-11-09 08:08:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:00,553 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4516 transitions. [2024-11-09 08:08:00,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4516 transitions. [2024-11-09 08:08:00,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:08:00,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:00,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:00,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 08:08:00,559 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:00,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:00,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1557814510, now seen corresponding path program 1 times [2024-11-09 08:08:00,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:00,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444722259] [2024-11-09 08:08:00,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:00,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:00,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:00,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444722259] [2024-11-09 08:08:00,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444722259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:00,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:00,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:00,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43806596] [2024-11-09 08:08:00,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:00,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:00,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:00,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,594 INFO L87 Difference]: Start difference. First operand 3078 states and 4516 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:00,627 INFO L93 Difference]: Finished difference Result 4105 states and 5958 transitions. [2024-11-09 08:08:00,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:00,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 08:08:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:00,642 INFO L225 Difference]: With dead ends: 4105 [2024-11-09 08:08:00,643 INFO L226 Difference]: Without dead ends: 4105 [2024-11-09 08:08:00,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,644 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:00,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:00,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2024-11-09 08:08:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 4102. [2024-11-09 08:08:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5956 transitions. [2024-11-09 08:08:00,765 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5956 transitions. Word has length 25 [2024-11-09 08:08:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:00,766 INFO L471 AbstractCegarLoop]: Abstraction has 4102 states and 5956 transitions. [2024-11-09 08:08:00,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5956 transitions. [2024-11-09 08:08:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:08:00,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:00,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:00,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 08:08:00,770 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:00,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:00,770 INFO L85 PathProgramCache]: Analyzing trace with hash -19880330, now seen corresponding path program 1 times [2024-11-09 08:08:00,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:00,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345082920] [2024-11-09 08:08:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:00,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:00,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:00,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345082920] [2024-11-09 08:08:00,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345082920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:00,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:00,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:00,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96374211] [2024-11-09 08:08:00,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:00,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:00,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:00,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:00,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,796 INFO L87 Difference]: Start difference. First operand 4102 states and 5956 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:00,824 INFO L93 Difference]: Finished difference Result 4169 states and 5958 transitions. [2024-11-09 08:08:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:00,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 08:08:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:00,841 INFO L225 Difference]: With dead ends: 4169 [2024-11-09 08:08:00,845 INFO L226 Difference]: Without dead ends: 4169 [2024-11-09 08:08:00,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,846 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:00,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2024-11-09 08:08:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 4166. [2024-11-09 08:08:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4166 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 5956 transitions. [2024-11-09 08:08:00,941 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 5956 transitions. Word has length 26 [2024-11-09 08:08:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:00,942 INFO L471 AbstractCegarLoop]: Abstraction has 4166 states and 5956 transitions. [2024-11-09 08:08:00,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 5956 transitions. [2024-11-09 08:08:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:08:00,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:00,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:00,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 08:08:00,948 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:00,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1040948684, now seen corresponding path program 1 times [2024-11-09 08:08:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:00,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385341451] [2024-11-09 08:08:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:00,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:00,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385341451] [2024-11-09 08:08:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385341451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:00,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:00,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:00,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654165628] [2024-11-09 08:08:00,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:00,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:00,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:00,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:00,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:00,976 INFO L87 Difference]: Start difference. First operand 4166 states and 5956 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:01,011 INFO L93 Difference]: Finished difference Result 7177 states and 10310 transitions. [2024-11-09 08:08:01,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:01,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 08:08:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:01,026 INFO L225 Difference]: With dead ends: 7177 [2024-11-09 08:08:01,026 INFO L226 Difference]: Without dead ends: 7177 [2024-11-09 08:08:01,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:01,027 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:01,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7177 states. [2024-11-09 08:08:01,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7177 to 6150. [2024-11-09 08:08:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6150 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6150 states to 6150 states and 8516 transitions. [2024-11-09 08:08:01,180 INFO L78 Accepts]: Start accepts. Automaton has 6150 states and 8516 transitions. Word has length 26 [2024-11-09 08:08:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:01,180 INFO L471 AbstractCegarLoop]: Abstraction has 6150 states and 8516 transitions. [2024-11-09 08:08:01,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states and 8516 transitions. [2024-11-09 08:08:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:08:01,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:01,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:01,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 08:08:01,190 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:01,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:01,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1974154934, now seen corresponding path program 1 times [2024-11-09 08:08:01,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:01,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841765494] [2024-11-09 08:08:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:01,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:01,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:01,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841765494] [2024-11-09 08:08:01,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841765494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:01,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:01,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:01,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066251833] [2024-11-09 08:08:01,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:01,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:01,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:01,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:01,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:01,216 INFO L87 Difference]: Start difference. First operand 6150 states and 8516 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:01,255 INFO L93 Difference]: Finished difference Result 8073 states and 11014 transitions. [2024-11-09 08:08:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:01,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 08:08:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:01,272 INFO L225 Difference]: With dead ends: 8073 [2024-11-09 08:08:01,272 INFO L226 Difference]: Without dead ends: 8073 [2024-11-09 08:08:01,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:01,273 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 166 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:01,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 166 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:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8073 states. [2024-11-09 08:08:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8073 to 8070. [2024-11-09 08:08:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8070 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8070 states to 8070 states and 11012 transitions. [2024-11-09 08:08:01,419 INFO L78 Accepts]: Start accepts. Automaton has 8070 states and 11012 transitions. Word has length 26 [2024-11-09 08:08:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:01,420 INFO L471 AbstractCegarLoop]: Abstraction has 8070 states and 11012 transitions. [2024-11-09 08:08:01,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 8070 states and 11012 transitions. [2024-11-09 08:08:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 08:08:01,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:01,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:01,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 08:08:01,429 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:01,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2097000605, now seen corresponding path program 1 times [2024-11-09 08:08:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:01,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958975912] [2024-11-09 08:08:01,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:01,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:01,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:01,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958975912] [2024-11-09 08:08:01,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958975912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:01,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:01,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72693900] [2024-11-09 08:08:01,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:01,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:01,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:01,456 INFO L87 Difference]: Start difference. First operand 8070 states and 11012 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:01,520 INFO L93 Difference]: Finished difference Result 8201 states and 11014 transitions. [2024-11-09 08:08:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:01,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 08:08:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:01,534 INFO L225 Difference]: With dead ends: 8201 [2024-11-09 08:08:01,535 INFO L226 Difference]: Without dead ends: 8201 [2024-11-09 08:08:01,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:01,538 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:01,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8201 states. [2024-11-09 08:08:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8201 to 8198. [2024-11-09 08:08:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8198 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8198 states to 8198 states and 11012 transitions. [2024-11-09 08:08:01,683 INFO L78 Accepts]: Start accepts. Automaton has 8198 states and 11012 transitions. Word has length 27 [2024-11-09 08:08:01,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:01,684 INFO L471 AbstractCegarLoop]: Abstraction has 8198 states and 11012 transitions. [2024-11-09 08:08:01,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8198 states and 11012 transitions. [2024-11-09 08:08:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 08:08:01,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:01,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:01,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 08:08:01,693 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:01,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:01,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1075932251, now seen corresponding path program 1 times [2024-11-09 08:08:01,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:01,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810567988] [2024-11-09 08:08:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:01,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:01,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:01,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810567988] [2024-11-09 08:08:01,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810567988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:01,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:01,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536526997] [2024-11-09 08:08:01,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:01,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:01,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:01,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:01,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:01,718 INFO L87 Difference]: Start difference. First operand 8198 states and 11012 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:01,765 INFO L93 Difference]: Finished difference Result 13833 states and 18566 transitions. [2024-11-09 08:08:01,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:01,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 08:08:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:01,792 INFO L225 Difference]: With dead ends: 13833 [2024-11-09 08:08:01,793 INFO L226 Difference]: Without dead ends: 13833 [2024-11-09 08:08:01,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:01,794 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 30 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:01,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 126 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:01,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13833 states. [2024-11-09 08:08:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13833 to 12294. [2024-11-09 08:08:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12294 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12294 states to 12294 states and 16004 transitions. [2024-11-09 08:08:02,045 INFO L78 Accepts]: Start accepts. Automaton has 12294 states and 16004 transitions. Word has length 27 [2024-11-09 08:08:02,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:02,046 INFO L471 AbstractCegarLoop]: Abstraction has 12294 states and 16004 transitions. [2024-11-09 08:08:02,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:02,046 INFO L276 IsEmpty]: Start isEmpty. Operand 12294 states and 16004 transitions. [2024-11-09 08:08:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 08:08:02,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:02,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:02,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 08:08:02,060 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:02,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:02,060 INFO L85 PathProgramCache]: Analyzing trace with hash -203931427, now seen corresponding path program 1 times [2024-11-09 08:08:02,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:02,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217926935] [2024-11-09 08:08:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:02,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:02,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:02,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217926935] [2024-11-09 08:08:02,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217926935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:02,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:02,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:02,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132288611] [2024-11-09 08:08:02,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:02,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:02,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:02,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:02,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:02,085 INFO L87 Difference]: Start difference. First operand 12294 states and 16004 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:02,134 INFO L93 Difference]: Finished difference Result 15881 states and 20230 transitions. [2024-11-09 08:08:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:02,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 08:08:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:02,163 INFO L225 Difference]: With dead ends: 15881 [2024-11-09 08:08:02,164 INFO L226 Difference]: Without dead ends: 15881 [2024-11-09 08:08:02,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:02,164 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:02,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 167 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15881 states. [2024-11-09 08:08:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15881 to 15878. [2024-11-09 08:08:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15878 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15878 states to 15878 states and 20228 transitions. [2024-11-09 08:08:02,652 INFO L78 Accepts]: Start accepts. Automaton has 15878 states and 20228 transitions. Word has length 27 [2024-11-09 08:08:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:02,652 INFO L471 AbstractCegarLoop]: Abstraction has 15878 states and 20228 transitions. [2024-11-09 08:08:02,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 15878 states and 20228 transitions. [2024-11-09 08:08:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 08:08:02,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:02,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:02,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 08:08:02,672 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:02,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:02,674 INFO L85 PathProgramCache]: Analyzing trace with hash -999156575, now seen corresponding path program 1 times [2024-11-09 08:08:02,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:02,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213701755] [2024-11-09 08:08:02,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:02,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:02,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:02,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213701755] [2024-11-09 08:08:02,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213701755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:02,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:02,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:02,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974110719] [2024-11-09 08:08:02,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:02,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:02,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:02,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:02,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:02,707 INFO L87 Difference]: Start difference. First operand 15878 states and 20228 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:02,770 INFO L93 Difference]: Finished difference Result 16137 states and 20230 transitions. [2024-11-09 08:08:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:02,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 08:08:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:02,801 INFO L225 Difference]: With dead ends: 16137 [2024-11-09 08:08:02,802 INFO L226 Difference]: Without dead ends: 16137 [2024-11-09 08:08:02,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:02,803 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 147 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:02,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 147 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:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2024-11-09 08:08:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 16134. [2024-11-09 08:08:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16134 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16134 states to 16134 states and 20228 transitions. [2024-11-09 08:08:03,204 INFO L78 Accepts]: Start accepts. Automaton has 16134 states and 20228 transitions. Word has length 28 [2024-11-09 08:08:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:03,205 INFO L471 AbstractCegarLoop]: Abstraction has 16134 states and 20228 transitions. [2024-11-09 08:08:03,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states and 20228 transitions. [2024-11-09 08:08:03,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 08:08:03,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:03,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:03,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 08:08:03,223 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:03,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:03,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2020224929, now seen corresponding path program 1 times [2024-11-09 08:08:03,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:03,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179646406] [2024-11-09 08:08:03,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:03,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:03,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:03,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:03,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179646406] [2024-11-09 08:08:03,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179646406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:03,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:03,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:03,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242355382] [2024-11-09 08:08:03,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:03,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:03,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:03,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:03,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:03,257 INFO L87 Difference]: Start difference. First operand 16134 states and 20228 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:03,345 INFO L93 Difference]: Finished difference Result 26633 states and 33030 transitions. [2024-11-09 08:08:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:03,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 08:08:03,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:03,398 INFO L225 Difference]: With dead ends: 26633 [2024-11-09 08:08:03,398 INFO L226 Difference]: Without dead ends: 26633 [2024-11-09 08:08:03,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:03,399 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 124 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:03,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 124 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:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26633 states. [2024-11-09 08:08:03,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26633 to 24582. [2024-11-09 08:08:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24582 states, 24581 states have (on average 1.2186648224238232) internal successors, (29956), 24581 states have internal predecessors, (29956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24582 states to 24582 states and 29956 transitions. [2024-11-09 08:08:03,873 INFO L78 Accepts]: Start accepts. Automaton has 24582 states and 29956 transitions. Word has length 28 [2024-11-09 08:08:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:03,873 INFO L471 AbstractCegarLoop]: Abstraction has 24582 states and 29956 transitions. [2024-11-09 08:08:03,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 24582 states and 29956 transitions. [2024-11-09 08:08:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 08:08:03,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:03,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:03,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 08:08:03,896 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:03,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:03,897 INFO L85 PathProgramCache]: Analyzing trace with hash 994878689, now seen corresponding path program 1 times [2024-11-09 08:08:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:03,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276098813] [2024-11-09 08:08:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:04,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:04,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276098813] [2024-11-09 08:08:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276098813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:04,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:04,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:04,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092339399] [2024-11-09 08:08:04,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:04,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:04,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:04,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:04,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:04,051 INFO L87 Difference]: Start difference. First operand 24582 states and 29956 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:04,150 INFO L93 Difference]: Finished difference Result 31241 states and 36870 transitions. [2024-11-09 08:08:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:04,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 08:08:04,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:04,190 INFO L225 Difference]: With dead ends: 31241 [2024-11-09 08:08:04,190 INFO L226 Difference]: Without dead ends: 31241 [2024-11-09 08:08:04,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:04,191 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:04,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 168 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31241 states. [2024-11-09 08:08:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31241 to 31238. [2024-11-09 08:08:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31238 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31238 states to 31238 states and 36868 transitions. [2024-11-09 08:08:04,755 INFO L78 Accepts]: Start accepts. Automaton has 31238 states and 36868 transitions. Word has length 28 [2024-11-09 08:08:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:04,755 INFO L471 AbstractCegarLoop]: Abstraction has 31238 states and 36868 transitions. [2024-11-09 08:08:04,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 31238 states and 36868 transitions. [2024-11-09 08:08:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:08:04,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:04,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:04,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 08:08:04,904 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:04,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1804229224, now seen corresponding path program 1 times [2024-11-09 08:08:04,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:04,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812690726] [2024-11-09 08:08:04,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:04,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:04,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:04,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812690726] [2024-11-09 08:08:04,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812690726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:04,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:04,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:04,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060069047] [2024-11-09 08:08:04,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:04,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:04,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:04,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:04,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:04,935 INFO L87 Difference]: Start difference. First operand 31238 states and 36868 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:05,022 INFO L93 Difference]: Finished difference Result 31753 states and 36870 transitions. [2024-11-09 08:08:05,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:05,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 08:08:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:05,060 INFO L225 Difference]: With dead ends: 31753 [2024-11-09 08:08:05,060 INFO L226 Difference]: Without dead ends: 31753 [2024-11-09 08:08:05,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:05,061 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 47 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 143 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:05,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 143 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:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31753 states. [2024-11-09 08:08:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31753 to 31750. [2024-11-09 08:08:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31750 states, 31749 states have (on average 1.1612334246747928) internal successors, (36868), 31749 states have internal predecessors, (36868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31750 states to 31750 states and 36868 transitions. [2024-11-09 08:08:05,650 INFO L78 Accepts]: Start accepts. Automaton has 31750 states and 36868 transitions. Word has length 29 [2024-11-09 08:08:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:05,650 INFO L471 AbstractCegarLoop]: Abstraction has 31750 states and 36868 transitions. [2024-11-09 08:08:05,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 31750 states and 36868 transitions. [2024-11-09 08:08:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:08:05,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:05,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:05,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 08:08:05,670 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:05,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash 783160870, now seen corresponding path program 1 times [2024-11-09 08:08:05,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:05,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154664151] [2024-11-09 08:08:05,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:05,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:05,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154664151] [2024-11-09 08:08:05,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154664151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:05,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:05,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:05,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785864626] [2024-11-09 08:08:05,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:05,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:05,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:05,702 INFO L87 Difference]: Start difference. First operand 31750 states and 36868 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:05,854 INFO L93 Difference]: Finished difference Result 61446 states and 67588 transitions. [2024-11-09 08:08:05,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:05,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 08:08:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:05,913 INFO L225 Difference]: With dead ends: 61446 [2024-11-09 08:08:05,915 INFO L226 Difference]: Without dead ends: 31750 [2024-11-09 08:08:05,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:05,915 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 43 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 140 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:05,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 140 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:05,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31750 states. [2024-11-09 08:08:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31750 to 31750. [2024-11-09 08:08:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31750 states, 31749 states have (on average 1.0967274559828657) internal successors, (34820), 31749 states have internal predecessors, (34820), 0 states have call successors, (0), 0 states 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:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31750 states to 31750 states and 34820 transitions. [2024-11-09 08:08:06,451 INFO L78 Accepts]: Start accepts. Automaton has 31750 states and 34820 transitions. Word has length 29 [2024-11-09 08:08:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:06,451 INFO L471 AbstractCegarLoop]: Abstraction has 31750 states and 34820 transitions. [2024-11-09 08:08:06,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 31750 states and 34820 transitions. [2024-11-09 08:08:06,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:08:06,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:06,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:06,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 08:08:06,470 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:06,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:06,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2063024548, now seen corresponding path program 1 times [2024-11-09 08:08:06,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:06,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979534521] [2024-11-09 08:08:06,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:06,487 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:06,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:06,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979534521] [2024-11-09 08:08:06,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979534521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:06,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:06,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:06,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800113881] [2024-11-09 08:08:06,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:06,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:06,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:06,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:06,490 INFO L87 Difference]: Start difference. First operand 31750 states and 34820 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:06,589 INFO L93 Difference]: Finished difference Result 31747 states and 33794 transitions. [2024-11-09 08:08:06,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:06,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 08:08:06,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:06,590 INFO L225 Difference]: With dead ends: 31747 [2024-11-09 08:08:06,590 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 08:08:06,590 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:06,591 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:06,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 08:08:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 08:08:06,592 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:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 08:08:06,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-11-09 08:08:06,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:06,592 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 08:08:06,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 08:08:06,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 08:08:06,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-09 08:08:06,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-09 08:08:06,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 08:08:06,600 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:06,602 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 08:08:06,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:08:06 BoogieIcfgContainer [2024-11-09 08:08:06,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 08:08:06,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 08:08:06,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 08:08:06,606 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 08:08:06,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:57" (3/4) ... [2024-11-09 08:08:06,609 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 08:08:06,620 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-09 08:08:06,621 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-09 08:08:06,621 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 08:08:06,621 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 08:08:06,726 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 08:08:06,727 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 08:08:06,727 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 08:08:06,727 INFO L158 Benchmark]: Toolchain (without parser) took 9633.58ms. Allocated memory was 144.7MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 87.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 461.8MB. Max. memory is 16.1GB. [2024-11-09 08:08:06,727 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 144.7MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:08:06,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.32ms. Allocated memory is still 144.7MB. Free memory was 87.8MB in the beginning and 73.9MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 08:08:06,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.03ms. Allocated memory is still 144.7MB. Free memory was 73.9MB in the beginning and 72.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:08:06,728 INFO L158 Benchmark]: Boogie Preprocessor took 43.40ms. Allocated memory is still 144.7MB. Free memory was 72.1MB in the beginning and 70.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:08:06,728 INFO L158 Benchmark]: RCFGBuilder took 469.13ms. Allocated memory was 144.7MB in the beginning and 205.5MB in the end (delta: 60.8MB). Free memory was 70.1MB in the beginning and 170.5MB in the end (delta: -100.5MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-09 08:08:06,728 INFO L158 Benchmark]: TraceAbstraction took 8607.31ms. Allocated memory was 205.5MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 169.5MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 475.7MB. Max. memory is 16.1GB. [2024-11-09 08:08:06,728 INFO L158 Benchmark]: Witness Printer took 121.12ms. Allocated memory is still 2.8GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 08:08:06,731 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 144.7MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.32ms. Allocated memory is still 144.7MB. Free memory was 87.8MB in the beginning and 73.9MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.03ms. Allocated memory is still 144.7MB. Free memory was 73.9MB in the beginning and 72.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.40ms. Allocated memory is still 144.7MB. Free memory was 72.1MB in the beginning and 70.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 469.13ms. Allocated memory was 144.7MB in the beginning and 205.5MB in the end (delta: 60.8MB). Free memory was 70.1MB in the beginning and 170.5MB in the end (delta: -100.5MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8607.31ms. Allocated memory was 205.5MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 169.5MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 475.7MB. Max. memory is 16.1GB. * Witness Printer took 121.12ms. Allocated memory is still 2.8GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 46 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1494 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1494 mSDsluCounter, 4807 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1861 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2946 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31750occurred in iteration=31, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 6205 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 762 NumberOfCodeBlocks, 762 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 1540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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:06,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE