./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 15:02:19,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 15:02:20,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 15:02:20,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 15:02:20,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 15:02:20,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 15:02:20,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 15:02:20,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 15:02:20,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 15:02:20,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 15:02:20,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 15:02:20,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 15:02:20,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 15:02:20,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 15:02:20,100 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 15:02:20,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 15:02:20,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 15:02:20,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 15:02:20,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 15:02:20,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 15:02:20,101 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 15:02:20,104 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 15:02:20,104 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 15:02:20,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 15:02:20,104 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 15:02:20,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 15:02:20,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 15:02:20,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 15:02:20,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 15:02:20,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 15:02:20,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 15:02:20,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 15:02:20,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 15:02:20,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 15:02:20,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 15:02:20,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 15:02:20,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 15:02:20,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 15:02:20,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 15:02:20,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 15:02:20,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 15:02:20,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 15:02:20,109 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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2024-11-20 15:02:20,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 15:02:20,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 15:02:20,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 15:02:20,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 15:02:20,386 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 15:02:20,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2024-11-20 15:02:22,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 15:02:22,391 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 15:02:22,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2024-11-20 15:02:22,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e62805c/c1afab088cb84ef0ae451dccb925a575/FLAG4b1456cde [2024-11-20 15:02:22,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e62805c/c1afab088cb84ef0ae451dccb925a575 [2024-11-20 15:02:22,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 15:02:22,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 15:02:22,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 15:02:22,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 15:02:22,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 15:02:22,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bea21c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22, skipping insertion in model container [2024-11-20 15:02:22,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 15:02:22,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 15:02:22,744 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 15:02:22,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 15:02:22,812 INFO L204 MainTranslator]: Completed translation [2024-11-20 15:02:22,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22 WrapperNode [2024-11-20 15:02:22,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 15:02:22,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 15:02:22,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 15:02:22,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 15:02:22,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,867 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 137 [2024-11-20 15:02:22,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 15:02:22,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 15:02:22,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 15:02:22,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 15:02:22,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,897 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-20 15:02:22,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 15:02:22,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 15:02:22,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 15:02:22,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 15:02:22,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (1/1) ... [2024-11-20 15:02:22,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 15:02:22,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:02:22,981 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-20 15:02:22,991 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-20 15:02:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 15:02:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 15:02:23,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 15:02:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 15:02:23,209 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 15:02:23,211 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 15:02:23,418 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-20 15:02:23,418 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 15:02:23,427 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 15:02:23,427 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 15:02:23,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:02:23 BoogieIcfgContainer [2024-11-20 15:02:23,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 15:02:23,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 15:02:23,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 15:02:23,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 15:02:23,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:02:22" (1/3) ... [2024-11-20 15:02:23,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1907bd4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:02:23, skipping insertion in model container [2024-11-20 15:02:23,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:22" (2/3) ... [2024-11-20 15:02:23,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1907bd4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:02:23, skipping insertion in model container [2024-11-20 15:02:23,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:02:23" (3/3) ... [2024-11-20 15:02:23,434 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2024-11-20 15:02:23,446 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 15:02:23,449 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 15:02:23,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 15:02:23,486 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;@234b3906, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 15:02:23,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 15:02:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 37 states have (on average 1.864864864864865) internal successors, (69), 39 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 15:02:23,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:23,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 15:02:23,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:23,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash 28702926, now seen corresponding path program 1 times [2024-11-20 15:02:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:23,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201446867] [2024-11-20 15:02:23,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:23,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:23,607 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-20 15:02:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:23,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201446867] [2024-11-20 15:02:23,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201446867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:23,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:23,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 15:02:23,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223052451] [2024-11-20 15:02:23,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:23,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 15:02:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:23,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 15:02:23,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 15:02:23,648 INFO L87 Difference]: Start difference. First operand has 40 states, 37 states have (on average 1.864864864864865) internal successors, (69), 39 states have internal predecessors, (69), 0 states have call successors, (0), 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-20 15:02:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:23,659 INFO L93 Difference]: Finished difference Result 39 states and 65 transitions. [2024-11-20 15:02:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 15:02:23,661 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-20 15:02:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:23,667 INFO L225 Difference]: With dead ends: 39 [2024-11-20 15:02:23,668 INFO L226 Difference]: Without dead ends: 37 [2024-11-20 15:02:23,669 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-20 15:02:23,673 INFO L432 NwaCegarLoop]: 65 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, 65 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-20 15:02:23,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-20 15:02:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-20 15:02:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2024-11-20 15:02:23,725 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 5 [2024-11-20 15:02:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:23,725 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2024-11-20 15:02:23,725 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-20 15:02:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2024-11-20 15:02:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 15:02:23,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:23,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 15:02:23,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 15:02:23,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:23,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:23,727 INFO L85 PathProgramCache]: Analyzing trace with hash 889697422, now seen corresponding path program 1 times [2024-11-20 15:02:23,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:23,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266672730] [2024-11-20 15:02:23,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:23,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:23,804 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-20 15:02:23,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:23,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266672730] [2024-11-20 15:02:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266672730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:23,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:23,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 15:02:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950653708] [2024-11-20 15:02:23,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:23,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:23,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:23,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:23,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:23,807 INFO L87 Difference]: Start difference. First operand 37 states and 63 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-20 15:02:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:23,813 INFO L93 Difference]: Finished difference Result 36 states and 62 transitions. [2024-11-20 15:02:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:23,814 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-20 15:02:23,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:23,814 INFO L225 Difference]: With dead ends: 36 [2024-11-20 15:02:23,814 INFO L226 Difference]: Without dead ends: 34 [2024-11-20 15:02:23,814 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-20 15:02:23,815 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 62 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-20 15:02:23,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 62 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-20 15:02:23,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-20 15:02:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. [2024-11-20 15:02:23,819 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 6 [2024-11-20 15:02:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:23,819 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 60 transitions. [2024-11-20 15:02:23,819 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-20 15:02:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 60 transitions. [2024-11-20 15:02:23,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 15:02:23,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:23,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:23,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 15:02:23,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:23,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash 153349257, now seen corresponding path program 1 times [2024-11-20 15:02:23,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:23,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42514712] [2024-11-20 15:02:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:23,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:23,883 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-20 15:02:23,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:23,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42514712] [2024-11-20 15:02:23,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42514712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:23,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:23,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:23,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494539139] [2024-11-20 15:02:23,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:23,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:23,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:23,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:23,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:23,886 INFO L87 Difference]: Start difference. First operand 34 states and 60 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:23,907 INFO L93 Difference]: Finished difference Result 65 states and 115 transitions. [2024-11-20 15:02:23,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:23,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-20 15:02:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:23,909 INFO L225 Difference]: With dead ends: 65 [2024-11-20 15:02:23,909 INFO L226 Difference]: Without dead ends: 65 [2024-11-20 15:02:23,909 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-20 15:02:23,910 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 118 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-20 15:02:23,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-20 15:02:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2024-11-20 15:02:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 79 transitions. [2024-11-20 15:02:23,917 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 79 transitions. Word has length 17 [2024-11-20 15:02:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:23,917 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 79 transitions. [2024-11-20 15:02:23,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 79 transitions. [2024-11-20 15:02:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 15:02:23,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:23,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:23,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 15:02:23,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:23,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:23,919 INFO L85 PathProgramCache]: Analyzing trace with hash -433456757, now seen corresponding path program 1 times [2024-11-20 15:02:23,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:23,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272589173] [2024-11-20 15:02:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:23,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:23,973 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-20 15:02:23,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:23,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272589173] [2024-11-20 15:02:23,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272589173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:23,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:23,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:23,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871055369] [2024-11-20 15:02:23,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:23,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:23,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:23,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:23,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:23,976 INFO L87 Difference]: Start difference. First operand 44 states and 79 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:23,993 INFO L93 Difference]: Finished difference Result 65 states and 113 transitions. [2024-11-20 15:02:23,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:23,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-20 15:02:23,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:23,994 INFO L225 Difference]: With dead ends: 65 [2024-11-20 15:02:23,994 INFO L226 Difference]: Without dead ends: 65 [2024-11-20 15:02:23,994 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-20 15:02:23,995 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 44 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 131 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-20 15:02:23,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 131 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-20 15:02:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2024-11-20 15:02:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 111 transitions. [2024-11-20 15:02:24,001 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 111 transitions. Word has length 17 [2024-11-20 15:02:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,001 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 111 transitions. [2024-11-20 15:02:24,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 111 transitions. [2024-11-20 15:02:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 15:02:24,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:24,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 15:02:24,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,003 INFO L85 PathProgramCache]: Analyzing trace with hash 465478223, now seen corresponding path program 1 times [2024-11-20 15:02:24,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864604126] [2024-11-20 15:02:24,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,039 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-20 15:02:24,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864604126] [2024-11-20 15:02:24,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864604126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374989798] [2024-11-20 15:02:24,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,042 INFO L87 Difference]: Start difference. First operand 62 states and 111 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,055 INFO L93 Difference]: Finished difference Result 68 states and 115 transitions. [2024-11-20 15:02:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 15:02:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,056 INFO L225 Difference]: With dead ends: 68 [2024-11-20 15:02:24,056 INFO L226 Difference]: Without dead ends: 68 [2024-11-20 15:02:24,057 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-20 15:02:24,058 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 46 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 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-20 15:02:24,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-20 15:02:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2024-11-20 15:02:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 113 transitions. [2024-11-20 15:02:24,063 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 113 transitions. Word has length 18 [2024-11-20 15:02:24,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,064 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 113 transitions. [2024-11-20 15:02:24,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 113 transitions. [2024-11-20 15:02:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 15:02:24,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:24,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 15:02:24,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash -545639027, now seen corresponding path program 1 times [2024-11-20 15:02:24,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252181336] [2024-11-20 15:02:24,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,097 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-20 15:02:24,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252181336] [2024-11-20 15:02:24,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252181336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377368659] [2024-11-20 15:02:24,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,099 INFO L87 Difference]: Start difference. First operand 65 states and 113 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,111 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2024-11-20 15:02:24,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 15:02:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,113 INFO L225 Difference]: With dead ends: 121 [2024-11-20 15:02:24,114 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 15:02:24,114 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-20 15:02:24,115 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 41 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 116 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-20 15:02:24,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 15:02:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2024-11-20 15:02:24,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 150 transitions. [2024-11-20 15:02:24,121 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 150 transitions. Word has length 18 [2024-11-20 15:02:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,121 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 150 transitions. [2024-11-20 15:02:24,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 150 transitions. [2024-11-20 15:02:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 15:02:24,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:24,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 15:02:24,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1132445041, now seen corresponding path program 1 times [2024-11-20 15:02:24,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964795461] [2024-11-20 15:02:24,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,163 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-20 15:02:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964795461] [2024-11-20 15:02:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964795461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326493983] [2024-11-20 15:02:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,166 INFO L87 Difference]: Start difference. First operand 86 states and 150 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,177 INFO L93 Difference]: Finished difference Result 123 states and 210 transitions. [2024-11-20 15:02:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 15:02:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,179 INFO L225 Difference]: With dead ends: 123 [2024-11-20 15:02:24,179 INFO L226 Difference]: Without dead ends: 123 [2024-11-20 15:02:24,179 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-20 15:02:24,180 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 132 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-20 15:02:24,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 132 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-20 15:02:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2024-11-20 15:02:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 208 transitions. [2024-11-20 15:02:24,187 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 208 transitions. Word has length 18 [2024-11-20 15:02:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,187 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 208 transitions. [2024-11-20 15:02:24,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 208 transitions. [2024-11-20 15:02:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 15:02:24,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,188 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-20 15:02:24,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 15:02:24,188 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,189 INFO L85 PathProgramCache]: Analyzing trace with hash 271688470, now seen corresponding path program 1 times [2024-11-20 15:02:24,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715327956] [2024-11-20 15:02:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:24,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715327956] [2024-11-20 15:02:24,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715327956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957134712] [2024-11-20 15:02:24,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,222 INFO L87 Difference]: Start difference. First operand 120 states and 208 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-20 15:02:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,232 INFO L93 Difference]: Finished difference Result 125 states and 210 transitions. [2024-11-20 15:02:24,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,232 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-20 15:02:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,237 INFO L225 Difference]: With dead ends: 125 [2024-11-20 15:02:24,237 INFO L226 Difference]: Without dead ends: 125 [2024-11-20 15:02:24,237 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-20 15:02:24,238 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 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-20 15:02:24,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-20 15:02:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2024-11-20 15:02:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 208 transitions. [2024-11-20 15:02:24,247 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 208 transitions. Word has length 19 [2024-11-20 15:02:24,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,247 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 208 transitions. [2024-11-20 15:02:24,247 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-20 15:02:24,248 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 208 transitions. [2024-11-20 15:02:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 15:02:24,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,248 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-20 15:02:24,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 15:02:24,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash -739428780, now seen corresponding path program 1 times [2024-11-20 15:02:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068164831] [2024-11-20 15:02:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,270 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-20 15:02:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068164831] [2024-11-20 15:02:24,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068164831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166499349] [2024-11-20 15:02:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,273 INFO L87 Difference]: Start difference. First operand 122 states and 208 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-20 15:02:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,283 INFO L93 Difference]: Finished difference Result 233 states and 390 transitions. [2024-11-20 15:02:24,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,284 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-20 15:02:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,285 INFO L225 Difference]: With dead ends: 233 [2024-11-20 15:02:24,285 INFO L226 Difference]: Without dead ends: 233 [2024-11-20 15:02:24,285 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-20 15:02:24,286 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:02:24,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-20 15:02:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2024-11-20 15:02:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.6943231441048034) internal successors, (388), 229 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 388 transitions. [2024-11-20 15:02:24,294 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 388 transitions. Word has length 19 [2024-11-20 15:02:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,294 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 388 transitions. [2024-11-20 15:02:24,294 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-20 15:02:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 388 transitions. [2024-11-20 15:02:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 15:02:24,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,296 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-20 15:02:24,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 15:02:24,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,296 INFO L85 PathProgramCache]: Analyzing trace with hash -152622766, now seen corresponding path program 1 times [2024-11-20 15:02:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132991867] [2024-11-20 15:02:24,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,323 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-20 15:02:24,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132991867] [2024-11-20 15:02:24,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132991867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862699106] [2024-11-20 15:02:24,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,325 INFO L87 Difference]: Start difference. First operand 230 states and 388 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-20 15:02:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,333 INFO L93 Difference]: Finished difference Result 289 states and 490 transitions. [2024-11-20 15:02:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,333 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-20 15:02:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,334 INFO L225 Difference]: With dead ends: 289 [2024-11-20 15:02:24,335 INFO L226 Difference]: Without dead ends: 289 [2024-11-20 15:02:24,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-20 15:02:24,335 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 38 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 155 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-20 15:02:24,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 155 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-20 15:02:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 230. [2024-11-20 15:02:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 384 transitions. [2024-11-20 15:02:24,346 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 384 transitions. Word has length 19 [2024-11-20 15:02:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,346 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 384 transitions. [2024-11-20 15:02:24,346 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-20 15:02:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 384 transitions. [2024-11-20 15:02:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 15:02:24,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,347 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-20 15:02:24,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 15:02:24,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1440816006, now seen corresponding path program 1 times [2024-11-20 15:02:24,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194203333] [2024-11-20 15:02:24,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,377 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-20 15:02:24,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194203333] [2024-11-20 15:02:24,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194203333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433995865] [2024-11-20 15:02:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,379 INFO L87 Difference]: Start difference. First operand 230 states and 384 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-20 15:02:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,409 INFO L93 Difference]: Finished difference Result 421 states and 706 transitions. [2024-11-20 15:02:24,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,410 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-20 15:02:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,411 INFO L225 Difference]: With dead ends: 421 [2024-11-20 15:02:24,411 INFO L226 Difference]: Without dead ends: 421 [2024-11-20 15:02:24,412 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-20 15:02:24,412 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 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-20 15:02:24,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-20 15:02:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 322. [2024-11-20 15:02:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.644859813084112) internal successors, (528), 321 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 528 transitions. [2024-11-20 15:02:24,421 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 528 transitions. Word has length 20 [2024-11-20 15:02:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,421 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 528 transitions. [2024-11-20 15:02:24,422 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-20 15:02:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 528 transitions. [2024-11-20 15:02:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 15:02:24,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,423 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-20 15:02:24,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 15:02:24,424 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2027622020, now seen corresponding path program 1 times [2024-11-20 15:02:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84088452] [2024-11-20 15:02:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,448 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-20 15:02:24,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84088452] [2024-11-20 15:02:24,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84088452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581690936] [2024-11-20 15:02:24,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,450 INFO L87 Difference]: Start difference. First operand 322 states and 528 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-20 15:02:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,460 INFO L93 Difference]: Finished difference Result 445 states and 718 transitions. [2024-11-20 15:02:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,460 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-20 15:02:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,462 INFO L225 Difference]: With dead ends: 445 [2024-11-20 15:02:24,462 INFO L226 Difference]: Without dead ends: 445 [2024-11-20 15:02:24,462 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-20 15:02:24,462 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 134 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-20 15:02:24,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-20 15:02:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 442. [2024-11-20 15:02:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.6235827664399094) internal successors, (716), 441 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 716 transitions. [2024-11-20 15:02:24,471 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 716 transitions. Word has length 20 [2024-11-20 15:02:24,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,471 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 716 transitions. [2024-11-20 15:02:24,471 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-20 15:02:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 716 transitions. [2024-11-20 15:02:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 15:02:24,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,475 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-20 15:02:24,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 15:02:24,475 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1708972961, now seen corresponding path program 1 times [2024-11-20 15:02:24,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982335659] [2024-11-20 15:02:24,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,496 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-20 15:02:24,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982335659] [2024-11-20 15:02:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982335659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22134333] [2024-11-20 15:02:24,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,498 INFO L87 Difference]: Start difference. First operand 442 states and 716 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-20 15:02:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,506 INFO L93 Difference]: Finished difference Result 457 states and 726 transitions. [2024-11-20 15:02:24,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,506 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-20 15:02:24,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,508 INFO L225 Difference]: With dead ends: 457 [2024-11-20 15:02:24,508 INFO L226 Difference]: Without dead ends: 457 [2024-11-20 15:02:24,508 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-20 15:02:24,509 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 135 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-20 15:02:24,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-20 15:02:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 454. [2024-11-20 15:02:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 724 transitions. [2024-11-20 15:02:24,518 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 724 transitions. Word has length 21 [2024-11-20 15:02:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,518 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 724 transitions. [2024-11-20 15:02:24,518 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-20 15:02:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 724 transitions. [2024-11-20 15:02:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 15:02:24,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,519 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-20 15:02:24,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 15:02:24,519 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1574877085, now seen corresponding path program 1 times [2024-11-20 15:02:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324479917] [2024-11-20 15:02:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,545 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-20 15:02:24,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324479917] [2024-11-20 15:02:24,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324479917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848392046] [2024-11-20 15:02:24,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,547 INFO L87 Difference]: Start difference. First operand 454 states and 724 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-20 15:02:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,556 INFO L93 Difference]: Finished difference Result 809 states and 1294 transitions. [2024-11-20 15:02:24,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,557 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-20 15:02:24,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,559 INFO L225 Difference]: With dead ends: 809 [2024-11-20 15:02:24,559 INFO L226 Difference]: Without dead ends: 809 [2024-11-20 15:02:24,559 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-20 15:02:24,560 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 32 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 110 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-20 15:02:24,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 110 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-20 15:02:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 646. [2024-11-20 15:02:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1004 transitions. [2024-11-20 15:02:24,571 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1004 transitions. Word has length 21 [2024-11-20 15:02:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,571 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 1004 transitions. [2024-11-20 15:02:24,571 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-20 15:02:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1004 transitions. [2024-11-20 15:02:24,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 15:02:24,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,572 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-20 15:02:24,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 15:02:24,572 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,573 INFO L85 PathProgramCache]: Analyzing trace with hash 988071071, now seen corresponding path program 1 times [2024-11-20 15:02:24,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514357121] [2024-11-20 15:02:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,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-20 15:02:24,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514357121] [2024-11-20 15:02:24,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514357121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564783761] [2024-11-20 15:02:24,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,593 INFO L87 Difference]: Start difference. First operand 646 states and 1004 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-20 15:02:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,604 INFO L93 Difference]: Finished difference Result 873 states and 1334 transitions. [2024-11-20 15:02:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,605 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-20 15:02:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,607 INFO L225 Difference]: With dead ends: 873 [2024-11-20 15:02:24,607 INFO L226 Difference]: Without dead ends: 873 [2024-11-20 15:02:24,607 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-20 15:02:24,607 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 135 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-20 15:02:24,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-20 15:02:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 870. [2024-11-20 15:02:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1332 transitions. [2024-11-20 15:02:24,621 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1332 transitions. Word has length 21 [2024-11-20 15:02:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,622 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1332 transitions. [2024-11-20 15:02:24,622 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-20 15:02:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1332 transitions. [2024-11-20 15:02:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 15:02:24,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,623 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-20 15:02:24,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 15:02:24,623 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1583210215, now seen corresponding path program 1 times [2024-11-20 15:02:24,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517129015] [2024-11-20 15:02:24,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,651 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-20 15:02:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517129015] [2024-11-20 15:02:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517129015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133589507] [2024-11-20 15:02:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,654 INFO L87 Difference]: Start difference. First operand 870 states and 1332 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-20 15:02:24,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,665 INFO L93 Difference]: Finished difference Result 889 states and 1334 transitions. [2024-11-20 15:02:24,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,666 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-20 15:02:24,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,668 INFO L225 Difference]: With dead ends: 889 [2024-11-20 15:02:24,668 INFO L226 Difference]: Without dead ends: 889 [2024-11-20 15:02:24,668 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-20 15:02:24,669 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:02:24,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-20 15:02:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 886. [2024-11-20 15:02:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1332 transitions. [2024-11-20 15:02:24,681 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1332 transitions. Word has length 22 [2024-11-20 15:02:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,681 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1332 transitions. [2024-11-20 15:02:24,681 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-20 15:02:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1332 transitions. [2024-11-20 15:02:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 15:02:24,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,683 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-20 15:02:24,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 15:02:24,683 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash 572092965, now seen corresponding path program 1 times [2024-11-20 15:02:24,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678319401] [2024-11-20 15:02:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,699 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-20 15:02:24,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678319401] [2024-11-20 15:02:24,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678319401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622196850] [2024-11-20 15:02:24,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,700 INFO L87 Difference]: Start difference. First operand 886 states and 1332 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-20 15:02:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,711 INFO L93 Difference]: Finished difference Result 1545 states and 2326 transitions. [2024-11-20 15:02:24,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,711 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-20 15:02:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,715 INFO L225 Difference]: With dead ends: 1545 [2024-11-20 15:02:24,715 INFO L226 Difference]: Without dead ends: 1545 [2024-11-20 15:02:24,716 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-20 15:02:24,716 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 108 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-20 15:02:24,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-20 15:02:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1286. [2024-11-20 15:02:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1876 transitions. [2024-11-20 15:02:24,731 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1876 transitions. Word has length 22 [2024-11-20 15:02:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,732 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1876 transitions. [2024-11-20 15:02:24,732 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-20 15:02:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1876 transitions. [2024-11-20 15:02:24,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 15:02:24,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,733 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-20 15:02:24,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 15:02:24,733 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,734 INFO L85 PathProgramCache]: Analyzing trace with hash -14713049, now seen corresponding path program 1 times [2024-11-20 15:02:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56450220] [2024-11-20 15:02:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:24,852 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-20 15:02:24,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:24,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56450220] [2024-11-20 15:02:24,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56450220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:24,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:24,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:24,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076624461] [2024-11-20 15:02:24,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:24,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:24,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:24,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:24,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:24,854 INFO L87 Difference]: Start difference. First operand 1286 states and 1876 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-20 15:02:24,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:24,884 INFO L93 Difference]: Finished difference Result 1705 states and 2438 transitions. [2024-11-20 15:02:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:24,884 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-20 15:02:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:24,893 INFO L225 Difference]: With dead ends: 1705 [2024-11-20 15:02:24,893 INFO L226 Difference]: Without dead ends: 1705 [2024-11-20 15:02:24,894 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-20 15:02:24,894 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 136 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-20 15:02:24,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2024-11-20 15:02:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1702. [2024-11-20 15:02:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2436 transitions. [2024-11-20 15:02:24,973 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2436 transitions. Word has length 22 [2024-11-20 15:02:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:24,974 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2436 transitions. [2024-11-20 15:02:24,974 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-20 15:02:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2436 transitions. [2024-11-20 15:02:24,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 15:02:24,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:24,976 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-20 15:02:24,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 15:02:24,977 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:24,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:24,977 INFO L85 PathProgramCache]: Analyzing trace with hash 561684138, now seen corresponding path program 1 times [2024-11-20 15:02:24,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:24,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961829334] [2024-11-20 15:02:24,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:24,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:25,024 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-20 15:02:25,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:25,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961829334] [2024-11-20 15:02:25,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961829334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:25,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:25,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:25,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434513732] [2024-11-20 15:02:25,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:25,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:25,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:25,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:25,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:25,026 INFO L87 Difference]: Start difference. First operand 1702 states and 2436 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-20 15:02:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:25,053 INFO L93 Difference]: Finished difference Result 1737 states and 2438 transitions. [2024-11-20 15:02:25,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:25,054 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-20 15:02:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:25,061 INFO L225 Difference]: With dead ends: 1737 [2024-11-20 15:02:25,061 INFO L226 Difference]: Without dead ends: 1737 [2024-11-20 15:02:25,061 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-20 15:02:25,066 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:02:25,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2024-11-20 15:02:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1734. [2024-11-20 15:02:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2436 transitions. [2024-11-20 15:02:25,117 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2436 transitions. Word has length 23 [2024-11-20 15:02:25,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:25,117 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2436 transitions. [2024-11-20 15:02:25,118 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-20 15:02:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2436 transitions. [2024-11-20 15:02:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 15:02:25,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:25,119 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-20 15:02:25,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 15:02:25,120 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:25,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash -449433112, now seen corresponding path program 1 times [2024-11-20 15:02:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421317592] [2024-11-20 15:02:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:25,165 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-20 15:02:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:25,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421317592] [2024-11-20 15:02:25,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421317592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:25,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:25,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:25,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130630892] [2024-11-20 15:02:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:25,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:25,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:25,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:25,167 INFO L87 Difference]: Start difference. First operand 1734 states and 2436 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-20 15:02:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:25,211 INFO L93 Difference]: Finished difference Result 2953 states and 4134 transitions. [2024-11-20 15:02:25,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:25,212 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-20 15:02:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:25,223 INFO L225 Difference]: With dead ends: 2953 [2024-11-20 15:02:25,223 INFO L226 Difference]: Without dead ends: 2953 [2024-11-20 15:02:25,224 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-20 15:02:25,224 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:02:25,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 106 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2024-11-20 15:02:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2566. [2024-11-20 15:02:25,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3492 transitions. [2024-11-20 15:02:25,313 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3492 transitions. Word has length 23 [2024-11-20 15:02:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:25,313 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3492 transitions. [2024-11-20 15:02:25,314 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-20 15:02:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3492 transitions. [2024-11-20 15:02:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 15:02:25,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:25,317 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-20 15:02:25,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 15:02:25,321 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:25,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:25,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1036239126, now seen corresponding path program 1 times [2024-11-20 15:02:25,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:25,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645307832] [2024-11-20 15:02:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:25,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:25,358 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-20 15:02:25,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:25,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645307832] [2024-11-20 15:02:25,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645307832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:25,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:25,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:25,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509426006] [2024-11-20 15:02:25,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:25,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:25,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:25,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:25,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:25,362 INFO L87 Difference]: Start difference. First operand 2566 states and 3492 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-20 15:02:25,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:25,399 INFO L93 Difference]: Finished difference Result 3337 states and 4422 transitions. [2024-11-20 15:02:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:25,400 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-20 15:02:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:25,415 INFO L225 Difference]: With dead ends: 3337 [2024-11-20 15:02:25,415 INFO L226 Difference]: Without dead ends: 3337 [2024-11-20 15:02:25,416 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-20 15:02:25,420 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 137 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-20 15:02:25,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 137 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2024-11-20 15:02:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3334. [2024-11-20 15:02:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4420 transitions. [2024-11-20 15:02:25,523 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4420 transitions. Word has length 23 [2024-11-20 15:02:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:25,524 INFO L471 AbstractCegarLoop]: Abstraction has 3334 states and 4420 transitions. [2024-11-20 15:02:25,524 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-20 15:02:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4420 transitions. [2024-11-20 15:02:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 15:02:25,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:25,527 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-20 15:02:25,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 15:02:25,527 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:25,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:25,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1040842606, now seen corresponding path program 1 times [2024-11-20 15:02:25,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:25,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351742724] [2024-11-20 15:02:25,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:25,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:25,574 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-20 15:02:25,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:25,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351742724] [2024-11-20 15:02:25,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351742724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:25,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:25,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:25,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565503521] [2024-11-20 15:02:25,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:25,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:25,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:25,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:25,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:25,575 INFO L87 Difference]: Start difference. First operand 3334 states and 4420 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-20 15:02:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:25,611 INFO L93 Difference]: Finished difference Result 3401 states and 4422 transitions. [2024-11-20 15:02:25,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:25,613 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-20 15:02:25,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:25,625 INFO L225 Difference]: With dead ends: 3401 [2024-11-20 15:02:25,626 INFO L226 Difference]: Without dead ends: 3401 [2024-11-20 15:02:25,627 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-20 15:02:25,628 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 123 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-20 15:02:25,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2024-11-20 15:02:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 3398. [2024-11-20 15:02:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4420 transitions. [2024-11-20 15:02:25,725 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4420 transitions. Word has length 24 [2024-11-20 15:02:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:25,725 INFO L471 AbstractCegarLoop]: Abstraction has 3398 states and 4420 transitions. [2024-11-20 15:02:25,725 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-20 15:02:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4420 transitions. [2024-11-20 15:02:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 15:02:25,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:25,732 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-20 15:02:25,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 15:02:25,732 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:25,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:25,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2051959856, now seen corresponding path program 1 times [2024-11-20 15:02:25,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:25,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262423609] [2024-11-20 15:02:25,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:25,768 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-20 15:02:25,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:25,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262423609] [2024-11-20 15:02:25,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262423609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:25,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:25,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:25,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132497992] [2024-11-20 15:02:25,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:25,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:25,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:25,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:25,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:25,770 INFO L87 Difference]: Start difference. First operand 3398 states and 4420 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-20 15:02:25,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:25,814 INFO L93 Difference]: Finished difference Result 5641 states and 7238 transitions. [2024-11-20 15:02:25,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:25,815 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-20 15:02:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:25,849 INFO L225 Difference]: With dead ends: 5641 [2024-11-20 15:02:25,849 INFO L226 Difference]: Without dead ends: 5641 [2024-11-20 15:02:25,849 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-20 15:02:25,850 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:02:25,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5641 states. [2024-11-20 15:02:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5641 to 5126. [2024-11-20 15:02:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5126 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5126 states to 5126 states and 6468 transitions. [2024-11-20 15:02:25,989 INFO L78 Accepts]: Start accepts. Automaton has 5126 states and 6468 transitions. Word has length 24 [2024-11-20 15:02:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:25,989 INFO L471 AbstractCegarLoop]: Abstraction has 5126 states and 6468 transitions. [2024-11-20 15:02:25,990 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-20 15:02:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5126 states and 6468 transitions. [2024-11-20 15:02:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 15:02:26,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:26,001 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-20 15:02:26,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 15:02:26,001 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:26,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:26,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1656201426, now seen corresponding path program 1 times [2024-11-20 15:02:26,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:26,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302385937] [2024-11-20 15:02:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:26,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:26,038 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-20 15:02:26,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:26,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302385937] [2024-11-20 15:02:26,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302385937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:26,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:26,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:26,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693386858] [2024-11-20 15:02:26,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:26,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:26,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:26,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:26,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:26,039 INFO L87 Difference]: Start difference. First operand 5126 states and 6468 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-20 15:02:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:26,089 INFO L93 Difference]: Finished difference Result 6537 states and 7942 transitions. [2024-11-20 15:02:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:26,090 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-20 15:02:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:26,109 INFO L225 Difference]: With dead ends: 6537 [2024-11-20 15:02:26,117 INFO L226 Difference]: Without dead ends: 6537 [2024-11-20 15:02:26,117 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-20 15:02:26,118 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 138 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-20 15:02:26,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6537 states. [2024-11-20 15:02:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6537 to 6534. [2024-11-20 15:02:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6534 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 7940 transitions. [2024-11-20 15:02:26,222 INFO L78 Accepts]: Start accepts. Automaton has 6534 states and 7940 transitions. Word has length 24 [2024-11-20 15:02:26,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:26,223 INFO L471 AbstractCegarLoop]: Abstraction has 6534 states and 7940 transitions. [2024-11-20 15:02:26,223 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-20 15:02:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6534 states and 7940 transitions. [2024-11-20 15:02:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-20 15:02:26,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:26,228 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-20 15:02:26,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 15:02:26,228 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:26,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash 820446453, now seen corresponding path program 1 times [2024-11-20 15:02:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:26,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706672639] [2024-11-20 15:02:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:26,245 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-20 15:02:26,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:26,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706672639] [2024-11-20 15:02:26,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706672639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:26,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:26,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:26,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408266537] [2024-11-20 15:02:26,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:26,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:26,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:26,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:26,248 INFO L87 Difference]: Start difference. First operand 6534 states and 7940 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-20 15:02:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:26,328 INFO L93 Difference]: Finished difference Result 6665 states and 7942 transitions. [2024-11-20 15:02:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:26,330 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-20 15:02:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:26,347 INFO L225 Difference]: With dead ends: 6665 [2024-11-20 15:02:26,351 INFO L226 Difference]: Without dead ends: 6665 [2024-11-20 15:02:26,351 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-20 15:02:26,352 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:02:26,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 119 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6665 states. [2024-11-20 15:02:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6665 to 6662. [2024-11-20 15:02:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6662 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 7940 transitions. [2024-11-20 15:02:26,476 INFO L78 Accepts]: Start accepts. Automaton has 6662 states and 7940 transitions. Word has length 25 [2024-11-20 15:02:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:26,476 INFO L471 AbstractCegarLoop]: Abstraction has 6662 states and 7940 transitions. [2024-11-20 15:02:26,477 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-20 15:02:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6662 states and 7940 transitions. [2024-11-20 15:02:26,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-20 15:02:26,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:26,484 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-20 15:02:26,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 15:02:26,485 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:26,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash -190670797, now seen corresponding path program 1 times [2024-11-20 15:02:26,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:26,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904671751] [2024-11-20 15:02:26,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:26,508 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-20 15:02:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:26,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904671751] [2024-11-20 15:02:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904671751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:26,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:26,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082218280] [2024-11-20 15:02:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:26,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:26,511 INFO L87 Difference]: Start difference. First operand 6662 states and 7940 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-20 15:02:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:26,536 INFO L93 Difference]: Finished difference Result 10758 states and 12420 transitions. [2024-11-20 15:02:26,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:26,537 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-20 15:02:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:26,551 INFO L225 Difference]: With dead ends: 10758 [2024-11-20 15:02:26,551 INFO L226 Difference]: Without dead ends: 10758 [2024-11-20 15:02:26,551 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-20 15:02:26,552 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 18 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:02:26,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 100 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:26,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10758 states. [2024-11-20 15:02:26,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10758 to 10246. [2024-11-20 15:02:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10246 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10246 states to 10246 states and 11908 transitions. [2024-11-20 15:02:26,728 INFO L78 Accepts]: Start accepts. Automaton has 10246 states and 11908 transitions. Word has length 25 [2024-11-20 15:02:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:26,728 INFO L471 AbstractCegarLoop]: Abstraction has 10246 states and 11908 transitions. [2024-11-20 15:02:26,729 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-20 15:02:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 10246 states and 11908 transitions. [2024-11-20 15:02:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-20 15:02:26,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:26,741 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-20 15:02:26,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 15:02:26,741 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:26,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:26,741 INFO L85 PathProgramCache]: Analyzing trace with hash -777476811, now seen corresponding path program 1 times [2024-11-20 15:02:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:26,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892740097] [2024-11-20 15:02:26,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:26,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:26,766 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-20 15:02:26,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:26,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892740097] [2024-11-20 15:02:26,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892740097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:26,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:26,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:26,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517369704] [2024-11-20 15:02:26,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:26,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:26,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:26,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:26,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:26,768 INFO L87 Difference]: Start difference. First operand 10246 states and 11908 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-20 15:02:26,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:26,806 INFO L93 Difference]: Finished difference Result 12803 states and 14082 transitions. [2024-11-20 15:02:26,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:26,807 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-20 15:02:26,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:26,807 INFO L225 Difference]: With dead ends: 12803 [2024-11-20 15:02:26,807 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 15:02:26,808 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-20 15:02:26,808 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 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-20 15:02:26,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:02:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 15:02:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 15:02:26,809 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-20 15:02:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 15:02:26,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-11-20 15:02:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:26,810 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 15:02:26,810 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-20 15:02:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 15:02:26,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 15:02:26,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-20 15:02:26,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-20 15:02:26,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 15:02:26,816 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] [2024-11-20 15:02:26,818 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 15:02:26,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:02:26 BoogieIcfgContainer [2024-11-20 15:02:26,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 15:02:26,821 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 15:02:26,821 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 15:02:26,822 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 15:02:26,822 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:02:23" (3/4) ... [2024-11-20 15:02:26,824 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 15:02:26,833 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-20 15:02:26,834 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-20 15:02:26,834 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 15:02:26,834 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 15:02:26,915 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 15:02:26,918 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 15:02:26,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 15:02:26,919 INFO L158 Benchmark]: Toolchain (without parser) took 4492.18ms. Allocated memory was 184.5MB in the beginning and 341.8MB in the end (delta: 157.3MB). Free memory was 114.5MB in the beginning and 238.1MB in the end (delta: -123.6MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2024-11-20 15:02:26,919 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 15:02:26,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.53ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 155.8MB in the end (delta: -41.5MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-11-20 15:02:26,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.59ms. Allocated memory is still 184.5MB. Free memory was 155.8MB in the beginning and 153.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 15:02:26,920 INFO L158 Benchmark]: Boogie Preprocessor took 49.39ms. Allocated memory is still 184.5MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 15:02:26,920 INFO L158 Benchmark]: RCFGBuilder took 507.00ms. Allocated memory is still 184.5MB. Free memory was 151.8MB in the beginning and 137.0MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 15:02:26,922 INFO L158 Benchmark]: TraceAbstraction took 3391.37ms. Allocated memory was 184.5MB in the beginning and 341.8MB in the end (delta: 157.3MB). Free memory was 136.0MB in the beginning and 243.3MB in the end (delta: -107.3MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-11-20 15:02:26,922 INFO L158 Benchmark]: Witness Printer took 97.53ms. Allocated memory is still 341.8MB. Free memory was 243.3MB in the beginning and 238.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 15:02:26,923 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.18ms. Allocated memory is still 184.5MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.53ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 155.8MB in the end (delta: -41.5MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.59ms. Allocated memory is still 184.5MB. Free memory was 155.8MB in the beginning and 153.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.39ms. Allocated memory is still 184.5MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.00ms. Allocated memory is still 184.5MB. Free memory was 151.8MB in the beginning and 137.0MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3391.37ms. Allocated memory was 184.5MB in the beginning and 341.8MB in the end (delta: 157.3MB). Free memory was 136.0MB in the beginning and 243.3MB in the end (delta: -107.3MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * Witness Printer took 97.53ms. Allocated memory is still 341.8MB. Free memory was 243.3MB in the beginning and 238.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 998 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 998 mSDsluCounter, 3277 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1252 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 2025 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10246occurred in iteration=26, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 2095 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 541 NumberOfCodeBlocks, 541 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 514 ConstructedInterpolants, 0 QuantifiedInterpolants, 1053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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-20 15:02:26,943 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