./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label26.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41fffd2e204f5953653ecd6a172157691ba74909e2a5ccd1b00c61b2b6a658af --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:05:11,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:05:11,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:05:11,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:05:11,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:05:11,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:05:11,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:05:11,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:05:11,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:05:11,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:05:11,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:05:11,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:05:11,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:05:11,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:05:11,916 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:05:11,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:05:11,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:05:11,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:05:11,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:05:11,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:05:11,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:05:11,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:05:11,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:05:11,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:05:11,920 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:05:11,920 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:05:11,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:05:11,921 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:05:11,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:05:11,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:05:11,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:05:11,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:05:11,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:05:11,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:05:11,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:05:11,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:05:11,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:05:11,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:05:11,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:05:11,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:05:11,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:05:11,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:05:11,925 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 ! call(reach_error())) ) 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 -> 41fffd2e204f5953653ecd6a172157691ba74909e2a5ccd1b00c61b2b6a658af [2024-11-16 03:05:12,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:05:12,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:05:12,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:05:12,172 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:05:12,173 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:05:12,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2024-11-16 03:05:13,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:05:13,786 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:05:13,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2024-11-16 03:05:13,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afd7d442c/9242892614ce4ec5aaeff04f53fdf254/FLAGdebc216e9 [2024-11-16 03:05:13,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afd7d442c/9242892614ce4ec5aaeff04f53fdf254 [2024-11-16 03:05:13,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:05:13,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:05:13,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:05:13,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:05:13,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:05:13,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:05:13" (1/1) ... [2024-11-16 03:05:13,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@651f8a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:13, skipping insertion in model container [2024-11-16 03:05:13,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:05:13" (1/1) ... [2024-11-16 03:05:13,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:05:14,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label26.c[18357,18370] [2024-11-16 03:05:14,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:05:14,129 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:05:14,187 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label26.c[18357,18370] [2024-11-16 03:05:14,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:05:14,237 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:05:14,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14 WrapperNode [2024-11-16 03:05:14,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:05:14,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:05:14,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:05:14,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:05:14,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (1/1) ... [2024-11-16 03:05:14,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (1/1) ... [2024-11-16 03:05:14,318 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-16 03:05:14,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:05:14,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:05:14,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:05:14,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:05:14,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (1/1) ... [2024-11-16 03:05:14,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (1/1) ... [2024-11-16 03:05:14,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (1/1) ... [2024-11-16 03:05:14,364 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-16 03:05:14,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (1/1) ... [2024-11-16 03:05:14,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (1/1) ... [2024-11-16 03:05:14,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (1/1) ... [2024-11-16 03:05:14,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (1/1) ... [2024-11-16 03:05:14,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (1/1) ... [2024-11-16 03:05:14,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (1/1) ... [2024-11-16 03:05:14,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:05:14,407 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:05:14,407 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:05:14,407 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:05:14,408 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (1/1) ... [2024-11-16 03:05:14,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:05:14,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:05:14,443 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-16 03:05:14,451 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-16 03:05:14,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:05:14,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:05:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:05:14,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:05:14,552 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:05:14,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:05:15,248 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-16 03:05:15,248 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:05:15,261 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:05:15,262 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:05:15,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:05:15 BoogieIcfgContainer [2024-11-16 03:05:15,262 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:05:15,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:05:15,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:05:15,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:05:15,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:05:13" (1/3) ... [2024-11-16 03:05:15,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d37d68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:05:15, skipping insertion in model container [2024-11-16 03:05:15,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:14" (2/3) ... [2024-11-16 03:05:15,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d37d68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:05:15, skipping insertion in model container [2024-11-16 03:05:15,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:05:15" (3/3) ... [2024-11-16 03:05:15,269 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label26.c [2024-11-16 03:05:15,282 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:05:15,282 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:05:15,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:05:15,333 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=LoopHeads, 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;@790f6f36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:05:15,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:05:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 03:05:15,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:15,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:15,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:15,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:15,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2089301974, now seen corresponding path program 1 times [2024-11-16 03:05:15,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:15,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655864593] [2024-11-16 03:05:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:15,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:16,154 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-16 03:05:16,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:16,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655864593] [2024-11-16 03:05:16,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655864593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:16,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:16,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:16,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078341295] [2024-11-16 03:05:16,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:16,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:05:16,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:16,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:05:16,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:16,191 INFO L87 Difference]: Start difference. First operand has 201 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 0 states have call successors, (0), 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 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:17,041 INFO L93 Difference]: Finished difference Result 669 states and 1185 transitions. [2024-11-16 03:05:17,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:05:17,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-16 03:05:17,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:17,054 INFO L225 Difference]: With dead ends: 669 [2024-11-16 03:05:17,055 INFO L226 Difference]: Without dead ends: 401 [2024-11-16 03:05:17,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:05:17,061 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 351 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:17,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 87 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:05:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-16 03:05:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2024-11-16 03:05:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.3025) internal successors, (521), 400 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 521 transitions. [2024-11-16 03:05:17,106 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 521 transitions. Word has length 105 [2024-11-16 03:05:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:17,106 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 521 transitions. [2024-11-16 03:05:17,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 521 transitions. [2024-11-16 03:05:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 03:05:17,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:17,109 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:17,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:05:17,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:17,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:17,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1820225535, now seen corresponding path program 1 times [2024-11-16 03:05:17,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:17,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456714860] [2024-11-16 03:05:17,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:05:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:17,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456714860] [2024-11-16 03:05:17,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456714860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:17,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:17,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:17,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722742874] [2024-11-16 03:05:17,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:17,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:05:17,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:17,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:05:17,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:17,419 INFO L87 Difference]: Start difference. First operand 401 states and 521 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:17,949 INFO L93 Difference]: Finished difference Result 896 states and 1244 transitions. [2024-11-16 03:05:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:05:17,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-16 03:05:17,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:17,953 INFO L225 Difference]: With dead ends: 896 [2024-11-16 03:05:17,953 INFO L226 Difference]: Without dead ends: 533 [2024-11-16 03:05:17,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:17,955 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 128 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:17,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 87 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:05:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-16 03:05:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 401. [2024-11-16 03:05:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.195) internal successors, (478), 400 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 478 transitions. [2024-11-16 03:05:17,969 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 478 transitions. Word has length 113 [2024-11-16 03:05:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:17,970 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 478 transitions. [2024-11-16 03:05:17,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 478 transitions. [2024-11-16 03:05:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 03:05:17,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:17,972 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:17,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:05:17,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:17,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:17,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1763427136, now seen corresponding path program 1 times [2024-11-16 03:05:17,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:17,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952636930] [2024-11-16 03:05:17,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:17,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:05:18,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:18,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952636930] [2024-11-16 03:05:18,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952636930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:18,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:18,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:18,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577243969] [2024-11-16 03:05:18,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:18,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:05:18,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:18,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:05:18,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:18,090 INFO L87 Difference]: Start difference. First operand 401 states and 478 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:18,538 INFO L93 Difference]: Finished difference Result 1064 states and 1293 transitions. [2024-11-16 03:05:18,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:05:18,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-16 03:05:18,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:18,540 INFO L225 Difference]: With dead ends: 1064 [2024-11-16 03:05:18,540 INFO L226 Difference]: Without dead ends: 665 [2024-11-16 03:05:18,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:18,542 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 255 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:18,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 45 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:05:18,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-16 03:05:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2024-11-16 03:05:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.1897590361445782) internal successors, (790), 664 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 790 transitions. [2024-11-16 03:05:18,562 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 790 transitions. Word has length 122 [2024-11-16 03:05:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:18,562 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 790 transitions. [2024-11-16 03:05:18,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 790 transitions. [2024-11-16 03:05:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 03:05:18,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:18,564 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:18,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:05:18,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:18,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:18,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1066017199, now seen corresponding path program 1 times [2024-11-16 03:05:18,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:18,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207034980] [2024-11-16 03:05:18,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:18,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-16 03:05:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:18,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207034980] [2024-11-16 03:05:18,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207034980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:18,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:18,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:18,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205064947] [2024-11-16 03:05:18,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:18,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:18,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:18,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:18,654 INFO L87 Difference]: Start difference. First operand 665 states and 790 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:18,964 INFO L93 Difference]: Finished difference Result 1856 states and 2196 transitions. [2024-11-16 03:05:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:18,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 149 [2024-11-16 03:05:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:18,968 INFO L225 Difference]: With dead ends: 1856 [2024-11-16 03:05:18,968 INFO L226 Difference]: Without dead ends: 1193 [2024-11-16 03:05:18,969 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-16 03:05:18,970 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 133 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:18,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 31 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-16 03:05:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1061. [2024-11-16 03:05:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.1971698113207547) internal successors, (1269), 1060 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1269 transitions. [2024-11-16 03:05:18,987 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1269 transitions. Word has length 149 [2024-11-16 03:05:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:18,987 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1269 transitions. [2024-11-16 03:05:18,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1269 transitions. [2024-11-16 03:05:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-16 03:05:18,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:18,989 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:18,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:05:18,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:18,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:18,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2000059488, now seen corresponding path program 1 times [2024-11-16 03:05:18,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:18,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161618599] [2024-11-16 03:05:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-16 03:05:19,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:19,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161618599] [2024-11-16 03:05:19,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161618599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:19,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:19,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:19,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306021191] [2024-11-16 03:05:19,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:19,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:05:19,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:19,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:05:19,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:19,143 INFO L87 Difference]: Start difference. First operand 1061 states and 1269 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:19,603 INFO L93 Difference]: Finished difference Result 2516 states and 2981 transitions. [2024-11-16 03:05:19,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:05:19,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 155 [2024-11-16 03:05:19,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:19,608 INFO L225 Difference]: With dead ends: 2516 [2024-11-16 03:05:19,608 INFO L226 Difference]: Without dead ends: 1457 [2024-11-16 03:05:19,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:19,610 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 251 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:19,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 56 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:05:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2024-11-16 03:05:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1325. [2024-11-16 03:05:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.1744712990936557) internal successors, (1555), 1324 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1555 transitions. [2024-11-16 03:05:19,630 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1555 transitions. Word has length 155 [2024-11-16 03:05:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:19,631 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1555 transitions. [2024-11-16 03:05:19,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1555 transitions. [2024-11-16 03:05:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 03:05:19,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:19,634 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:19,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:05:19,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:19,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1233669762, now seen corresponding path program 1 times [2024-11-16 03:05:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:19,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229938749] [2024-11-16 03:05:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 03:05:19,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:19,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229938749] [2024-11-16 03:05:19,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229938749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:19,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:19,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:19,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914119972] [2024-11-16 03:05:19,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:19,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:05:19,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:19,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:05:19,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:19,837 INFO L87 Difference]: Start difference. First operand 1325 states and 1555 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:20,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:20,326 INFO L93 Difference]: Finished difference Result 3176 states and 3772 transitions. [2024-11-16 03:05:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:05:20,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 172 [2024-11-16 03:05:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:20,331 INFO L225 Difference]: With dead ends: 3176 [2024-11-16 03:05:20,331 INFO L226 Difference]: Without dead ends: 1853 [2024-11-16 03:05:20,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:20,333 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 222 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:20,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 54 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:05:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2024-11-16 03:05:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1589. [2024-11-16 03:05:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.1586901763224182) internal successors, (1840), 1588 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1840 transitions. [2024-11-16 03:05:20,358 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1840 transitions. Word has length 172 [2024-11-16 03:05:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:20,359 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 1840 transitions. [2024-11-16 03:05:20,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1840 transitions. [2024-11-16 03:05:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-16 03:05:20,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:20,362 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:20,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:05:20,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:20,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1638689749, now seen corresponding path program 1 times [2024-11-16 03:05:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:20,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806953832] [2024-11-16 03:05:20,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:20,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 03:05:20,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:20,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806953832] [2024-11-16 03:05:20,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806953832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:05:20,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080111103] [2024-11-16 03:05:20,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:20,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:05:20,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:05:20,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:05:20,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 03:05:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:20,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:05:20,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:05:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-16 03:05:21,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:05:21,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080111103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:21,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:05:21,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-16 03:05:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16473435] [2024-11-16 03:05:21,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:21,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:21,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:21,020 INFO L87 Difference]: Start difference. First operand 1589 states and 1840 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:21,304 INFO L93 Difference]: Finished difference Result 3836 states and 4455 transitions. [2024-11-16 03:05:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:21,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 186 [2024-11-16 03:05:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:21,310 INFO L225 Difference]: With dead ends: 3836 [2024-11-16 03:05:21,310 INFO L226 Difference]: Without dead ends: 2249 [2024-11-16 03:05:21,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:21,312 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:21,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 22 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2024-11-16 03:05:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 1985. [2024-11-16 03:05:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1984 states have (on average 1.159274193548387) internal successors, (2300), 1984 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2300 transitions. [2024-11-16 03:05:21,369 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2300 transitions. Word has length 186 [2024-11-16 03:05:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:21,369 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2300 transitions. [2024-11-16 03:05:21,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2300 transitions. [2024-11-16 03:05:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 03:05:21,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:21,372 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:21,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 03:05:21,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:05:21,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:21,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1002922494, now seen corresponding path program 1 times [2024-11-16 03:05:21,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:21,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294258079] [2024-11-16 03:05:21,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:21,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 105 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 03:05:21,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:21,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294258079] [2024-11-16 03:05:21,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294258079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:05:21,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045562589] [2024-11-16 03:05:21,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:21,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:05:21,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:05:21,893 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:05:21,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 03:05:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:22,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:05:22,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:05:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-16 03:05:22,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:05:22,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045562589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:22,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:05:22,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-16 03:05:22,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004750184] [2024-11-16 03:05:22,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:22,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:22,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:22,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:22,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:22,118 INFO L87 Difference]: Start difference. First operand 1985 states and 2300 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:22,419 INFO L93 Difference]: Finished difference Result 3968 states and 4598 transitions. [2024-11-16 03:05:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:22,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 191 [2024-11-16 03:05:22,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:22,424 INFO L225 Difference]: With dead ends: 3968 [2024-11-16 03:05:22,424 INFO L226 Difference]: Without dead ends: 1985 [2024-11-16 03:05:22,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:22,427 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 43 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:22,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 169 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2024-11-16 03:05:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1985. [2024-11-16 03:05:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1984 states have (on average 1.126008064516129) internal successors, (2234), 1984 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2234 transitions. [2024-11-16 03:05:22,459 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2234 transitions. Word has length 191 [2024-11-16 03:05:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:22,459 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2234 transitions. [2024-11-16 03:05:22,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2234 transitions. [2024-11-16 03:05:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-16 03:05:22,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:22,462 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:22,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 03:05:22,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-16 03:05:22,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:22,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash 988826956, now seen corresponding path program 1 times [2024-11-16 03:05:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30388775] [2024-11-16 03:05:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:22,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 109 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 03:05:23,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:23,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30388775] [2024-11-16 03:05:23,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30388775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:05:23,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056035440] [2024-11-16 03:05:23,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:23,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:05:23,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:05:23,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:05:23,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 03:05:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:23,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:05:23,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:05:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-16 03:05:23,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:05:23,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056035440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:23,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:05:23,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-16 03:05:23,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743725814] [2024-11-16 03:05:23,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:23,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:23,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:23,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:23,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:23,400 INFO L87 Difference]: Start difference. First operand 1985 states and 2234 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:23,743 INFO L93 Difference]: Finished difference Result 4364 states and 4946 transitions. [2024-11-16 03:05:23,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:23,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 195 [2024-11-16 03:05:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:23,749 INFO L225 Difference]: With dead ends: 4364 [2024-11-16 03:05:23,749 INFO L226 Difference]: Without dead ends: 2381 [2024-11-16 03:05:23,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:23,751 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 36 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:23,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 184 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2024-11-16 03:05:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2249. [2024-11-16 03:05:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2249 states, 2248 states have (on average 1.1258896797153024) internal successors, (2531), 2248 states have internal predecessors, (2531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 2531 transitions. [2024-11-16 03:05:23,782 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 2531 transitions. Word has length 195 [2024-11-16 03:05:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:23,782 INFO L471 AbstractCegarLoop]: Abstraction has 2249 states and 2531 transitions. [2024-11-16 03:05:23,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 2531 transitions. [2024-11-16 03:05:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-16 03:05:23,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:23,786 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:23,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 03:05:23,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:05:23,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:23,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:23,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2141220315, now seen corresponding path program 1 times [2024-11-16 03:05:23,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:23,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842735107] [2024-11-16 03:05:23,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:23,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 142 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 03:05:24,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842735107] [2024-11-16 03:05:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842735107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:05:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273654698] [2024-11-16 03:05:24,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:24,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:05:24,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:05:24,124 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:05:24,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 03:05:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:24,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:05:24,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:05:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-16 03:05:24,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:05:24,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273654698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:24,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:05:24,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-16 03:05:24,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708231720] [2024-11-16 03:05:24,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:24,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:24,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:24,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:24,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:05:24,277 INFO L87 Difference]: Start difference. First operand 2249 states and 2531 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:24,562 INFO L93 Difference]: Finished difference Result 4760 states and 5379 transitions. [2024-11-16 03:05:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:24,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 214 [2024-11-16 03:05:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:24,568 INFO L225 Difference]: With dead ends: 4760 [2024-11-16 03:05:24,569 INFO L226 Difference]: Without dead ends: 2513 [2024-11-16 03:05:24,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:05:24,571 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 114 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:24,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 167 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2024-11-16 03:05:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2381. [2024-11-16 03:05:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 2380 states have (on average 1.1142857142857143) internal successors, (2652), 2380 states have internal predecessors, (2652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2652 transitions. [2024-11-16 03:05:24,607 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2652 transitions. Word has length 214 [2024-11-16 03:05:24,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:24,607 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 2652 transitions. [2024-11-16 03:05:24,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:24,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2652 transitions. [2024-11-16 03:05:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-16 03:05:24,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:24,611 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:24,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 03:05:24,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:05:24,812 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:24,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1999641497, now seen corresponding path program 1 times [2024-11-16 03:05:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:24,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978946899] [2024-11-16 03:05:24,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-16 03:05:24,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:24,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978946899] [2024-11-16 03:05:24,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978946899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:24,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:24,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:24,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390496623] [2024-11-16 03:05:24,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:24,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:24,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:24,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:24,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:24,921 INFO L87 Difference]: Start difference. First operand 2381 states and 2652 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:25,199 INFO L93 Difference]: Finished difference Result 5552 states and 6182 transitions. [2024-11-16 03:05:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:25,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 227 [2024-11-16 03:05:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:25,207 INFO L225 Difference]: With dead ends: 5552 [2024-11-16 03:05:25,208 INFO L226 Difference]: Without dead ends: 3173 [2024-11-16 03:05:25,210 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-16 03:05:25,211 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 142 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:25,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 33 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2024-11-16 03:05:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 2381. [2024-11-16 03:05:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 2380 states have (on average 1.1142857142857143) internal successors, (2652), 2380 states have internal predecessors, (2652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2652 transitions. [2024-11-16 03:05:25,245 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2652 transitions. Word has length 227 [2024-11-16 03:05:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:25,245 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 2652 transitions. [2024-11-16 03:05:25,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2652 transitions. [2024-11-16 03:05:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-16 03:05:25,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:25,249 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:25,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 03:05:25,249 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:25,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:25,250 INFO L85 PathProgramCache]: Analyzing trace with hash -615582225, now seen corresponding path program 1 times [2024-11-16 03:05:25,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:25,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735844758] [2024-11-16 03:05:25,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:25,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-16 03:05:25,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:25,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735844758] [2024-11-16 03:05:25,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735844758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:25,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:25,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:25,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41466936] [2024-11-16 03:05:25,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:25,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:25,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:25,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:25,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:25,348 INFO L87 Difference]: Start difference. First operand 2381 states and 2652 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:25,654 INFO L93 Difference]: Finished difference Result 4757 states and 5252 transitions. [2024-11-16 03:05:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:25,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 229 [2024-11-16 03:05:25,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:25,655 INFO L225 Difference]: With dead ends: 4757 [2024-11-16 03:05:25,655 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 03:05:25,659 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-16 03:05:25,659 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 140 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:25,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 30 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 03:05:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 03:05:25,660 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-16 03:05:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 03:05:25,661 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 229 [2024-11-16 03:05:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:25,661 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 03:05:25,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 03:05:25,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 03:05:25,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:05:25,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 03:05:25,667 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:25,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 03:05:26,220 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:05:26,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:05:26 BoogieIcfgContainer [2024-11-16 03:05:26,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:05:26,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:05:26,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:05:26,238 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:05:26,238 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:05:15" (3/4) ... [2024-11-16 03:05:26,240 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 03:05:26,256 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-16 03:05:26,259 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 03:05:26,260 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 03:05:26,261 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 03:05:26,402 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:05:26,402 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 03:05:26,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:05:26,403 INFO L158 Benchmark]: Toolchain (without parser) took 12585.68ms. Allocated memory was 192.9MB in the beginning and 522.2MB in the end (delta: 329.3MB). Free memory was 118.7MB in the beginning and 314.5MB in the end (delta: -195.9MB). Peak memory consumption was 135.2MB. Max. memory is 16.1GB. [2024-11-16 03:05:26,403 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 192.9MB. Free memory is still 149.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:05:26,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.73ms. Allocated memory is still 192.9MB. Free memory was 118.4MB in the beginning and 159.5MB in the end (delta: -41.1MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2024-11-16 03:05:26,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.36ms. Allocated memory is still 192.9MB. Free memory was 159.5MB in the beginning and 153.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 03:05:26,403 INFO L158 Benchmark]: Boogie Preprocessor took 87.32ms. Allocated memory is still 192.9MB. Free memory was 153.7MB in the beginning and 149.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 03:05:26,404 INFO L158 Benchmark]: IcfgBuilder took 855.52ms. Allocated memory is still 192.9MB. Free memory was 149.5MB in the beginning and 64.6MB in the end (delta: 84.9MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2024-11-16 03:05:26,404 INFO L158 Benchmark]: TraceAbstraction took 10973.34ms. Allocated memory was 192.9MB in the beginning and 522.2MB in the end (delta: 329.3MB). Free memory was 64.6MB in the beginning and 327.1MB in the end (delta: -262.5MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2024-11-16 03:05:26,404 INFO L158 Benchmark]: Witness Printer took 164.66ms. Allocated memory is still 522.2MB. Free memory was 327.1MB in the beginning and 314.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 03:05:26,405 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 192.9MB. Free memory is still 149.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.73ms. Allocated memory is still 192.9MB. Free memory was 118.4MB in the beginning and 159.5MB in the end (delta: -41.1MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.36ms. Allocated memory is still 192.9MB. Free memory was 159.5MB in the beginning and 153.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.32ms. Allocated memory is still 192.9MB. Free memory was 153.7MB in the beginning and 149.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 855.52ms. Allocated memory is still 192.9MB. Free memory was 149.5MB in the beginning and 64.6MB in the end (delta: 84.9MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10973.34ms. Allocated memory was 192.9MB in the beginning and 522.2MB in the end (delta: 329.3MB). Free memory was 64.6MB in the beginning and 327.1MB in the end (delta: -262.5MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * Witness Printer took 164.66ms. Allocated memory is still 522.2MB. Free memory was 327.1MB in the beginning and 314.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 495]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 201 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 12, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1856 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1856 mSDsluCounter, 965 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 803 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5207 IncrementalHoareTripleChecker+Invalid, 6010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 803 mSolverCounterUnsat, 833 mSDtfsCounter, 5207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 827 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2381occurred in iteration=10, InterpolantAutomatonStates: 42, 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, 12 MinimizatonAttempts, 1980 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2844 NumberOfCodeBlocks, 2844 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2828 ConstructedInterpolants, 0 QuantifiedInterpolants, 11006 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1521 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 2036/2141 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 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 03:05:26,442 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