./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_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-wip.dd.update-z3-fca748b-m [2024-11-20 15:02:16,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 15:02:16,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 15:02:17,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 15:02:17,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 15:02:17,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 15:02:17,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 15:02:17,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 15:02:17,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 15:02:17,038 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 15:02:17,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 15:02:17,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 15:02:17,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 15:02:17,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 15:02:17,041 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 15:02:17,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 15:02:17,042 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 15:02:17,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 15:02:17,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 15:02:17,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 15:02:17,043 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 15:02:17,043 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 15:02:17,044 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 15:02:17,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 15:02:17,044 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 15:02:17,044 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 15:02:17,044 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 15:02:17,045 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 15:02:17,045 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 15:02:17,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 15:02:17,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 15:02:17,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 15:02:17,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 15:02:17,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 15:02:17,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 15:02:17,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 15:02:17,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 15:02:17,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 15:02:17,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 15:02:17,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 15:02:17,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 15:02:17,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 15:02:17,049 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-20 15:02:17,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 15:02:17,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 15:02:17,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 15:02:17,341 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 15:02:17,341 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 15:02:17,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2024-11-20 15:02:18,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 15:02:18,997 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 15:02:18,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2024-11-20 15:02:19,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e9f17b7/b307ad6219094109b91ffd3f78473c39/FLAG1b87ceb04 [2024-11-20 15:02:19,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e9f17b7/b307ad6219094109b91ffd3f78473c39 [2024-11-20 15:02:19,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 15:02:19,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 15:02:19,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 15:02:19,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 15:02:19,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 15:02:19,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f81ee40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19, skipping insertion in model container [2024-11-20 15:02:19,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 15:02:19,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 15:02:19,285 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 15:02:19,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 15:02:19,320 INFO L204 MainTranslator]: Completed translation [2024-11-20 15:02:19,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19 WrapperNode [2024-11-20 15:02:19,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 15:02:19,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 15:02:19,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 15:02:19,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 15:02:19,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,357 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2024-11-20 15:02:19,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 15:02:19,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 15:02:19,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 15:02:19,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 15:02:19,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,381 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 15:02:19,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 15:02:19,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 15:02:19,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 15:02:19,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 15:02:19,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (1/1) ... [2024-11-20 15:02:19,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 15:02:19,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:02:19,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 15:02:19,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 15:02:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 15:02:19,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 15:02:19,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 15:02:19,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 15:02:19,548 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 15:02:19,549 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 15:02:19,771 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 15:02:19,772 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 15:02:19,789 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 15:02:19,789 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 15:02:19,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:02:19 BoogieIcfgContainer [2024-11-20 15:02:19,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 15:02:19,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 15:02:19,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 15:02:19,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 15:02:19,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:02:19" (1/3) ... [2024-11-20 15:02:19,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345cc60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:02:19, skipping insertion in model container [2024-11-20 15:02:19,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:02:19" (2/3) ... [2024-11-20 15:02:19,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345cc60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:02:19, skipping insertion in model container [2024-11-20 15:02:19,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:02:19" (3/3) ... [2024-11-20 15:02:19,799 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2024-11-20 15:02:19,814 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 15:02:19,814 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 15:02:19,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 15:02:19,866 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;@9f46c7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 15:02:19,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 15:02:19,870 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-20 15:02:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 15:02:19,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:19,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 15:02:19,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:19,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:19,882 INFO L85 PathProgramCache]: Analyzing trace with hash 28701838, now seen corresponding path program 1 times [2024-11-20 15:02:19,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:19,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684403035] [2024-11-20 15:02:19,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:19,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:20,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:20,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684403035] [2024-11-20 15:02:20,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684403035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:20,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:20,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 15:02:20,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431253265] [2024-11-20 15:02:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:20,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 15:02:20,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:20,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 15:02:20,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 15:02:20,064 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-20 15:02:20,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:20,077 INFO L93 Difference]: Finished difference Result 33 states and 53 transitions. [2024-11-20 15:02:20,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 15:02:20,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 15:02:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:20,089 INFO L225 Difference]: With dead ends: 33 [2024-11-20 15:02:20,089 INFO L226 Difference]: Without dead ends: 31 [2024-11-20 15:02:20,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 15:02:20,094 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-20 15:02:20,097 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-20 15:02:20,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-20 15:02:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-20 15:02:20,137 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-20 15:02:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2024-11-20 15:02:20,140 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 5 [2024-11-20 15:02:20,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:20,141 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2024-11-20 15:02:20,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2024-11-20 15:02:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 15:02:20,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:20,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 15:02:20,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 15:02:20,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:20,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash 889696334, now seen corresponding path program 1 times [2024-11-20 15:02:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:20,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884955188] [2024-11-20 15:02:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:20,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:20,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884955188] [2024-11-20 15:02:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884955188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:20,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:20,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 15:02:20,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619307442] [2024-11-20 15:02:20,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:20,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:20,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:20,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:20,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,228 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-20 15:02:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:20,242 INFO L93 Difference]: Finished difference Result 30 states and 50 transitions. [2024-11-20 15:02:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:20,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 15:02:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:20,245 INFO L225 Difference]: With dead ends: 30 [2024-11-20 15:02:20,246 INFO L226 Difference]: Without dead ends: 28 [2024-11-20 15:02:20,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,247 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-20 15:02:20,248 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-20 15:02:20,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-20 15:02:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-20 15:02:20,256 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-20 15:02:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2024-11-20 15:02:20,258 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 6 [2024-11-20 15:02:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:20,259 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 48 transitions. [2024-11-20 15:02:20,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2024-11-20 15:02:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-20 15:02:20,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:20,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:20,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 15:02:20,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:20,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:20,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1577493021, now seen corresponding path program 1 times [2024-11-20 15:02:20,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:20,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345450156] [2024-11-20 15:02:20,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:20,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:20,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:20,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345450156] [2024-11-20 15:02:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345450156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:20,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:20,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:20,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748321815] [2024-11-20 15:02:20,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:20,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:20,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,341 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-20 15:02:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:20,370 INFO L93 Difference]: Finished difference Result 53 states and 91 transitions. [2024-11-20 15:02:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:20,370 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-20 15:02:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:20,372 INFO L225 Difference]: With dead ends: 53 [2024-11-20 15:02:20,373 INFO L226 Difference]: Without dead ends: 53 [2024-11-20 15:02:20,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,375 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-20 15:02:20,376 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-20 15:02:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-20 15:02:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2024-11-20 15:02:20,383 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-20 15:02:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 63 transitions. [2024-11-20 15:02:20,385 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 63 transitions. Word has length 15 [2024-11-20 15:02:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:20,385 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 63 transitions. [2024-11-20 15:02:20,385 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-20 15:02:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 63 transitions. [2024-11-20 15:02:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-20 15:02:20,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:20,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:20,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 15:02:20,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:20,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:20,388 INFO L85 PathProgramCache]: Analyzing trace with hash -876428443, now seen corresponding path program 1 times [2024-11-20 15:02:20,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619699009] [2024-11-20 15:02:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:20,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:20,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619699009] [2024-11-20 15:02:20,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619699009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:20,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:20,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754252785] [2024-11-20 15:02:20,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:20,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:20,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:20,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,492 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-20 15:02:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:20,526 INFO L93 Difference]: Finished difference Result 53 states and 89 transitions. [2024-11-20 15:02:20,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:20,527 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-20 15:02:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:20,528 INFO L225 Difference]: With dead ends: 53 [2024-11-20 15:02:20,528 INFO L226 Difference]: Without dead ends: 53 [2024-11-20 15:02:20,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,529 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-20 15:02:20,530 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-20 15:02:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-20 15:02:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-11-20 15:02:20,536 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-20 15:02:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 87 transitions. [2024-11-20 15:02:20,538 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 87 transitions. Word has length 15 [2024-11-20 15:02:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:20,538 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 87 transitions. [2024-11-20 15:02:20,538 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-20 15:02:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 87 transitions. [2024-11-20 15:02:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 15:02:20,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:20,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:20,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 15:02:20,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:20,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:20,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1651003735, now seen corresponding path program 1 times [2024-11-20 15:02:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:20,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647046543] [2024-11-20 15:02:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:20,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:20,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647046543] [2024-11-20 15:02:20,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647046543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:20,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:20,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:20,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428246307] [2024-11-20 15:02:20,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:20,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:20,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:20,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:20,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,606 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-20 15:02:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:20,632 INFO L93 Difference]: Finished difference Result 56 states and 91 transitions. [2024-11-20 15:02:20,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:20,632 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-20 15:02:20,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:20,634 INFO L225 Difference]: With dead ends: 56 [2024-11-20 15:02:20,635 INFO L226 Difference]: Without dead ends: 56 [2024-11-20 15:02:20,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,637 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-20 15:02:20,637 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-20 15:02:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-20 15:02:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2024-11-20 15:02:20,643 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-20 15:02:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 89 transitions. [2024-11-20 15:02:20,645 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 89 transitions. Word has length 16 [2024-11-20 15:02:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:20,645 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 89 transitions. [2024-11-20 15:02:20,645 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-20 15:02:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 89 transitions. [2024-11-20 15:02:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 15:02:20,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:20,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:20,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 15:02:20,647 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:20,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:20,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1392838297, now seen corresponding path program 1 times [2024-11-20 15:02:20,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:20,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709053697] [2024-11-20 15:02:20,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:20,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:20,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:20,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709053697] [2024-11-20 15:02:20,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709053697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:20,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:20,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:20,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934177606] [2024-11-20 15:02:20,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:20,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:20,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:20,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:20,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,722 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-20 15:02:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:20,735 INFO L93 Difference]: Finished difference Result 97 states and 164 transitions. [2024-11-20 15:02:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:20,736 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-20 15:02:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:20,740 INFO L225 Difference]: With dead ends: 97 [2024-11-20 15:02:20,741 INFO L226 Difference]: Without dead ends: 97 [2024-11-20 15:02:20,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,742 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-20 15:02:20,743 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-20 15:02:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-20 15:02:20,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 70. [2024-11-20 15:02:20,756 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-20 15:02:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2024-11-20 15:02:20,757 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 118 transitions. Word has length 16 [2024-11-20 15:02:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:20,757 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 118 transitions. [2024-11-20 15:02:20,758 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-20 15:02:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2024-11-20 15:02:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 15:02:20,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:20,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:20,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 15:02:20,759 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:20,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:20,762 INFO L85 PathProgramCache]: Analyzing trace with hash -691773719, now seen corresponding path program 1 times [2024-11-20 15:02:20,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:20,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321652711] [2024-11-20 15:02:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:20,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:20,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:20,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321652711] [2024-11-20 15:02:20,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321652711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:20,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:20,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:20,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405070365] [2024-11-20 15:02:20,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:20,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:20,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:20,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:20,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,814 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-20 15:02:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:20,841 INFO L93 Difference]: Finished difference Result 99 states and 162 transitions. [2024-11-20 15:02:20,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:20,841 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-20 15:02:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:20,843 INFO L225 Difference]: With dead ends: 99 [2024-11-20 15:02:20,844 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 15:02:20,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,846 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-20 15:02:20,847 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-20 15:02:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 15:02:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-20 15:02:20,859 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-20 15:02:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 160 transitions. [2024-11-20 15:02:20,860 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 160 transitions. Word has length 16 [2024-11-20 15:02:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:20,860 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 160 transitions. [2024-11-20 15:02:20,861 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-20 15:02:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 160 transitions. [2024-11-20 15:02:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 15:02:20,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:20,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:20,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 15:02:20,866 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:20,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash -221664016, now seen corresponding path program 1 times [2024-11-20 15:02:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870631498] [2024-11-20 15:02:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:20,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:20,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:20,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870631498] [2024-11-20 15:02:20,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870631498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:20,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:20,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:20,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214495598] [2024-11-20 15:02:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:20,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:20,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:20,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,920 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-20 15:02:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:20,936 INFO L93 Difference]: Finished difference Result 101 states and 162 transitions. [2024-11-20 15:02:20,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:20,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-20 15:02:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:20,938 INFO L225 Difference]: With dead ends: 101 [2024-11-20 15:02:20,938 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 15:02:20,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:20,939 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-20 15:02:20,939 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-20 15:02:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 15:02:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-20 15:02:20,949 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-20 15:02:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 160 transitions. [2024-11-20 15:02:20,954 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 160 transitions. Word has length 17 [2024-11-20 15:02:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:20,954 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 160 transitions. [2024-11-20 15:02:20,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 160 transitions. [2024-11-20 15:02:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 15:02:20,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:20,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:20,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 15:02:20,956 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:20,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash 36501422, now seen corresponding path program 1 times [2024-11-20 15:02:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:20,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653955528] [2024-11-20 15:02:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:20,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653955528] [2024-11-20 15:02:21,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653955528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867272269] [2024-11-20 15:02:21,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,021 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-20 15:02:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,040 INFO L93 Difference]: Finished difference Result 185 states and 294 transitions. [2024-11-20 15:02:21,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-20 15:02:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,042 INFO L225 Difference]: With dead ends: 185 [2024-11-20 15:02:21,042 INFO L226 Difference]: Without dead ends: 185 [2024-11-20 15:02:21,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,043 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-20 15:02:21,043 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-20 15:02:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-20 15:02:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2024-11-20 15:02:21,052 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-20 15:02:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 292 transitions. [2024-11-20 15:02:21,054 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 292 transitions. Word has length 17 [2024-11-20 15:02:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,054 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 292 transitions. [2024-11-20 15:02:21,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 292 transitions. [2024-11-20 15:02:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 15:02:21,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:21,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:21,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 15:02:21,056 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:21,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash -664563156, now seen corresponding path program 1 times [2024-11-20 15:02:21,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:21,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129609771] [2024-11-20 15:02:21,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129609771] [2024-11-20 15:02:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129609771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081672630] [2024-11-20 15:02:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,108 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-20 15:02:21,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,117 INFO L93 Difference]: Finished difference Result 225 states and 362 transitions. [2024-11-20 15:02:21,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-20 15:02:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,119 INFO L225 Difference]: With dead ends: 225 [2024-11-20 15:02:21,119 INFO L226 Difference]: Without dead ends: 225 [2024-11-20 15:02:21,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,120 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-20 15:02:21,121 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-20 15:02:21,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-20 15:02:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 182. [2024-11-20 15:02:21,128 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-20 15:02:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 288 transitions. [2024-11-20 15:02:21,129 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 288 transitions. Word has length 17 [2024-11-20 15:02:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,131 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 288 transitions. [2024-11-20 15:02:21,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 288 transitions. [2024-11-20 15:02:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 15:02:21,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:21,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:21,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 15:02:21,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:21,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1138204884, now seen corresponding path program 1 times [2024-11-20 15:02:21,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:21,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112889522] [2024-11-20 15:02:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112889522] [2024-11-20 15:02:21,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112889522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573098370] [2024-11-20 15:02:21,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,181 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-20 15:02:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,194 INFO L93 Difference]: Finished difference Result 325 states and 514 transitions. [2024-11-20 15:02:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 15:02:21,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,196 INFO L225 Difference]: With dead ends: 325 [2024-11-20 15:02:21,198 INFO L226 Difference]: Without dead ends: 325 [2024-11-20 15:02:21,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,199 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-20 15:02:21,199 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-20 15:02:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-20 15:02:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 258. [2024-11-20 15:02:21,213 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-20 15:02:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 400 transitions. [2024-11-20 15:02:21,215 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 400 transitions. Word has length 18 [2024-11-20 15:02:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,218 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 400 transitions. [2024-11-20 15:02:21,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 400 transitions. [2024-11-20 15:02:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 15:02:21,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:21,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:21,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 15:02:21,221 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:21,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:21,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1839269462, now seen corresponding path program 1 times [2024-11-20 15:02:21,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:21,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155305064] [2024-11-20 15:02:21,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:21,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155305064] [2024-11-20 15:02:21,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155305064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985729810] [2024-11-20 15:02:21,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,265 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-20 15:02:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,279 INFO L93 Difference]: Finished difference Result 349 states and 526 transitions. [2024-11-20 15:02:21,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 15:02:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,282 INFO L225 Difference]: With dead ends: 349 [2024-11-20 15:02:21,282 INFO L226 Difference]: Without dead ends: 349 [2024-11-20 15:02:21,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,283 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-20 15:02:21,286 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-20 15:02:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-20 15:02:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2024-11-20 15:02:21,295 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-20 15:02:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 524 transitions. [2024-11-20 15:02:21,296 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 524 transitions. Word has length 18 [2024-11-20 15:02:21,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,297 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 524 transitions. [2024-11-20 15:02:21,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 524 transitions. [2024-11-20 15:02:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 15:02:21,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:21,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:21,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 15:02:21,299 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:21,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:21,301 INFO L85 PathProgramCache]: Analyzing trace with hash 931284409, now seen corresponding path program 1 times [2024-11-20 15:02:21,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:21,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756381466] [2024-11-20 15:02:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:21,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756381466] [2024-11-20 15:02:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756381466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810270595] [2024-11-20 15:02:21,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,331 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-20 15:02:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,343 INFO L93 Difference]: Finished difference Result 361 states and 534 transitions. [2024-11-20 15:02:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-20 15:02:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,345 INFO L225 Difference]: With dead ends: 361 [2024-11-20 15:02:21,345 INFO L226 Difference]: Without dead ends: 361 [2024-11-20 15:02:21,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,347 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-20 15:02:21,347 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-20 15:02:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-20 15:02:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 358. [2024-11-20 15:02:21,354 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-20 15:02:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 532 transitions. [2024-11-20 15:02:21,355 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 532 transitions. Word has length 19 [2024-11-20 15:02:21,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,355 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 532 transitions. [2024-11-20 15:02:21,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 532 transitions. [2024-11-20 15:02:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 15:02:21,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:21,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:21,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 15:02:21,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:21,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1189449847, now seen corresponding path program 1 times [2024-11-20 15:02:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:21,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149802179] [2024-11-20 15:02:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:21,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149802179] [2024-11-20 15:02:21,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149802179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040937179] [2024-11-20 15:02:21,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,392 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-20 15:02:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,411 INFO L93 Difference]: Finished difference Result 617 states and 910 transitions. [2024-11-20 15:02:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-20 15:02:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,414 INFO L225 Difference]: With dead ends: 617 [2024-11-20 15:02:21,414 INFO L226 Difference]: Without dead ends: 617 [2024-11-20 15:02:21,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,415 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-20 15:02:21,416 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-20 15:02:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-20 15:02:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 518. [2024-11-20 15:02:21,427 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-20 15:02:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 748 transitions. [2024-11-20 15:02:21,428 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 748 transitions. Word has length 19 [2024-11-20 15:02:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,429 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 748 transitions. [2024-11-20 15:02:21,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 748 transitions. [2024-11-20 15:02:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 15:02:21,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:21,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:21,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 15:02:21,432 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:21,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1890514425, now seen corresponding path program 1 times [2024-11-20 15:02:21,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:21,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961833438] [2024-11-20 15:02:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:21,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961833438] [2024-11-20 15:02:21,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961833438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644208375] [2024-11-20 15:02:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,462 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-20 15:02:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,479 INFO L93 Difference]: Finished difference Result 681 states and 950 transitions. [2024-11-20 15:02:21,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-20 15:02:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,482 INFO L225 Difference]: With dead ends: 681 [2024-11-20 15:02:21,482 INFO L226 Difference]: Without dead ends: 681 [2024-11-20 15:02:21,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,485 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-20 15:02:21,485 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-20 15:02:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-20 15:02:21,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 678. [2024-11-20 15:02:21,496 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-20 15:02:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 948 transitions. [2024-11-20 15:02:21,498 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 948 transitions. Word has length 19 [2024-11-20 15:02:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,500 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 948 transitions. [2024-11-20 15:02:21,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 948 transitions. [2024-11-20 15:02:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 15:02:21,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:21,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:21,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 15:02:21,501 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:21,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:21,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1775078463, now seen corresponding path program 1 times [2024-11-20 15:02:21,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:21,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086764078] [2024-11-20 15:02:21,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:21,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086764078] [2024-11-20 15:02:21,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086764078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872168149] [2024-11-20 15:02:21,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,537 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-20 15:02:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,550 INFO L93 Difference]: Finished difference Result 697 states and 950 transitions. [2024-11-20 15:02:21,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-20 15:02:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,553 INFO L225 Difference]: With dead ends: 697 [2024-11-20 15:02:21,554 INFO L226 Difference]: Without dead ends: 697 [2024-11-20 15:02:21,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,554 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-20 15:02:21,555 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-20 15:02:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-20 15:02:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 694. [2024-11-20 15:02:21,566 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-20 15:02:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 948 transitions. [2024-11-20 15:02:21,569 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 948 transitions. Word has length 20 [2024-11-20 15:02:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,569 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 948 transitions. [2024-11-20 15:02:21,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 948 transitions. [2024-11-20 15:02:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 15:02:21,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:21,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:21,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 15:02:21,583 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:21,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1516913025, now seen corresponding path program 1 times [2024-11-20 15:02:21,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:21,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646680304] [2024-11-20 15:02:21,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:21,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646680304] [2024-11-20 15:02:21,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646680304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318532694] [2024-11-20 15:02:21,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,620 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-20 15:02:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,633 INFO L93 Difference]: Finished difference Result 1161 states and 1558 transitions. [2024-11-20 15:02:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-20 15:02:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,638 INFO L225 Difference]: With dead ends: 1161 [2024-11-20 15:02:21,638 INFO L226 Difference]: Without dead ends: 1161 [2024-11-20 15:02:21,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,639 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-20 15:02:21,639 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-20 15:02:21,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-11-20 15:02:21,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1030. [2024-11-20 15:02:21,655 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-20 15:02:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1364 transitions. [2024-11-20 15:02:21,659 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1364 transitions. Word has length 20 [2024-11-20 15:02:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,659 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1364 transitions. [2024-11-20 15:02:21,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1364 transitions. [2024-11-20 15:02:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 15:02:21,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:21,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:21,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 15:02:21,661 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:21,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash -815848447, now seen corresponding path program 1 times [2024-11-20 15:02:21,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:21,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316074739] [2024-11-20 15:02:21,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316074739] [2024-11-20 15:02:21,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316074739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385254783] [2024-11-20 15:02:21,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,688 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-20 15:02:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,703 INFO L93 Difference]: Finished difference Result 1321 states and 1670 transitions. [2024-11-20 15:02:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-20 15:02:21,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,708 INFO L225 Difference]: With dead ends: 1321 [2024-11-20 15:02:21,708 INFO L226 Difference]: Without dead ends: 1321 [2024-11-20 15:02:21,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,709 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-20 15:02:21,709 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-20 15:02:21,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2024-11-20 15:02:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1318. [2024-11-20 15:02:21,729 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-20 15:02:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1668 transitions. [2024-11-20 15:02:21,732 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1668 transitions. Word has length 20 [2024-11-20 15:02:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,733 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1668 transitions. [2024-11-20 15:02:21,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1668 transitions. [2024-11-20 15:02:21,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 15:02:21,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:21,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:21,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 15:02:21,735 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:21,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:21,736 INFO L85 PathProgramCache]: Analyzing trace with hash 227028996, now seen corresponding path program 1 times [2024-11-20 15:02:21,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:21,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134085711] [2024-11-20 15:02:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:21,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134085711] [2024-11-20 15:02:21,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134085711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564506440] [2024-11-20 15:02:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,768 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-20 15:02:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,782 INFO L93 Difference]: Finished difference Result 1353 states and 1670 transitions. [2024-11-20 15:02:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-20 15:02:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,786 INFO L225 Difference]: With dead ends: 1353 [2024-11-20 15:02:21,787 INFO L226 Difference]: Without dead ends: 1353 [2024-11-20 15:02:21,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,788 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-20 15:02:21,789 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-20 15:02:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-20 15:02:21,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1350. [2024-11-20 15:02:21,806 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-20 15:02:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1668 transitions. [2024-11-20 15:02:21,810 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1668 transitions. Word has length 21 [2024-11-20 15:02:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,811 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1668 transitions. [2024-11-20 15:02:21,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1668 transitions. [2024-11-20 15:02:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 15:02:21,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:21,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:21,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 15:02:21,813 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:21,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:21,814 INFO L85 PathProgramCache]: Analyzing trace with hash 485194434, now seen corresponding path program 1 times [2024-11-20 15:02:21,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:21,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348923399] [2024-11-20 15:02:21,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:21,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348923399] [2024-11-20 15:02:21,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348923399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062752571] [2024-11-20 15:02:21,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,835 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-20 15:02:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,853 INFO L93 Difference]: Finished difference Result 2182 states and 2596 transitions. [2024-11-20 15:02:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-20 15:02:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,860 INFO L225 Difference]: With dead ends: 2182 [2024-11-20 15:02:21,860 INFO L226 Difference]: Without dead ends: 2182 [2024-11-20 15:02:21,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,862 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-20 15:02:21,862 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-20 15:02:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2024-11-20 15:02:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2054. [2024-11-20 15:02:21,900 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-20 15:02:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2468 transitions. [2024-11-20 15:02:21,937 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2468 transitions. Word has length 21 [2024-11-20 15:02:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,938 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 2468 transitions. [2024-11-20 15:02:21,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2468 transitions. [2024-11-20 15:02:21,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 15:02:21,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:02:21,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:02:21,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 15:02:21,943 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:02:21,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:02:21,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1186259012, now seen corresponding path program 1 times [2024-11-20 15:02:21,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:02:21,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552338859] [2024-11-20 15:02:21,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:02:21,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:02:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:02:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:02:21,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:02:21,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552338859] [2024-11-20 15:02:21,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552338859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:02:21,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:02:21,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:02:21,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594636341] [2024-11-20 15:02:21,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:02:21,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:02:21,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:02:21,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:02:21,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,970 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-20 15:02:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:02:21,987 INFO L93 Difference]: Finished difference Result 2563 states and 2882 transitions. [2024-11-20 15:02:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:02:21,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-20 15:02:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:02:21,988 INFO L225 Difference]: With dead ends: 2563 [2024-11-20 15:02:21,988 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 15:02:21,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:02:21,989 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-20 15:02:21,989 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-20 15:02:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 15:02:21,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 15:02:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 15:02:21,990 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2024-11-20 15:02:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:02:21,990 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 15:02:21,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:02:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 15:02:21,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 15:02:21,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-20 15:02:21,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-20 15:02:21,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 15:02:21,998 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-20 15:02:22,001 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 15:02:22,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:02:22 BoogieIcfgContainer [2024-11-20 15:02:22,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 15:02:22,005 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 15:02:22,005 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 15:02:22,005 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 15:02:22,006 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:02:19" (3/4) ... [2024-11-20 15:02:22,008 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 15:02:22,018 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-20 15:02:22,019 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-20 15:02:22,019 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 15:02:22,019 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 15:02:22,111 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 15:02:22,112 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 15:02:22,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 15:02:22,113 INFO L158 Benchmark]: Toolchain (without parser) took 3071.76ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 83.9MB in the beginning and 146.9MB in the end (delta: -62.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 15:02:22,113 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 15:02:22,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.71ms. Allocated memory is still 153.1MB. Free memory was 83.9MB in the beginning and 71.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 15:02:22,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.89ms. Allocated memory is still 153.1MB. Free memory was 71.1MB in the beginning and 69.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 15:02:22,114 INFO L158 Benchmark]: Boogie Preprocessor took 35.68ms. Allocated memory is still 153.1MB. Free memory was 69.5MB in the beginning and 67.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 15:02:22,114 INFO L158 Benchmark]: RCFGBuilder took 395.23ms. Allocated memory is still 153.1MB. Free memory was 67.7MB in the beginning and 121.2MB in the end (delta: -53.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 15:02:22,115 INFO L158 Benchmark]: TraceAbstraction took 2212.28ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 120.5MB in the beginning and 152.1MB in the end (delta: -31.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-11-20 15:02:22,115 INFO L158 Benchmark]: Witness Printer took 107.29ms. Allocated memory is still 199.2MB. Free memory was 151.1MB in the beginning and 146.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 15:02:22,116 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.15ms. Allocated memory is still 117.4MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.71ms. Allocated memory is still 153.1MB. Free memory was 83.9MB in the beginning and 71.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.89ms. Allocated memory is still 153.1MB. Free memory was 71.1MB in the beginning and 69.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.68ms. Allocated memory is still 153.1MB. Free memory was 69.5MB in the beginning and 67.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 395.23ms. Allocated memory is still 153.1MB. Free memory was 67.7MB in the beginning and 121.2MB in the end (delta: -53.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2212.28ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 120.5MB in the beginning and 152.1MB in the end (delta: -31.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Witness Printer took 107.29ms. Allocated memory is still 199.2MB. Free memory was 151.1MB in the beginning and 146.9MB in the end (delta: 4.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.2s 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.2s 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-20 15:02:22,139 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