./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_7.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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:06:07,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:06:07,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 07:06:07,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:06:07,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:06:07,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:06:07,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:06:07,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:06:07,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:06:07,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:06:07,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:06:07,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:06:07,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:06:07,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:06:07,863 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:06:07,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:06:07,865 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:06:07,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:06:07,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:06:07,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:06:07,866 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:06:07,870 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:06:07,870 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:06:07,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:06:07,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:06:07,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:06:07,871 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:06:07,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:06:07,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:06:07,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:06:07,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:06:07,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:06:07,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:06:07,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:06:07,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:06:07,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:06:07,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:06:07,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:06:07,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:06:07,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:06:07,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:06:07,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:06:07,877 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2024-11-19 07:06:08,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:06:08,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:06:08,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:06:08,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:06:08,148 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:06:08,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2024-11-19 07:06:09,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:06:09,798 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:06:09,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2024-11-19 07:06:09,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dff018e9/7e20ebc9a5e444d4baf8192db6fa460b/FLAG5b5b30b52 [2024-11-19 07:06:10,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dff018e9/7e20ebc9a5e444d4baf8192db6fa460b [2024-11-19 07:06:10,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:06:10,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:06:10,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:06:10,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:06:10,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:06:10,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660d6c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10, skipping insertion in model container [2024-11-19 07:06:10,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:06:10,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:06:10,436 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:06:10,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:06:10,484 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:06:10,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10 WrapperNode [2024-11-19 07:06:10,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:06:10,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:06:10,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:06:10,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:06:10,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,529 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2024-11-19 07:06:10,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:06:10,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:06:10,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:06:10,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:06:10,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,561 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-19 07:06:10,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:06:10,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:06:10,573 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:06:10,573 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:06:10,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (1/1) ... [2024-11-19 07:06:10,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:06:10,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:06:10,624 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-19 07:06:10,627 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-19 07:06:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 07:06:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:06:10,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:06:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 07:06:10,726 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:06:10,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:06:10,904 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-19 07:06:10,904 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:06:10,917 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:06:10,918 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 07:06:10,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:06:10 BoogieIcfgContainer [2024-11-19 07:06:10,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:06:10,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:06:10,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:06:10,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:06:10,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:06:10" (1/3) ... [2024-11-19 07:06:10,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172062cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:06:10, skipping insertion in model container [2024-11-19 07:06:10,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:10" (2/3) ... [2024-11-19 07:06:10,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172062cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:06:10, skipping insertion in model container [2024-11-19 07:06:10,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:06:10" (3/3) ... [2024-11-19 07:06:10,927 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2024-11-19 07:06:10,942 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:06:10,942 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 07:06:10,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:06:10,994 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;@18ca282d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:06:10,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 07:06:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 07:06:11,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:11,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 07:06:11,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:11,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 28701838, now seen corresponding path program 1 times [2024-11-19 07:06:11,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:11,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095605884] [2024-11-19 07:06:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:11,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:11,185 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-19 07:06:11,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:11,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095605884] [2024-11-19 07:06:11,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095605884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:11,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:11,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:06:11,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275440983] [2024-11-19 07:06:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:11,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 07:06:11,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 07:06:11,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 07:06:11,236 INFO L87 Difference]: Start difference. First operand has 34 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-19 07:06:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:11,251 INFO L93 Difference]: Finished difference Result 33 states and 53 transitions. [2024-11-19 07:06:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 07:06:11,253 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-19 07:06:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:11,260 INFO L225 Difference]: With dead ends: 33 [2024-11-19 07:06:11,260 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 07:06:11,262 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-19 07:06:11,265 INFO L432 NwaCegarLoop]: 53 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, 53 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-19 07:06:11,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 07:06:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 07:06:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2024-11-19 07:06:11,308 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 5 [2024-11-19 07:06:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:11,309 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2024-11-19 07:06:11,309 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-19 07:06:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2024-11-19 07:06:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 07:06:11,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:11,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 07:06:11,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:06:11,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:11,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:11,312 INFO L85 PathProgramCache]: Analyzing trace with hash 889696334, now seen corresponding path program 1 times [2024-11-19 07:06:11,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:11,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364289819] [2024-11-19 07:06:11,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:11,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:11,378 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-19 07:06:11,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:11,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364289819] [2024-11-19 07:06:11,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364289819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:11,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:11,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:06:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873707674] [2024-11-19 07:06:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:11,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:11,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:11,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:11,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:11,382 INFO L87 Difference]: Start difference. First operand 31 states and 51 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-19 07:06:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:11,389 INFO L93 Difference]: Finished difference Result 30 states and 50 transitions. [2024-11-19 07:06:11,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:11,390 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-19 07:06:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:11,391 INFO L225 Difference]: With dead ends: 30 [2024-11-19 07:06:11,391 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 07:06:11,392 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-19 07:06:11,393 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 50 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-19 07:06:11,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:11,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 07:06:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 07:06:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2024-11-19 07:06:11,398 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 6 [2024-11-19 07:06:11,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:11,398 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 48 transitions. [2024-11-19 07:06:11,398 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-19 07:06:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2024-11-19 07:06:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 07:06:11,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:11,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:11,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:06:11,400 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:11,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:11,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1577493021, now seen corresponding path program 1 times [2024-11-19 07:06:11,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:11,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650549359] [2024-11-19 07:06:11,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:11,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:11,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-19 07:06:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:11,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650549359] [2024-11-19 07:06:11,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650549359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:11,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:11,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:11,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515041982] [2024-11-19 07:06:11,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:11,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:11,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:11,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:11,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:11,532 INFO L87 Difference]: Start difference. First operand 28 states and 48 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:11,585 INFO L93 Difference]: Finished difference Result 53 states and 91 transitions. [2024-11-19 07:06:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:11,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-19 07:06:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:11,589 INFO L225 Difference]: With dead ends: 53 [2024-11-19 07:06:11,589 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 07:06:11,589 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-19 07:06:11,590 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:11,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 94 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:11,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 07:06:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2024-11-19 07:06:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 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-19 07:06:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 63 transitions. [2024-11-19 07:06:11,599 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 63 transitions. Word has length 15 [2024-11-19 07:06:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:11,600 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 63 transitions. [2024-11-19 07:06:11,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 63 transitions. [2024-11-19 07:06:11,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 07:06:11,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:11,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:11,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:06:11,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:11,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:11,602 INFO L85 PathProgramCache]: Analyzing trace with hash -876428443, now seen corresponding path program 1 times [2024-11-19 07:06:11,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:11,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121341690] [2024-11-19 07:06:11,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:11,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121341690] [2024-11-19 07:06:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121341690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:11,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:11,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:11,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291441920] [2024-11-19 07:06:11,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:11,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:11,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:11,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:11,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:11,694 INFO L87 Difference]: Start difference. First operand 36 states and 63 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:11,717 INFO L93 Difference]: Finished difference Result 53 states and 89 transitions. [2024-11-19 07:06:11,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:11,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-19 07:06:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:11,719 INFO L225 Difference]: With dead ends: 53 [2024-11-19 07:06:11,719 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 07:06:11,719 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-19 07:06:11,721 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 34 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 103 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-19 07:06:11,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 07:06:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-11-19 07:06:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 87 transitions. [2024-11-19 07:06:11,728 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 87 transitions. Word has length 15 [2024-11-19 07:06:11,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:11,728 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 87 transitions. [2024-11-19 07:06:11,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 87 transitions. [2024-11-19 07:06:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 07:06:11,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:11,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:11,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 07:06:11,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:11,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:11,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1651003735, now seen corresponding path program 1 times [2024-11-19 07:06:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:11,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677075621] [2024-11-19 07:06:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:11,784 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-19 07:06:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677075621] [2024-11-19 07:06:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677075621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:11,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:11,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:11,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107070411] [2024-11-19 07:06:11,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:11,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:11,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:11,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:11,787 INFO L87 Difference]: Start difference. First operand 50 states and 87 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:11,812 INFO L93 Difference]: Finished difference Result 56 states and 91 transitions. [2024-11-19 07:06:11,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:11,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 07:06:11,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:11,813 INFO L225 Difference]: With dead ends: 56 [2024-11-19 07:06:11,813 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 07:06:11,813 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-19 07:06:11,814 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 36 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:11,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 07:06:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2024-11-19 07:06:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 89 transitions. [2024-11-19 07:06:11,826 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 89 transitions. Word has length 16 [2024-11-19 07:06:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:11,826 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 89 transitions. [2024-11-19 07:06:11,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 89 transitions. [2024-11-19 07:06:11,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 07:06:11,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:11,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:11,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 07:06:11,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:11,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:11,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1392838297, now seen corresponding path program 1 times [2024-11-19 07:06:11,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:11,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959317430] [2024-11-19 07:06:11,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:11,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:11,896 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-19 07:06:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959317430] [2024-11-19 07:06:11,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959317430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:11,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:11,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943943902] [2024-11-19 07:06:11,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:11,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:11,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:11,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:11,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:11,898 INFO L87 Difference]: Start difference. First operand 53 states and 89 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:11,920 INFO L93 Difference]: Finished difference Result 97 states and 164 transitions. [2024-11-19 07:06:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:11,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 07:06:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:11,921 INFO L225 Difference]: With dead ends: 97 [2024-11-19 07:06:11,925 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 07:06:11,925 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-19 07:06:11,926 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 31 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 92 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-19 07:06:11,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 92 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 07:06:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 70. [2024-11-19 07:06:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2024-11-19 07:06:11,941 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 118 transitions. Word has length 16 [2024-11-19 07:06:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:11,941 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 118 transitions. [2024-11-19 07:06:11,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2024-11-19 07:06:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 07:06:11,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:11,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:11,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 07:06:11,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:11,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash -691773719, now seen corresponding path program 1 times [2024-11-19 07:06:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:11,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706490182] [2024-11-19 07:06:11,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:11,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:11,996 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-19 07:06:11,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:11,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706490182] [2024-11-19 07:06:11,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706490182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:11,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:11,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231795630] [2024-11-19 07:06:11,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:11,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:11,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:11,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:11,999 INFO L87 Difference]: Start difference. First operand 70 states and 118 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,021 INFO L93 Difference]: Finished difference Result 99 states and 162 transitions. [2024-11-19 07:06:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 07:06:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,023 INFO L225 Difference]: With dead ends: 99 [2024-11-19 07:06:12,026 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 07:06:12,026 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-19 07:06:12,027 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 33 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 104 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-19 07:06:12,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 104 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 07:06:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-19 07:06:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 160 transitions. [2024-11-19 07:06:12,042 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 160 transitions. Word has length 16 [2024-11-19 07:06:12,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,042 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 160 transitions. [2024-11-19 07:06:12,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 160 transitions. [2024-11-19 07:06:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 07:06:12,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:12,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 07:06:12,043 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash -221664016, now seen corresponding path program 1 times [2024-11-19 07:06:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525582914] [2024-11-19 07:06:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,101 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-19 07:06:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525582914] [2024-11-19 07:06:12,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525582914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593945806] [2024-11-19 07:06:12,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,104 INFO L87 Difference]: Start difference. First operand 96 states and 160 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-19 07:06:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,121 INFO L93 Difference]: Finished difference Result 101 states and 162 transitions. [2024-11-19 07:06:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,122 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-19 07:06:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,123 INFO L225 Difference]: With dead ends: 101 [2024-11-19 07:06:12,124 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 07:06:12,125 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-19 07:06:12,125 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 35 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:12,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 07:06:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-19 07:06:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 160 transitions. [2024-11-19 07:06:12,139 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 160 transitions. Word has length 17 [2024-11-19 07:06:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,139 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 160 transitions. [2024-11-19 07:06:12,139 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-19 07:06:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 160 transitions. [2024-11-19 07:06:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 07:06:12,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:12,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 07:06:12,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,141 INFO L85 PathProgramCache]: Analyzing trace with hash 36501422, now seen corresponding path program 1 times [2024-11-19 07:06:12,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664816669] [2024-11-19 07:06:12,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,172 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-19 07:06:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664816669] [2024-11-19 07:06:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664816669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626635982] [2024-11-19 07:06:12,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,178 INFO L87 Difference]: Start difference. First operand 98 states and 160 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-19 07:06:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,200 INFO L93 Difference]: Finished difference Result 185 states and 294 transitions. [2024-11-19 07:06:12,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,201 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-19 07:06:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,202 INFO L225 Difference]: With dead ends: 185 [2024-11-19 07:06:12,202 INFO L226 Difference]: Without dead ends: 185 [2024-11-19 07:06:12,202 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-19 07:06:12,203 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 33 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 94 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-19 07:06:12,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 94 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-19 07:06:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2024-11-19 07:06:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.6132596685082874) internal successors, (292), 181 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 292 transitions. [2024-11-19 07:06:12,218 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 292 transitions. Word has length 17 [2024-11-19 07:06:12,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,218 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 292 transitions. [2024-11-19 07:06:12,219 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-19 07:06:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 292 transitions. [2024-11-19 07:06:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 07:06:12,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:12,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 07:06:12,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,221 INFO L85 PathProgramCache]: Analyzing trace with hash -664563156, now seen corresponding path program 1 times [2024-11-19 07:06:12,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640658599] [2024-11-19 07:06:12,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,264 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-19 07:06:12,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640658599] [2024-11-19 07:06:12,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640658599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092935848] [2024-11-19 07:06:12,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,269 INFO L87 Difference]: Start difference. First operand 182 states and 292 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-19 07:06:12,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,283 INFO L93 Difference]: Finished difference Result 225 states and 362 transitions. [2024-11-19 07:06:12,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,284 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-19 07:06:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,285 INFO L225 Difference]: With dead ends: 225 [2024-11-19 07:06:12,285 INFO L226 Difference]: Without dead ends: 225 [2024-11-19 07:06:12,286 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-19 07:06:12,286 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 119 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-19 07:06:12,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-19 07:06:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 182. [2024-11-19 07:06:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 288 transitions. [2024-11-19 07:06:12,302 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 288 transitions. Word has length 17 [2024-11-19 07:06:12,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,302 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 288 transitions. [2024-11-19 07:06:12,302 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-19 07:06:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 288 transitions. [2024-11-19 07:06:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 07:06:12,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,304 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-19 07:06:12,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 07:06:12,304 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1138204884, now seen corresponding path program 1 times [2024-11-19 07:06:12,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155342074] [2024-11-19 07:06:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,335 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-19 07:06:12,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155342074] [2024-11-19 07:06:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155342074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4214512] [2024-11-19 07:06:12,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,338 INFO L87 Difference]: Start difference. First operand 182 states and 288 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-19 07:06:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,355 INFO L93 Difference]: Finished difference Result 325 states and 514 transitions. [2024-11-19 07:06:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,355 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-19 07:06:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,357 INFO L225 Difference]: With dead ends: 325 [2024-11-19 07:06:12,358 INFO L226 Difference]: Without dead ends: 325 [2024-11-19 07:06:12,359 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-19 07:06:12,359 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 88 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-19 07:06:12,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 88 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-19 07:06:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 258. [2024-11-19 07:06:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.556420233463035) internal successors, (400), 257 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 400 transitions. [2024-11-19 07:06:12,375 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 400 transitions. Word has length 18 [2024-11-19 07:06:12,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,375 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 400 transitions. [2024-11-19 07:06:12,375 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-19 07:06:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 400 transitions. [2024-11-19 07:06:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 07:06:12,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,377 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-19 07:06:12,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 07:06:12,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1839269462, now seen corresponding path program 1 times [2024-11-19 07:06:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085892803] [2024-11-19 07:06:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,416 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-19 07:06:12,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085892803] [2024-11-19 07:06:12,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085892803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501411839] [2024-11-19 07:06:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,418 INFO L87 Difference]: Start difference. First operand 258 states and 400 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-19 07:06:12,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,435 INFO L93 Difference]: Finished difference Result 349 states and 526 transitions. [2024-11-19 07:06:12,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,435 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-19 07:06:12,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,437 INFO L225 Difference]: With dead ends: 349 [2024-11-19 07:06:12,437 INFO L226 Difference]: Without dead ends: 349 [2024-11-19 07:06:12,437 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-19 07:06:12,438 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:12,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-19 07:06:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2024-11-19 07:06:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.518840579710145) internal successors, (524), 345 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 524 transitions. [2024-11-19 07:06:12,453 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 524 transitions. Word has length 18 [2024-11-19 07:06:12,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,453 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 524 transitions. [2024-11-19 07:06:12,454 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-19 07:06:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 524 transitions. [2024-11-19 07:06:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 07:06:12,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,455 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-19 07:06:12,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 07:06:12,456 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,457 INFO L85 PathProgramCache]: Analyzing trace with hash 931284409, now seen corresponding path program 1 times [2024-11-19 07:06:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28263879] [2024-11-19 07:06:12,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,492 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-19 07:06:12,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28263879] [2024-11-19 07:06:12,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28263879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833692154] [2024-11-19 07:06:12,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,494 INFO L87 Difference]: Start difference. First operand 346 states and 524 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-19 07:06:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,507 INFO L93 Difference]: Finished difference Result 361 states and 534 transitions. [2024-11-19 07:06:12,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,507 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-19 07:06:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,509 INFO L225 Difference]: With dead ends: 361 [2024-11-19 07:06:12,509 INFO L226 Difference]: Without dead ends: 361 [2024-11-19 07:06:12,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,510 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 33 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 103 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-19 07:06:12,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-19 07:06:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 358. [2024-11-19 07:06:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 532 transitions. [2024-11-19 07:06:12,519 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 532 transitions. Word has length 19 [2024-11-19 07:06:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,519 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 532 transitions. [2024-11-19 07:06:12,520 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-19 07:06:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 532 transitions. [2024-11-19 07:06:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 07:06:12,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,537 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-19 07:06:12,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 07:06:12,537 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1189449847, now seen corresponding path program 1 times [2024-11-19 07:06:12,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922780427] [2024-11-19 07:06:12,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,569 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-19 07:06:12,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922780427] [2024-11-19 07:06:12,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922780427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258712400] [2024-11-19 07:06:12,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,572 INFO L87 Difference]: Start difference. First operand 358 states and 532 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-19 07:06:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,585 INFO L93 Difference]: Finished difference Result 617 states and 910 transitions. [2024-11-19 07:06:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,586 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-19 07:06:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,588 INFO L225 Difference]: With dead ends: 617 [2024-11-19 07:06:12,588 INFO L226 Difference]: Without dead ends: 617 [2024-11-19 07:06:12,588 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-19 07:06:12,589 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 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-19 07:06:12,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-19 07:06:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 518. [2024-11-19 07:06:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 748 transitions. [2024-11-19 07:06:12,602 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 748 transitions. Word has length 19 [2024-11-19 07:06:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,602 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 748 transitions. [2024-11-19 07:06:12,602 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-19 07:06:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 748 transitions. [2024-11-19 07:06:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 07:06:12,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,604 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-19 07:06:12,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 07:06:12,604 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1890514425, now seen corresponding path program 1 times [2024-11-19 07:06:12,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334429600] [2024-11-19 07:06:12,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,627 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-19 07:06:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334429600] [2024-11-19 07:06:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334429600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43219461] [2024-11-19 07:06:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,631 INFO L87 Difference]: Start difference. First operand 518 states and 748 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-19 07:06:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,648 INFO L93 Difference]: Finished difference Result 681 states and 950 transitions. [2024-11-19 07:06:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,648 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-19 07:06:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,651 INFO L225 Difference]: With dead ends: 681 [2024-11-19 07:06:12,652 INFO L226 Difference]: Without dead ends: 681 [2024-11-19 07:06:12,652 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-19 07:06:12,655 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 107 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-19 07:06:12,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 107 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-19 07:06:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 678. [2024-11-19 07:06:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 948 transitions. [2024-11-19 07:06:12,671 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 948 transitions. Word has length 19 [2024-11-19 07:06:12,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,672 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 948 transitions. [2024-11-19 07:06:12,672 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-19 07:06:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 948 transitions. [2024-11-19 07:06:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 07:06:12,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,673 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-19 07:06:12,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 07:06:12,674 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1775078463, now seen corresponding path program 1 times [2024-11-19 07:06:12,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547012198] [2024-11-19 07:06:12,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,702 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-19 07:06:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547012198] [2024-11-19 07:06:12,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547012198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788967700] [2024-11-19 07:06:12,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,706 INFO L87 Difference]: Start difference. First operand 678 states and 948 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-19 07:06:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,720 INFO L93 Difference]: Finished difference Result 697 states and 950 transitions. [2024-11-19 07:06:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,720 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-19 07:06:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,723 INFO L225 Difference]: With dead ends: 697 [2024-11-19 07:06:12,723 INFO L226 Difference]: Without dead ends: 697 [2024-11-19 07:06:12,723 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-19 07:06:12,724 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 99 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-19 07:06:12,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-19 07:06:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 694. [2024-11-19 07:06:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 948 transitions. [2024-11-19 07:06:12,739 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 948 transitions. Word has length 20 [2024-11-19 07:06:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,739 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 948 transitions. [2024-11-19 07:06:12,739 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-19 07:06:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 948 transitions. [2024-11-19 07:06:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 07:06:12,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,742 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-19 07:06:12,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 07:06:12,743 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1516913025, now seen corresponding path program 1 times [2024-11-19 07:06:12,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836021698] [2024-11-19 07:06:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,781 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-19 07:06:12,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836021698] [2024-11-19 07:06:12,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836021698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753658287] [2024-11-19 07:06:12,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,784 INFO L87 Difference]: Start difference. First operand 694 states and 948 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-19 07:06:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,801 INFO L93 Difference]: Finished difference Result 1161 states and 1558 transitions. [2024-11-19 07:06:12,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,802 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-19 07:06:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,806 INFO L225 Difference]: With dead ends: 1161 [2024-11-19 07:06:12,806 INFO L226 Difference]: Without dead ends: 1161 [2024-11-19 07:06:12,806 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-19 07:06:12,807 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 84 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-19 07:06:12,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 84 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-11-19 07:06:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1030. [2024-11-19 07:06:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1364 transitions. [2024-11-19 07:06:12,830 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1364 transitions. Word has length 20 [2024-11-19 07:06:12,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,830 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1364 transitions. [2024-11-19 07:06:12,831 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-19 07:06:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1364 transitions. [2024-11-19 07:06:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 07:06:12,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,833 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-19 07:06:12,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 07:06:12,833 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,834 INFO L85 PathProgramCache]: Analyzing trace with hash -815848447, now seen corresponding path program 1 times [2024-11-19 07:06:12,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365116991] [2024-11-19 07:06:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,861 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-19 07:06:12,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365116991] [2024-11-19 07:06:12,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365116991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95943512] [2024-11-19 07:06:12,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,865 INFO L87 Difference]: Start difference. First operand 1030 states and 1364 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-19 07:06:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,880 INFO L93 Difference]: Finished difference Result 1321 states and 1670 transitions. [2024-11-19 07:06:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,881 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-19 07:06:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,885 INFO L225 Difference]: With dead ends: 1321 [2024-11-19 07:06:12,885 INFO L226 Difference]: Without dead ends: 1321 [2024-11-19 07:06:12,886 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-19 07:06:12,886 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 108 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-19 07:06:12,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 108 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2024-11-19 07:06:12,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1318. [2024-11-19 07:06:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1668 transitions. [2024-11-19 07:06:12,910 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1668 transitions. Word has length 20 [2024-11-19 07:06:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,911 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1668 transitions. [2024-11-19 07:06:12,911 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-19 07:06:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1668 transitions. [2024-11-19 07:06:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 07:06:12,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,913 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-19 07:06:12,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 07:06:12,913 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,914 INFO L85 PathProgramCache]: Analyzing trace with hash 227028996, now seen corresponding path program 1 times [2024-11-19 07:06:12,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638492028] [2024-11-19 07:06:12,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,932 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-19 07:06:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638492028] [2024-11-19 07:06:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638492028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305334216] [2024-11-19 07:06:12,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,934 INFO L87 Difference]: Start difference. First operand 1318 states and 1668 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-19 07:06:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,948 INFO L93 Difference]: Finished difference Result 1353 states and 1670 transitions. [2024-11-19 07:06:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,949 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-19 07:06:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,952 INFO L225 Difference]: With dead ends: 1353 [2024-11-19 07:06:12,952 INFO L226 Difference]: Without dead ends: 1353 [2024-11-19 07:06:12,953 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-19 07:06:12,954 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 31 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 95 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-19 07:06:12,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-19 07:06:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1350. [2024-11-19 07:06:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1668 transitions. [2024-11-19 07:06:12,978 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1668 transitions. Word has length 21 [2024-11-19 07:06:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,979 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1668 transitions. [2024-11-19 07:06:12,979 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-19 07:06:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1668 transitions. [2024-11-19 07:06:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 07:06:12,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:12,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 07:06:12,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash 485194434, now seen corresponding path program 1 times [2024-11-19 07:06:12,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816702233] [2024-11-19 07:06:12,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:13,001 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-19 07:06:13,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:13,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816702233] [2024-11-19 07:06:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816702233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:13,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243382904] [2024-11-19 07:06:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:13,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:13,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:13,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:13,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:13,004 INFO L87 Difference]: Start difference. First operand 1350 states and 1668 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-19 07:06:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:13,024 INFO L93 Difference]: Finished difference Result 2182 states and 2596 transitions. [2024-11-19 07:06:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:13,025 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-19 07:06:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:13,032 INFO L225 Difference]: With dead ends: 2182 [2024-11-19 07:06:13,032 INFO L226 Difference]: Without dead ends: 2182 [2024-11-19 07:06:13,032 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-19 07:06:13,032 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 80 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-19 07:06:13,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 80 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2024-11-19 07:06:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2054. [2024-11-19 07:06:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2468 transitions. [2024-11-19 07:06:13,089 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2468 transitions. Word has length 21 [2024-11-19 07:06:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:13,089 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 2468 transitions. [2024-11-19 07:06:13,089 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-19 07:06:13,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2468 transitions. [2024-11-19 07:06:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 07:06:13,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:13,092 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-19 07:06:13,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 07:06:13,093 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:13,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1186259012, now seen corresponding path program 1 times [2024-11-19 07:06:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:13,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399621263] [2024-11-19 07:06:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:13,115 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-19 07:06:13,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:13,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399621263] [2024-11-19 07:06:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399621263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:13,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:13,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:13,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372306] [2024-11-19 07:06:13,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:13,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:13,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:13,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:13,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:13,118 INFO L87 Difference]: Start difference. First operand 2054 states and 2468 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-19 07:06:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:13,138 INFO L93 Difference]: Finished difference Result 2563 states and 2882 transitions. [2024-11-19 07:06:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:13,138 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-19 07:06:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:13,139 INFO L225 Difference]: With dead ends: 2563 [2024-11-19 07:06:13,139 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 07:06:13,139 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-19 07:06:13,140 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 26 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 105 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-19 07:06:13,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 07:06:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 07:06:13,142 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-19 07:06:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 07:06:13,143 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2024-11-19 07:06:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:13,143 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 07:06:13,143 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-19 07:06:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 07:06:13,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 07:06:13,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-19 07:06:13,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-19 07:06:13,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 07:06:13,150 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] [2024-11-19 07:06:13,154 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 07:06:13,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:06:13 BoogieIcfgContainer [2024-11-19 07:06:13,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 07:06:13,157 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 07:06:13,158 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 07:06:13,158 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 07:06:13,159 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:06:10" (3/4) ... [2024-11-19 07:06:13,161 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 07:06:13,170 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-19 07:06:13,171 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-19 07:06:13,172 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 07:06:13,172 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 07:06:13,261 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 07:06:13,261 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 07:06:13,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 07:06:13,262 INFO L158 Benchmark]: Toolchain (without parser) took 3074.57ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 102.7MB in the beginning and 167.5MB in the end (delta: -64.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 07:06:13,262 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 07:06:13,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.78ms. Allocated memory is still 159.4MB. Free memory was 102.7MB in the beginning and 90.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 07:06:13,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.31ms. Allocated memory is still 159.4MB. Free memory was 89.7MB in the beginning and 88.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 07:06:13,263 INFO L158 Benchmark]: Boogie Preprocessor took 39.17ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 86.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 07:06:13,263 INFO L158 Benchmark]: RCFGBuilder took 345.75ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 72.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 07:06:13,263 INFO L158 Benchmark]: TraceAbstraction took 2236.54ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 72.0MB in the beginning and 172.8MB in the end (delta: -100.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 07:06:13,264 INFO L158 Benchmark]: Witness Printer took 103.87ms. Allocated memory is still 222.3MB. Free memory was 172.8MB in the beginning and 167.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 07:06:13,265 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.78ms. Allocated memory is still 159.4MB. Free memory was 102.7MB in the beginning and 90.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.31ms. Allocated memory is still 159.4MB. Free memory was 89.7MB in the beginning and 88.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.17ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 86.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.75ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 72.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2236.54ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 72.0MB in the beginning and 172.8MB in the end (delta: -100.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 103.87ms. Allocated memory is still 222.3MB. Free memory was 172.8MB in the beginning and 167.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 601 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 601 mSDsluCounter, 1996 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 743 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1253 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2054occurred in iteration=20, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 545 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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-19 07:06:13,294 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