./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/Problem14_label25.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 af25e83b6858fff60f7d1f210bf28c8f4df9d888273dfb197f604bfc8ae9e1a1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:04:23,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:04:23,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:04:23,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:04:23,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:04:23,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:04:23,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:04:23,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:04:23,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:04:23,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:04:23,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:04:23,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:04:23,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:04:23,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:04:23,930 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:04:23,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:04:23,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:04:23,930 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:04:23,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:04:23,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:04:23,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:04:23,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:04:23,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:04:23,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:04:23,933 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:04:23,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:04:23,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:04:23,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:04:23,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:04:23,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:04:23,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:04:23,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:04:23,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:04:23,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:04:23,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:04:23,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:04:23,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:04:23,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:04:23,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:04:23,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:04:23,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:04:23,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:04:23,937 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 -> af25e83b6858fff60f7d1f210bf28c8f4df9d888273dfb197f604bfc8ae9e1a1 [2024-11-11 17:04:24,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:04:24,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:04:24,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:04:24,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:04:24,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:04:24,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label25.c [2024-11-11 17:04:25,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:04:25,538 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:04:25,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label25.c [2024-11-11 17:04:25,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a736418e2/e9a673d524d847b4b02c24824693577d/FLAG0541ba41f [2024-11-11 17:04:25,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a736418e2/e9a673d524d847b4b02c24824693577d [2024-11-11 17:04:25,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:04:25,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:04:25,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:04:25,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:04:25,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:04:25,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:04:25" (1/1) ... [2024-11-11 17:04:25,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d15d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:25, skipping insertion in model container [2024-11-11 17:04:25,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:04:25" (1/1) ... [2024-11-11 17:04:25,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:04:26,167 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/Problem14_label25.c[6534,6547] [2024-11-11 17:04:26,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:04:26,319 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:04:26,342 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/Problem14_label25.c[6534,6547] [2024-11-11 17:04:26,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:04:26,419 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:04:26,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26 WrapperNode [2024-11-11 17:04:26,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:04:26,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:04:26,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:04:26,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:04:26,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (1/1) ... [2024-11-11 17:04:26,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (1/1) ... [2024-11-11 17:04:26,492 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-11-11 17:04:26,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:04:26,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:04:26,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:04:26,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:04:26,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (1/1) ... [2024-11-11 17:04:26,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (1/1) ... [2024-11-11 17:04:26,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (1/1) ... [2024-11-11 17:04:26,557 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-11 17:04:26,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (1/1) ... [2024-11-11 17:04:26,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (1/1) ... [2024-11-11 17:04:26,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (1/1) ... [2024-11-11 17:04:26,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (1/1) ... [2024-11-11 17:04:26,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (1/1) ... [2024-11-11 17:04:26,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (1/1) ... [2024-11-11 17:04:26,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:04:26,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:04:26,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:04:26,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:04:26,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (1/1) ... [2024-11-11 17:04:26,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:04:26,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:26,632 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-11 17:04:26,634 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-11 17:04:26,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:04:26,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:04:26,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:04:26,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:04:26,718 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:04:26,719 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:04:27,604 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-11 17:04:27,605 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:04:27,620 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:04:27,620 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:04:27,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:04:27 BoogieIcfgContainer [2024-11-11 17:04:27,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:04:27,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:04:27,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:04:27,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:04:27,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:04:25" (1/3) ... [2024-11-11 17:04:27,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8ee854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:04:27, skipping insertion in model container [2024-11-11 17:04:27,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:26" (2/3) ... [2024-11-11 17:04:27,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8ee854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:04:27, skipping insertion in model container [2024-11-11 17:04:27,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:04:27" (3/3) ... [2024-11-11 17:04:27,626 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label25.c [2024-11-11 17:04:27,639 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:04:27,640 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:04:27,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:04:27,706 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;@3e6f638c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:04:27,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:04:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:27,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 17:04:27,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:27,720 INFO L218 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] [2024-11-11 17:04:27,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:27,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:27,726 INFO L85 PathProgramCache]: Analyzing trace with hash -107486446, now seen corresponding path program 1 times [2024-11-11 17:04:27,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:27,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540387162] [2024-11-11 17:04:27,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:27,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:28,170 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-11 17:04:28,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:28,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540387162] [2024-11-11 17:04:28,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540387162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:28,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:28,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:28,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516645987] [2024-11-11 17:04:28,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:28,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:04:28,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:28,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:04:28,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:28,194 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 0 states have call successors, (0), 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 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:29,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:29,379 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2024-11-11 17:04:29,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:04:29,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-11-11 17:04:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:29,394 INFO L225 Difference]: With dead ends: 852 [2024-11-11 17:04:29,394 INFO L226 Difference]: Without dead ends: 538 [2024-11-11 17:04:29,397 INFO L434 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-11 17:04:29,403 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 547 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:29,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 44 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:04:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-11 17:04:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2024-11-11 17:04:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.4487895716945995) internal successors, (778), 537 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2024-11-11 17:04:29,454 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 64 [2024-11-11 17:04:29,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:29,455 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2024-11-11 17:04:29,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2024-11-11 17:04:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-11 17:04:29,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:29,461 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:29,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:04:29,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:29,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:29,463 INFO L85 PathProgramCache]: Analyzing trace with hash 228116006, now seen corresponding path program 1 times [2024-11-11 17:04:29,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:29,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033544517] [2024-11-11 17:04:29,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:29,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-11 17:04:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:29,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033544517] [2024-11-11 17:04:29,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033544517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:29,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:29,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:04:29,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988201621] [2024-11-11 17:04:29,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:29,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:29,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:29,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:29,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:29,659 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:30,199 INFO L93 Difference]: Finished difference Result 1074 states and 1656 transitions. [2024-11-11 17:04:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:30,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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 200 [2024-11-11 17:04:30,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:30,203 INFO L225 Difference]: With dead ends: 1074 [2024-11-11 17:04:30,203 INFO L226 Difference]: Without dead ends: 716 [2024-11-11 17:04:30,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:30,205 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:30,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:04:30,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-11 17:04:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2024-11-11 17:04:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.353846153846154) internal successors, (968), 715 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2024-11-11 17:04:30,234 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 200 [2024-11-11 17:04:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:30,234 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2024-11-11 17:04:30,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2024-11-11 17:04:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-11 17:04:30,238 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:30,239 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:30,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:04:30,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:30,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1127504167, now seen corresponding path program 1 times [2024-11-11 17:04:30,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:30,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797634382] [2024-11-11 17:04:30,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:30,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 17:04:30,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:30,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797634382] [2024-11-11 17:04:30,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797634382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:30,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:30,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:30,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147096073] [2024-11-11 17:04:30,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:30,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:04:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:30,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:04:30,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:30,503 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:31,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:31,078 INFO L93 Difference]: Finished difference Result 1459 states and 2023 transitions. [2024-11-11 17:04:31,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:04:31,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 223 [2024-11-11 17:04:31,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:31,081 INFO L225 Difference]: With dead ends: 1459 [2024-11-11 17:04:31,081 INFO L226 Difference]: Without dead ends: 894 [2024-11-11 17:04:31,083 INFO L434 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-11 17:04:31,084 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 101 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:31,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 114 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:04:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-11 17:04:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2024-11-11 17:04:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.1724524076147815) internal successors, (1047), 893 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1047 transitions. [2024-11-11 17:04:31,099 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1047 transitions. Word has length 223 [2024-11-11 17:04:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:31,101 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1047 transitions. [2024-11-11 17:04:31,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1047 transitions. [2024-11-11 17:04:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-11 17:04:31,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:31,108 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:31,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:04:31,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:31,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1919360194, now seen corresponding path program 1 times [2024-11-11 17:04:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:31,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149737626] [2024-11-11 17:04:31,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:31,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:31,397 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-11 17:04:31,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:31,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149737626] [2024-11-11 17:04:31,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149737626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:31,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:31,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:31,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649205898] [2024-11-11 17:04:31,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:31,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:31,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:31,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:31,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:31,399 INFO L87 Difference]: Start difference. First operand 894 states and 1047 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:31,840 INFO L93 Difference]: Finished difference Result 1964 states and 2381 transitions. [2024-11-11 17:04:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:31,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 354 [2024-11-11 17:04:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:31,845 INFO L225 Difference]: With dead ends: 1964 [2024-11-11 17:04:31,845 INFO L226 Difference]: Without dead ends: 1250 [2024-11-11 17:04:31,846 INFO L434 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-11 17:04:31,846 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 102 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:31,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 76 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-11 17:04:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2024-11-11 17:04:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.154523618895116) internal successors, (1442), 1249 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1442 transitions. [2024-11-11 17:04:31,861 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1442 transitions. Word has length 354 [2024-11-11 17:04:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:31,862 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1442 transitions. [2024-11-11 17:04:31,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1442 transitions. [2024-11-11 17:04:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-11-11 17:04:31,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:31,865 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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] [2024-11-11 17:04:31,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:04:31,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:31,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash -57836550, now seen corresponding path program 1 times [2024-11-11 17:04:31,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:31,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908168468] [2024-11-11 17:04:31,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:31,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-11 17:04:32,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:32,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908168468] [2024-11-11 17:04:32,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908168468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:32,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:32,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:32,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404225280] [2024-11-11 17:04:32,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:32,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:04:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:32,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:04:32,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:32,188 INFO L87 Difference]: Start difference. First operand 1250 states and 1442 transitions. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:32,835 INFO L93 Difference]: Finished difference Result 2854 states and 3314 transitions. [2024-11-11 17:04:32,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:04:32,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 378 [2024-11-11 17:04:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:32,840 INFO L225 Difference]: With dead ends: 2854 [2024-11-11 17:04:32,841 INFO L226 Difference]: Without dead ends: 1784 [2024-11-11 17:04:32,842 INFO L434 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-11 17:04:32,844 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 134 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:32,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 91 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:04:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2024-11-11 17:04:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784. [2024-11-11 17:04:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1256309590577678) internal successors, (2007), 1783 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2007 transitions. [2024-11-11 17:04:32,867 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2007 transitions. Word has length 378 [2024-11-11 17:04:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:32,868 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2007 transitions. [2024-11-11 17:04:32,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2007 transitions. [2024-11-11 17:04:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2024-11-11 17:04:32,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:32,871 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-11 17:04:32,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 17:04:32,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:32,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash -538318094, now seen corresponding path program 1 times [2024-11-11 17:04:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:32,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779631103] [2024-11-11 17:04:32,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2024-11-11 17:04:33,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:33,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779631103] [2024-11-11 17:04:33,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779631103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:33,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:33,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:33,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829005315] [2024-11-11 17:04:33,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:33,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:04:33,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:33,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:04:33,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:33,234 INFO L87 Difference]: Start difference. First operand 1784 states and 2007 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:33,736 INFO L93 Difference]: Finished difference Result 3624 states and 4093 transitions. [2024-11-11 17:04:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:04:33,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 434 [2024-11-11 17:04:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:33,741 INFO L225 Difference]: With dead ends: 3624 [2024-11-11 17:04:33,741 INFO L226 Difference]: Without dead ends: 1962 [2024-11-11 17:04:33,742 INFO L434 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-11 17:04:33,743 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:33,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:04:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-11 17:04:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1606. [2024-11-11 17:04:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.0903426791277258) internal successors, (1750), 1605 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1750 transitions. [2024-11-11 17:04:33,761 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1750 transitions. Word has length 434 [2024-11-11 17:04:33,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:33,762 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1750 transitions. [2024-11-11 17:04:33,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1750 transitions. [2024-11-11 17:04:33,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-11 17:04:33,764 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:33,764 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:33,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:04:33,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:33,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:33,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1120801549, now seen corresponding path program 2 times [2024-11-11 17:04:33,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:33,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330100309] [2024-11-11 17:04:33,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:33,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 497 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-11 17:04:34,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:34,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330100309] [2024-11-11 17:04:34,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330100309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:04:34,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183802444] [2024-11-11 17:04:34,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 17:04:34,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:34,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:34,307 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-11 17:04:34,308 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-11 17:04:34,446 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 17:04:34,446 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 17:04:34,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 17:04:34,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:04:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-11 17:04:35,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:04:35,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183802444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:35,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:04:35,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 17:04:35,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326659854] [2024-11-11 17:04:35,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:35,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:04:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:04:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 17:04:35,011 INFO L87 Difference]: Start difference. First operand 1606 states and 1750 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:35,661 INFO L93 Difference]: Finished difference Result 3744 states and 4140 transitions. [2024-11-11 17:04:35,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:04:35,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 460 [2024-11-11 17:04:35,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:35,668 INFO L225 Difference]: With dead ends: 3744 [2024-11-11 17:04:35,668 INFO L226 Difference]: Without dead ends: 2318 [2024-11-11 17:04:35,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 17:04:35,671 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 191 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:35,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 15 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:04:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-11-11 17:04:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1962. [2024-11-11 17:04:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.0810810810810811) internal successors, (2120), 1961 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2120 transitions. [2024-11-11 17:04:35,705 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2120 transitions. Word has length 460 [2024-11-11 17:04:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:35,706 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2120 transitions. [2024-11-11 17:04:35,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2120 transitions. [2024-11-11 17:04:35,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2024-11-11 17:04:35,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:35,711 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:35,726 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-11 17:04:35,912 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-11 17:04:35,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:35,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1091026898, now seen corresponding path program 1 times [2024-11-11 17:04:35,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:35,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343290879] [2024-11-11 17:04:35,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-11 17:04:36,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343290879] [2024-11-11 17:04:36,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343290879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:36,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:36,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853522539] [2024-11-11 17:04:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:36,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:36,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:36,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:36,240 INFO L87 Difference]: Start difference. First operand 1962 states and 2120 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:36,637 INFO L93 Difference]: Finished difference Result 4456 states and 4880 transitions. [2024-11-11 17:04:36,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:36,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 467 [2024-11-11 17:04:36,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:36,644 INFO L225 Difference]: With dead ends: 4456 [2024-11-11 17:04:36,644 INFO L226 Difference]: Without dead ends: 2674 [2024-11-11 17:04:36,646 INFO L434 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-11 17:04:36,647 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 103 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:36,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 220 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2024-11-11 17:04:36,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2024-11-11 17:04:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.0845921450151057) internal successors, (2513), 2317 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2513 transitions. [2024-11-11 17:04:36,673 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2513 transitions. Word has length 467 [2024-11-11 17:04:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:36,673 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2513 transitions. [2024-11-11 17:04:36,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2513 transitions. [2024-11-11 17:04:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2024-11-11 17:04:36,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:36,677 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 17:04:36,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:04:36,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:36,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1499098357, now seen corresponding path program 1 times [2024-11-11 17:04:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880723922] [2024-11-11 17:04:36,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 497 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-11 17:04:37,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:37,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880723922] [2024-11-11 17:04:37,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880723922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:04:37,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478876348] [2024-11-11 17:04:37,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:37,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:37,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:37,209 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-11 17:04:37,210 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-11 17:04:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:37,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:04:37,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:04:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-11 17:04:37,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:04:37,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478876348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:37,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:04:37,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 17:04:37,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239703862] [2024-11-11 17:04:37,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:37,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:37,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:37,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:37,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:04:37,426 INFO L87 Difference]: Start difference. First operand 2318 states and 2513 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:37,797 INFO L93 Difference]: Finished difference Result 5168 states and 5664 transitions. [2024-11-11 17:04:37,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:37,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 512 [2024-11-11 17:04:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:37,804 INFO L225 Difference]: With dead ends: 5168 [2024-11-11 17:04:37,804 INFO L226 Difference]: Without dead ends: 3030 [2024-11-11 17:04:37,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:04:37,807 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 117 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:37,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 234 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 17:04:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2024-11-11 17:04:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2674. [2024-11-11 17:04:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.0867938645716424) internal successors, (2905), 2673 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2905 transitions. [2024-11-11 17:04:37,833 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2905 transitions. Word has length 512 [2024-11-11 17:04:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:37,834 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2905 transitions. [2024-11-11 17:04:37,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2905 transitions. [2024-11-11 17:04:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2024-11-11 17:04:37,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:37,838 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-11 17:04:37,851 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-11 17:04:38,038 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,SelfDestructingSolverStorable8 [2024-11-11 17:04:38,039 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:38,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:38,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1008613683, now seen corresponding path program 1 times [2024-11-11 17:04:38,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:38,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841431666] [2024-11-11 17:04:38,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:38,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 858 proven. 195 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-11 17:04:38,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:38,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841431666] [2024-11-11 17:04:38,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841431666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:04:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300418641] [2024-11-11 17:04:38,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:38,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:38,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:38,672 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-11 17:04:38,674 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-11 17:04:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:38,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:04:38,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:04:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 911 trivial. 0 not checked. [2024-11-11 17:04:38,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:04:38,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300418641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:38,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:04:38,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 17:04:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398113193] [2024-11-11 17:04:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:38,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:38,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:38,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:38,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:04:38,875 INFO L87 Difference]: Start difference. First operand 2674 states and 2905 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:39,224 INFO L93 Difference]: Finished difference Result 5702 states and 6269 transitions. [2024-11-11 17:04:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:39,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 611 [2024-11-11 17:04:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:39,231 INFO L225 Difference]: With dead ends: 5702 [2024-11-11 17:04:39,231 INFO L226 Difference]: Without dead ends: 3208 [2024-11-11 17:04:39,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:04:39,234 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 117 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:39,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 247 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 17:04:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2024-11-11 17:04:39,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030. [2024-11-11 17:04:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 3029 states have (on average 1.0881479035985473) internal successors, (3296), 3029 states have internal predecessors, (3296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3296 transitions. [2024-11-11 17:04:39,262 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3296 transitions. Word has length 611 [2024-11-11 17:04:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:39,263 INFO L471 AbstractCegarLoop]: Abstraction has 3030 states and 3296 transitions. [2024-11-11 17:04:39,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3296 transitions. [2024-11-11 17:04:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2024-11-11 17:04:39,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:39,267 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-11 17:04:39,281 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-11 17:04:39,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:39,468 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:39,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:39,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2022557042, now seen corresponding path program 1 times [2024-11-11 17:04:39,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:39,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994763139] [2024-11-11 17:04:39,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:39,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 956 proven. 195 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-11 17:04:40,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:40,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994763139] [2024-11-11 17:04:40,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994763139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:04:40,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944628140] [2024-11-11 17:04:40,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:40,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:40,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:40,098 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-11 17:04:40,100 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-11 17:04:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:40,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:04:40,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:04:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2024-11-11 17:04:40,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:04:40,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944628140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:40,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:04:40,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 17:04:40,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875398235] [2024-11-11 17:04:40,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:40,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:40,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:40,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:04:40,375 INFO L87 Difference]: Start difference. First operand 3030 states and 3296 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:40,723 INFO L93 Difference]: Finished difference Result 7124 states and 7802 transitions. [2024-11-11 17:04:40,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:40,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 649 [2024-11-11 17:04:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:40,724 INFO L225 Difference]: With dead ends: 7124 [2024-11-11 17:04:40,724 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 17:04:40,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:04:40,728 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:40,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 213 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 17:04:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 17:04:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 17:04:40,728 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-11 17:04:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 17:04:40,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 649 [2024-11-11 17:04:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:40,729 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 17:04:40,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 17:04:40,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 17:04:40,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 17:04:40,744 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-11 17:04:40,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:40,935 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:40,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 17:04:41,145 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 17:04:41,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:04:41 BoogieIcfgContainer [2024-11-11 17:04:41,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 17:04:41,157 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 17:04:41,157 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 17:04:41,157 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 17:04:41,159 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:04:27" (3/4) ... [2024-11-11 17:04:41,161 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 17:04:41,179 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 17:04:41,180 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 17:04:41,181 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 17:04:41,182 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 17:04:41,312 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 17:04:41,312 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 17:04:41,312 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 17:04:41,313 INFO L158 Benchmark]: Toolchain (without parser) took 15405.48ms. Allocated memory was 146.8MB in the beginning and 591.4MB in the end (delta: 444.6MB). Free memory was 71.3MB in the beginning and 296.4MB in the end (delta: -225.1MB). Peak memory consumption was 222.2MB. Max. memory is 16.1GB. [2024-11-11 17:04:41,313 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 146.8MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 17:04:41,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.79ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 71.1MB in the beginning and 140.3MB in the end (delta: -69.2MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-11 17:04:41,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.79ms. Allocated memory is still 192.9MB. Free memory was 140.3MB in the beginning and 130.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 17:04:41,314 INFO L158 Benchmark]: Boogie Preprocessor took 104.70ms. Allocated memory is still 192.9MB. Free memory was 130.9MB in the beginning and 118.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 17:04:41,314 INFO L158 Benchmark]: RCFGBuilder took 1022.63ms. Allocated memory is still 192.9MB. Free memory was 118.3MB in the beginning and 100.4MB in the end (delta: 17.8MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-11-11 17:04:41,314 INFO L158 Benchmark]: TraceAbstraction took 13534.73ms. Allocated memory was 192.9MB in the beginning and 591.4MB in the end (delta: 398.5MB). Free memory was 99.4MB in the beginning and 311.1MB in the end (delta: -211.7MB). Peak memory consumption was 189.9MB. Max. memory is 16.1GB. [2024-11-11 17:04:41,315 INFO L158 Benchmark]: Witness Printer took 155.25ms. Allocated memory is still 591.4MB. Free memory was 311.1MB in the beginning and 296.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 17:04:41,316 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.10ms. Allocated memory is still 146.8MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.79ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 71.1MB in the beginning and 140.3MB in the end (delta: -69.2MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.79ms. Allocated memory is still 192.9MB. Free memory was 140.3MB in the beginning and 130.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.70ms. Allocated memory is still 192.9MB. Free memory was 130.9MB in the beginning and 118.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1022.63ms. Allocated memory is still 192.9MB. Free memory was 118.3MB in the beginning and 100.4MB in the end (delta: 17.8MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13534.73ms. Allocated memory was 192.9MB in the beginning and 591.4MB in the end (delta: 398.5MB). Free memory was 99.4MB in the beginning and 311.1MB in the end (delta: -211.7MB). Peak memory consumption was 189.9MB. Max. memory is 16.1GB. * Witness Printer took 155.25ms. Allocated memory is still 591.4MB. Free memory was 311.1MB in the beginning and 296.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 206]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1805 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1805 mSDsluCounter, 1328 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 1131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6495 IncrementalHoareTripleChecker+Invalid, 7626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1131 mSolverCounterUnsat, 1255 mSDtfsCounter, 6495 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2269 GetRequests, 2236 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3030occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1602 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 6584 NumberOfCodeBlocks, 6584 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 6569 ConstructedInterpolants, 0 QuantifiedInterpolants, 22723 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2812 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 10309/11089 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: 890]: Loop Invariant Derived loop invariant: (((((((a24 == 1) && (10 <= a21)) || ((a24 == 1) && (12 <= a12))) || ((a24 == 1) && (a15 != 6))) || ((a24 == 1) && (a21 <= 6))) || ((a24 == 1) && (a21 == 9))) || ((((a15 <= 8) && (a21 <= 6)) && (a15 != 6)) && (((long long) 49 + a12) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-11 17:04:41,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE