./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label11.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 05304907b173f35ae86ead9bea08abf85c97bbd94fd3cf389c54ce6fac582ae4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 22:01:22,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 22:01:22,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 22:01:22,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 22:01:22,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 22:01:22,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 22:01:22,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 22:01:22,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 22:01:22,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 22:01:22,814 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 22:01:22,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 22:01:22,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 22:01:22,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 22:01:22,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 22:01:22,819 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 22:01:22,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 22:01:22,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 22:01:22,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 22:01:22,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 22:01:22,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 22:01:22,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 22:01:22,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 22:01:22,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 22:01:22,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 22:01:22,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 22:01:22,825 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 22:01:22,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 22:01:22,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 22:01:22,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 22:01:22,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 22:01:22,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 22:01:22,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 22:01:22,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:01:22,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 22:01:22,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 22:01:22,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 22:01:22,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 22:01:22,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 22:01:22,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 22:01:22,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 22:01:22,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 22:01:22,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 22:01:22,828 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 -> 05304907b173f35ae86ead9bea08abf85c97bbd94fd3cf389c54ce6fac582ae4 [2024-11-21 22:01:23,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 22:01:23,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 22:01:23,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 22:01:23,066 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 22:01:23,068 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 22:01:23,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label11.c [2024-11-21 22:01:24,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 22:01:24,572 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 22:01:24,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label11.c [2024-11-21 22:01:24,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa2a225a/1b5d883ca33b4f08bcbb03bb71ce5224/FLAGaedc52e1a [2024-11-21 22:01:24,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa2a225a/1b5d883ca33b4f08bcbb03bb71ce5224 [2024-11-21 22:01:24,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 22:01:24,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 22:01:24,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 22:01:24,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 22:01:24,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 22:01:24,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:01:24" (1/1) ... [2024-11-21 22:01:24,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57bbf6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:24, skipping insertion in model container [2024-11-21 22:01:24,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:01:24" (1/1) ... [2024-11-21 22:01:24,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 22:01:25,248 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/Problem10_label11.c[6968,6981] [2024-11-21 22:01:25,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:01:25,382 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 22:01:25,404 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/Problem10_label11.c[6968,6981] [2024-11-21 22:01:25,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:01:25,464 INFO L204 MainTranslator]: Completed translation [2024-11-21 22:01:25,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25 WrapperNode [2024-11-21 22:01:25,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 22:01:25,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 22:01:25,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 22:01:25,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 22:01:25,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (1/1) ... [2024-11-21 22:01:25,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (1/1) ... [2024-11-21 22:01:25,528 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-21 22:01:25,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 22:01:25,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 22:01:25,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 22:01:25,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 22:01:25,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (1/1) ... [2024-11-21 22:01:25,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (1/1) ... [2024-11-21 22:01:25,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (1/1) ... [2024-11-21 22:01:25,579 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-21 22:01:25,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (1/1) ... [2024-11-21 22:01:25,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (1/1) ... [2024-11-21 22:01:25,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (1/1) ... [2024-11-21 22:01:25,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (1/1) ... [2024-11-21 22:01:25,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (1/1) ... [2024-11-21 22:01:25,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (1/1) ... [2024-11-21 22:01:25,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 22:01:25,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 22:01:25,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 22:01:25,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 22:01:25,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (1/1) ... [2024-11-21 22:01:25,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:01:25,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:01:25,651 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-21 22:01:25,658 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-21 22:01:25,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 22:01:25,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 22:01:25,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 22:01:25,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 22:01:25,748 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 22:01:25,749 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 22:01:26,563 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-21 22:01:26,563 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 22:01:26,581 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 22:01:26,581 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 22:01:26,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:26 BoogieIcfgContainer [2024-11-21 22:01:26,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 22:01:26,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 22:01:26,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 22:01:26,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 22:01:26,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:01:24" (1/3) ... [2024-11-21 22:01:26,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787050ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:01:26, skipping insertion in model container [2024-11-21 22:01:26,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:25" (2/3) ... [2024-11-21 22:01:26,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787050ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:01:26, skipping insertion in model container [2024-11-21 22:01:26,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:26" (3/3) ... [2024-11-21 22:01:26,610 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label11.c [2024-11-21 22:01:26,626 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 22:01:26,626 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 22:01:26,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 22:01:26,718 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;@3398fb8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 22:01:26,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 22:01:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-21 22:01:26,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:26,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:01:26,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:26,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:26,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1818267785, now seen corresponding path program 1 times [2024-11-21 22:01:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:26,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290998347] [2024-11-21 22:01:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:26,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:27,030 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-21 22:01:27,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290998347] [2024-11-21 22:01:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290998347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:27,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:27,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:01:27,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526018565] [2024-11-21 22:01:27,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:27,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:27,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:27,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:27,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:27,063 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 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 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:27,595 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-21 22:01:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:27,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-21 22:01:27,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:27,608 INFO L225 Difference]: With dead ends: 552 [2024-11-21 22:01:27,608 INFO L226 Difference]: Without dead ends: 282 [2024-11-21 22:01:27,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:27,619 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:27,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:01:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-21 22:01:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-21 22:01:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2024-11-21 22:01:27,665 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 61 [2024-11-21 22:01:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:27,666 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2024-11-21 22:01:27,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2024-11-21 22:01:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-21 22:01:27,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:27,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:01:27,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 22:01:27,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:27,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash -270262724, now seen corresponding path program 1 times [2024-11-21 22:01:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:27,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269298477] [2024-11-21 22:01:27,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:27,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:27,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269298477] [2024-11-21 22:01:27,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269298477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:27,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:27,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:27,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976614178] [2024-11-21 22:01:27,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:27,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:27,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:27,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:27,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:27,872 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:28,248 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2024-11-21 22:01:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:28,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-11-21 22:01:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:28,251 INFO L225 Difference]: With dead ends: 701 [2024-11-21 22:01:28,251 INFO L226 Difference]: Without dead ends: 421 [2024-11-21 22:01:28,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:28,252 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:28,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-21 22:01:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-21 22:01:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2024-11-21 22:01:28,268 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 127 [2024-11-21 22:01:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:28,269 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2024-11-21 22:01:28,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2024-11-21 22:01:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-21 22:01:28,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:28,273 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:01:28,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 22:01:28,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:28,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:28,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1197684053, now seen corresponding path program 1 times [2024-11-21 22:01:28,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:28,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313851130] [2024-11-21 22:01:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:28,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313851130] [2024-11-21 22:01:28,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313851130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:28,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:28,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:01:28,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434763667] [2024-11-21 22:01:28,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:28,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:28,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:28,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:28,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:28,453 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:28,795 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2024-11-21 22:01:28,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:28,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2024-11-21 22:01:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:28,797 INFO L225 Difference]: With dead ends: 979 [2024-11-21 22:01:28,797 INFO L226 Difference]: Without dead ends: 560 [2024-11-21 22:01:28,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:28,799 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:28,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 22:01:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-21 22:01:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-21 22:01:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2024-11-21 22:01:28,814 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 134 [2024-11-21 22:01:28,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:28,815 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2024-11-21 22:01:28,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:28,815 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2024-11-21 22:01:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-21 22:01:28,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:28,817 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:01:28,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 22:01:28,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:28,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:28,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1373872592, now seen corresponding path program 1 times [2024-11-21 22:01:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:28,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066964307] [2024-11-21 22:01:28,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:29,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:29,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066964307] [2024-11-21 22:01:29,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066964307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:29,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:29,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 22:01:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100577019] [2024-11-21 22:01:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:29,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-21 22:01:29,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:29,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-21 22:01:29,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:01:29,125 INFO L87 Difference]: Start difference. First operand 560 states and 675 transitions. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:29,515 INFO L93 Difference]: Finished difference Result 1034 states and 1254 transitions. [2024-11-21 22:01:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 22:01:29,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-21 22:01:29,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:29,517 INFO L225 Difference]: With dead ends: 1034 [2024-11-21 22:01:29,517 INFO L226 Difference]: Without dead ends: 560 [2024-11-21 22:01:29,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:01:29,518 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:29,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-21 22:01:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-21 22:01:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2021466905187836) internal successors, (672), 559 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 672 transitions. [2024-11-21 22:01:29,528 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 672 transitions. Word has length 136 [2024-11-21 22:01:29,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:29,528 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 672 transitions. [2024-11-21 22:01:29,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 672 transitions. [2024-11-21 22:01:29,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-21 22:01:29,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:29,530 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:29,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 22:01:29,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:29,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash 19499768, now seen corresponding path program 1 times [2024-11-21 22:01:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:29,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442644163] [2024-11-21 22:01:29,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:29,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:29,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:29,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442644163] [2024-11-21 22:01:29,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442644163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:29,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:29,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:01:29,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125247322] [2024-11-21 22:01:29,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:29,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:29,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:29,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:29,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:29,634 INFO L87 Difference]: Start difference. First operand 560 states and 672 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:30,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:30,024 INFO L93 Difference]: Finished difference Result 1257 states and 1566 transitions. [2024-11-21 22:01:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:30,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2024-11-21 22:01:30,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:30,027 INFO L225 Difference]: With dead ends: 1257 [2024-11-21 22:01:30,028 INFO L226 Difference]: Without dead ends: 838 [2024-11-21 22:01:30,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:30,029 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:30,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-21 22:01:30,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-21 22:01:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.1995221027479093) internal successors, (1004), 837 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1004 transitions. [2024-11-21 22:01:30,044 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1004 transitions. Word has length 152 [2024-11-21 22:01:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:30,045 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1004 transitions. [2024-11-21 22:01:30,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1004 transitions. [2024-11-21 22:01:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-21 22:01:30,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:30,047 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:30,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 22:01:30,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:30,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:30,048 INFO L85 PathProgramCache]: Analyzing trace with hash -733419926, now seen corresponding path program 1 times [2024-11-21 22:01:30,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:30,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518132521] [2024-11-21 22:01:30,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:30,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:30,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:30,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518132521] [2024-11-21 22:01:30,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518132521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:30,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:30,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:30,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732605566] [2024-11-21 22:01:30,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:30,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:30,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:30,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:30,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:30,160 INFO L87 Difference]: Start difference. First operand 838 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:30,515 INFO L93 Difference]: Finished difference Result 1674 states and 2052 transitions. [2024-11-21 22:01:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:30,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2024-11-21 22:01:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:30,521 INFO L225 Difference]: With dead ends: 1674 [2024-11-21 22:01:30,521 INFO L226 Difference]: Without dead ends: 977 [2024-11-21 22:01:30,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:30,523 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 94 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:30,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 190 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 22:01:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-21 22:01:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-21 22:01:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.1454918032786885) internal successors, (1118), 976 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1118 transitions. [2024-11-21 22:01:30,539 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1118 transitions. Word has length 172 [2024-11-21 22:01:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:30,539 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1118 transitions. [2024-11-21 22:01:30,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1118 transitions. [2024-11-21 22:01:30,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-21 22:01:30,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:30,543 INFO L215 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:30,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 22:01:30,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:30,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1246295574, now seen corresponding path program 1 times [2024-11-21 22:01:30,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:30,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269722125] [2024-11-21 22:01:30,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:30,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-21 22:01:30,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:30,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269722125] [2024-11-21 22:01:30,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269722125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:01:30,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838005802] [2024-11-21 22:01:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:30,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:01:30,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:01:30,880 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-21 22:01:30,890 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-21 22:01:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:30,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:01:30,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:01:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-21 22:01:31,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:01:31,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838005802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:31,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:01:31,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-21 22:01:31,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999886872] [2024-11-21 22:01:31,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:31,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:31,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:31,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:31,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 22:01:31,269 INFO L87 Difference]: Start difference. First operand 977 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:31,655 INFO L93 Difference]: Finished difference Result 1535 states and 1759 transitions. [2024-11-21 22:01:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:31,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 245 [2024-11-21 22:01:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:31,659 INFO L225 Difference]: With dead ends: 1535 [2024-11-21 22:01:31,659 INFO L226 Difference]: Without dead ends: 1533 [2024-11-21 22:01:31,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 22:01:31,661 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:31,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 11 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-11-21 22:01:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1116. [2024-11-21 22:01:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1713004484304932) internal successors, (1306), 1115 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1306 transitions. [2024-11-21 22:01:31,678 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1306 transitions. Word has length 245 [2024-11-21 22:01:31,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:31,678 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1306 transitions. [2024-11-21 22:01:31,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1306 transitions. [2024-11-21 22:01:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-21 22:01:31,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:31,682 INFO L215 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:31,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-21 22:01:31,885 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-21 22:01:31,886 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:31,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:31,887 INFO L85 PathProgramCache]: Analyzing trace with hash -872827254, now seen corresponding path program 1 times [2024-11-21 22:01:31,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:31,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190383747] [2024-11-21 22:01:31,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 59 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:32,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:32,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190383747] [2024-11-21 22:01:32,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190383747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:01:32,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503626186] [2024-11-21 22:01:32,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:32,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:01:32,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:01:32,378 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-21 22:01:32,379 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-21 22:01:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:32,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:01:32,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:01:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-21 22:01:32,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:01:32,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503626186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:32,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:01:32,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-21 22:01:32,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501518198] [2024-11-21 22:01:32,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:32,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:32,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:32,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:32,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-21 22:01:32,543 INFO L87 Difference]: Start difference. First operand 1116 states and 1306 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:32,904 INFO L93 Difference]: Finished difference Result 2369 states and 2844 transitions. [2024-11-21 22:01:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:32,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 309 [2024-11-21 22:01:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:32,908 INFO L225 Difference]: With dead ends: 2369 [2024-11-21 22:01:32,909 INFO L226 Difference]: Without dead ends: 1394 [2024-11-21 22:01:32,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-21 22:01:32,910 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 81 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:32,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 225 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 22:01:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-21 22:01:32,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2024-11-21 22:01:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.164274322169059) internal successors, (1460), 1254 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1460 transitions. [2024-11-21 22:01:32,927 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1460 transitions. Word has length 309 [2024-11-21 22:01:32,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:32,927 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1460 transitions. [2024-11-21 22:01:32,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1460 transitions. [2024-11-21 22:01:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-11-21 22:01:32,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:32,931 INFO L215 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:32,941 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-21 22:01:33,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-21 22:01:33,135 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:33,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:33,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2043087437, now seen corresponding path program 1 times [2024-11-21 22:01:33,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:33,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053939085] [2024-11-21 22:01:33,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-21 22:01:33,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053939085] [2024-11-21 22:01:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053939085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:33,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:33,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086623511] [2024-11-21 22:01:33,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:33,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:33,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:33,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:33,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:33,365 INFO L87 Difference]: Start difference. First operand 1255 states and 1460 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:33,753 INFO L93 Difference]: Finished difference Result 2228 states and 2585 transitions. [2024-11-21 22:01:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:33,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 360 [2024-11-21 22:01:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:33,754 INFO L225 Difference]: With dead ends: 2228 [2024-11-21 22:01:33,754 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 22:01:33,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:33,757 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 91 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:33,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 24 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 22:01:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 22:01:33,758 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-21 22:01:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 22:01:33,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 360 [2024-11-21 22:01:33,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:33,761 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 22:01:33,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:33,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 22:01:33,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 22:01:33,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 22:01:33,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 22:01:33,766 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:33,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 22:01:33,965 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 22:01:33,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:01:33 BoogieIcfgContainer [2024-11-21 22:01:33,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 22:01:33,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 22:01:33,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 22:01:33,979 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 22:01:33,979 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:26" (3/4) ... [2024-11-21 22:01:33,981 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 22:01:33,991 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 22:01:33,991 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 22:01:33,992 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 22:01:33,992 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 22:01:34,099 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 22:01:34,099 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 22:01:34,100 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 22:01:34,100 INFO L158 Benchmark]: Toolchain (without parser) took 9173.05ms. Allocated memory was 146.8MB in the beginning and 348.1MB in the end (delta: 201.3MB). Free memory was 75.3MB in the beginning and 278.9MB in the end (delta: -203.5MB). Peak memory consumption was 326.2kB. Max. memory is 16.1GB. [2024-11-21 22:01:34,100 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory was 99.8MB in the beginning and 99.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 22:01:34,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.36ms. Allocated memory was 146.8MB in the beginning and 222.3MB in the end (delta: 75.5MB). Free memory was 75.2MB in the beginning and 177.3MB in the end (delta: -102.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-21 22:01:34,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.71ms. Allocated memory is still 222.3MB. Free memory was 177.3MB in the beginning and 169.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-21 22:01:34,101 INFO L158 Benchmark]: Boogie Preprocessor took 85.28ms. Allocated memory is still 222.3MB. Free memory was 169.0MB in the beginning and 159.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-21 22:01:34,101 INFO L158 Benchmark]: RCFGBuilder took 967.31ms. Allocated memory is still 222.3MB. Free memory was 159.5MB in the beginning and 65.2MB in the end (delta: 94.4MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-11-21 22:01:34,102 INFO L158 Benchmark]: TraceAbstraction took 7375.38ms. Allocated memory was 222.3MB in the beginning and 348.1MB in the end (delta: 125.8MB). Free memory was 184.4MB in the beginning and 291.5MB in the end (delta: -107.1MB). Peak memory consumption was 205.4MB. Max. memory is 16.1GB. [2024-11-21 22:01:34,102 INFO L158 Benchmark]: Witness Printer took 120.99ms. Allocated memory is still 348.1MB. Free memory was 291.5MB in the beginning and 278.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 22:01:34,103 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.14ms. Allocated memory is still 146.8MB. Free memory was 99.8MB in the beginning and 99.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.36ms. Allocated memory was 146.8MB in the beginning and 222.3MB in the end (delta: 75.5MB). Free memory was 75.2MB in the beginning and 177.3MB in the end (delta: -102.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.71ms. Allocated memory is still 222.3MB. Free memory was 177.3MB in the beginning and 169.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.28ms. Allocated memory is still 222.3MB. Free memory was 169.0MB in the beginning and 159.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 967.31ms. Allocated memory is still 222.3MB. Free memory was 159.5MB in the beginning and 65.2MB in the end (delta: 94.4MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7375.38ms. Allocated memory was 222.3MB in the beginning and 348.1MB in the end (delta: 125.8MB). Free memory was 184.4MB in the beginning and 291.5MB in the end (delta: -107.1MB). Peak memory consumption was 205.4MB. Max. memory is 16.1GB. * Witness Printer took 120.99ms. Allocated memory is still 348.1MB. Free memory was 291.5MB in the beginning and 278.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 197]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 818 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 818 mSDsluCounter, 918 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 558 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3623 IncrementalHoareTripleChecker+Invalid, 4181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 558 mSolverCounterUnsat, 869 mSDtfsCounter, 3623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1255occurred in iteration=8, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 556 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2250 NumberOfCodeBlocks, 2250 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2239 ConstructedInterpolants, 0 QuantifiedInterpolants, 7525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 758 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 1297/1553 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: 592]: Loop Invariant Derived loop invariant: ((((((((a19 == 9) && (14 == a4)) && (a12 == 0)) || ((((a19 <= 9) && (4 <= a10)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (0 <= ((long long) a1 + 12))) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-21 22:01:34,118 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