./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label54.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 feb39bca06af67d7ac060da1dc3bc8180fef7df0c321a0d50ad90b8125c604ff --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:09:51,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:09:51,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:09:51,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:09:51,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:09:51,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:09:51,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:09:51,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:09:51,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:09:51,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:09:51,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:09:51,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:09:51,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:09:51,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:09:51,256 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:09:51,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:09:51,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:09:51,257 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:09:51,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:09:51,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:09:51,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:09:51,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:09:51,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:09:51,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:09:51,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:09:51,261 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:09:51,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:09:51,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:09:51,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:09:51,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:09:51,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:09:51,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:09:51,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:09:51,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:09:51,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:09:51,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:09:51,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:09:51,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:09:51,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:09:51,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:09:51,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:09:51,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:09:51,265 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 -> feb39bca06af67d7ac060da1dc3bc8180fef7df0c321a0d50ad90b8125c604ff [2024-11-08 11:09:51,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:09:51,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:09:51,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:09:51,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:09:51,497 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:09:51,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label54.c [2024-11-08 11:09:53,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:09:53,314 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:09:53,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label54.c [2024-11-08 11:09:53,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2d68cc1/3dc8444a5fce47afa8b5f8cfb7c2e24c/FLAG0de0dc8a7 [2024-11-08 11:09:53,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2d68cc1/3dc8444a5fce47afa8b5f8cfb7c2e24c [2024-11-08 11:09:53,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:09:53,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:09:53,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:09:53,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:09:53,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:09:53,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59fcb345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53, skipping insertion in model container [2024-11-08 11:09:53,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:09:53,580 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_label54.c[7067,7080] [2024-11-08 11:09:53,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:09:53,669 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:09:53,691 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_label54.c[7067,7080] [2024-11-08 11:09:53,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:09:53,743 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:09:53,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53 WrapperNode [2024-11-08 11:09:53,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:09:53,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:09:53,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:09:53,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:09:53,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,837 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-08 11:09:53,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:09:53,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:09:53,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:09:53,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:09:53,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,917 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-08 11:09:53,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:09:53,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:09:53,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:09:53,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:09:53,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (1/1) ... [2024-11-08 11:09:53,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:09:53,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:09:54,000 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-08 11:09:54,002 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-08 11:09:54,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:09:54,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:09:54,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:09:54,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:09:54,094 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:09:54,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:09:54,754 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 11:09:54,754 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:09:54,778 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:09:54,779 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:09:54,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:54 BoogieIcfgContainer [2024-11-08 11:09:54,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:09:54,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:09:54,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:09:54,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:09:54,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:09:53" (1/3) ... [2024-11-08 11:09:54,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:09:54, skipping insertion in model container [2024-11-08 11:09:54,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:53" (2/3) ... [2024-11-08 11:09:54,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:09:54, skipping insertion in model container [2024-11-08 11:09:54,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:54" (3/3) ... [2024-11-08 11:09:54,788 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label54.c [2024-11-08 11:09:54,802 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:09:54,802 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:09:54,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:09:54,866 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@cb1525b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:09:54,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:09:54,872 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-08 11:09:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 11:09:54,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:54,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:54,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:54,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:54,886 INFO L85 PathProgramCache]: Analyzing trace with hash 531730986, now seen corresponding path program 1 times [2024-11-08 11:09:54,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:54,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438642031] [2024-11-08 11:09:54,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:54,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:55,201 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-08 11:09:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:55,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438642031] [2024-11-08 11:09:55,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438642031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:55,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:55,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:55,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227695389] [2024-11-08 11:09:55,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:55,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:55,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:55,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:55,228 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.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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-08 11:09:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:55,852 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-08 11:09:55,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:55,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-08 11:09:55,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:55,862 INFO L225 Difference]: With dead ends: 552 [2024-11-08 11:09:55,862 INFO L226 Difference]: Without dead ends: 282 [2024-11-08 11:09:55,865 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-08 11:09:55,867 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 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.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:55,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:09:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-08 11:09:55,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-08 11:09:55,938 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-08 11:09:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2024-11-08 11:09:55,946 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 62 [2024-11-08 11:09:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:55,946 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2024-11-08 11:09:55,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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-08 11:09:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2024-11-08 11:09:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 11:09:55,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:55,954 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:55,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:09:55,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:55,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 458107734, now seen corresponding path program 1 times [2024-11-08 11:09:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:55,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703598615] [2024-11-08 11:09:55,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:55,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:56,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:56,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703598615] [2024-11-08 11:09:56,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703598615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:56,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:56,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:56,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476952823] [2024-11-08 11:09:56,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:56,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:56,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:56,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:56,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:56,122 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:56,549 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2024-11-08 11:09:56,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:56,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2024-11-08 11:09:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:56,551 INFO L225 Difference]: With dead ends: 701 [2024-11-08 11:09:56,551 INFO L226 Difference]: Without dead ends: 421 [2024-11-08 11:09:56,552 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-08 11:09:56,553 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 84 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 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-08 11:09:56,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:56,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-08 11:09:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-08 11:09:56,564 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-08 11:09:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2024-11-08 11:09:56,565 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 128 [2024-11-08 11:09:56,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:56,566 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2024-11-08 11:09:56,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2024-11-08 11:09:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 11:09:56,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:56,568 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:56,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:09:56,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:56,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:56,569 INFO L85 PathProgramCache]: Analyzing trace with hash 417689321, now seen corresponding path program 1 times [2024-11-08 11:09:56,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:56,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264996928] [2024-11-08 11:09:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:56,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:56,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:56,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264996928] [2024-11-08 11:09:56,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264996928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:56,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:56,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:56,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373495551] [2024-11-08 11:09:56,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:56,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:56,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:56,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:56,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:56,784 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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-08 11:09:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:57,170 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2024-11-08 11:09:57,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:57,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2024-11-08 11:09:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:57,175 INFO L225 Difference]: With dead ends: 979 [2024-11-08 11:09:57,175 INFO L226 Difference]: Without dead ends: 560 [2024-11-08 11:09:57,176 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-08 11:09:57,177 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.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:57,177 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.4s Time] [2024-11-08 11:09:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-08 11:09:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-08 11:09:57,188 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-08 11:09:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2024-11-08 11:09:57,189 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 135 [2024-11-08 11:09:57,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:57,189 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2024-11-08 11:09:57,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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-08 11:09:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2024-11-08 11:09:57,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 11:09:57,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:57,191 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:57,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:09:57,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:57,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:57,192 INFO L85 PathProgramCache]: Analyzing trace with hash -779134940, now seen corresponding path program 1 times [2024-11-08 11:09:57,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:57,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780900079] [2024-11-08 11:09:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:57,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:57,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780900079] [2024-11-08 11:09:57,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780900079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:57,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:57,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 11:09:57,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97021943] [2024-11-08 11:09:57,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:57,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 11:09:57,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:57,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 11:09:57,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:57,545 INFO L87 Difference]: Start difference. First operand 560 states and 675 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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-08 11:09:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:57,931 INFO L93 Difference]: Finished difference Result 1034 states and 1254 transitions. [2024-11-08 11:09:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 11:09:57,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-11-08 11:09:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:57,935 INFO L225 Difference]: With dead ends: 1034 [2024-11-08 11:09:57,935 INFO L226 Difference]: Without dead ends: 560 [2024-11-08 11:09:57,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:57,936 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-08 11:09:57,937 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-08 11:09:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-08 11:09:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-08 11:09:57,952 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-08 11:09:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 672 transitions. [2024-11-08 11:09:57,953 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 672 transitions. Word has length 137 [2024-11-08 11:09:57,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:57,953 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 672 transitions. [2024-11-08 11:09:57,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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-08 11:09:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 672 transitions. [2024-11-08 11:09:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 11:09:57,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:57,956 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, 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] [2024-11-08 11:09:57,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:09:57,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:57,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:57,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1413984764, now seen corresponding path program 1 times [2024-11-08 11:09:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:57,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382366345] [2024-11-08 11:09:57,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:57,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:58,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:58,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382366345] [2024-11-08 11:09:58,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382366345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:58,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:58,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:58,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190712841] [2024-11-08 11:09:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:58,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:58,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:58,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:58,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:58,039 INFO L87 Difference]: Start difference. First operand 560 states and 672 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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-08 11:09:58,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:58,875 INFO L93 Difference]: Finished difference Result 1257 states and 1566 transitions. [2024-11-08 11:09:58,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:58,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2024-11-08 11:09:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:58,877 INFO L225 Difference]: With dead ends: 1257 [2024-11-08 11:09:58,877 INFO L226 Difference]: Without dead ends: 838 [2024-11-08 11:09:58,878 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-08 11:09:58,879 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:58,879 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.8s Time] [2024-11-08 11:09:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-08 11:09:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-08 11:09:58,888 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-08 11:09:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1004 transitions. [2024-11-08 11:09:58,890 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1004 transitions. Word has length 153 [2024-11-08 11:09:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:58,890 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1004 transitions. [2024-11-08 11:09:58,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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-08 11:09:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1004 transitions. [2024-11-08 11:09:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 11:09:58,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:58,892 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, 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] [2024-11-08 11:09:58,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:09:58,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:58,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash -114636214, now seen corresponding path program 1 times [2024-11-08 11:09:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:58,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43976750] [2024-11-08 11:09:58,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:59,037 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:59,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:59,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43976750] [2024-11-08 11:09:59,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43976750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:59,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:59,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:59,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195920135] [2024-11-08 11:09:59,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:59,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:59,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:59,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:59,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:59,039 INFO L87 Difference]: Start difference. First operand 838 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-08 11:09:59,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:59,520 INFO L93 Difference]: Finished difference Result 1674 states and 2052 transitions. [2024-11-08 11:09:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:59,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2024-11-08 11:09:59,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:59,523 INFO L225 Difference]: With dead ends: 1674 [2024-11-08 11:09:59,527 INFO L226 Difference]: Without dead ends: 977 [2024-11-08 11:09:59,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:59,528 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 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.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:59,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 190 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:09:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-08 11:09:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-08 11:09:59,550 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-08 11:09:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1118 transitions. [2024-11-08 11:09:59,555 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1118 transitions. Word has length 173 [2024-11-08 11:09:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:59,556 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1118 transitions. [2024-11-08 11:09:59,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-08 11:09:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1118 transitions. [2024-11-08 11:09:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 11:09:59,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:59,558 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, 3, 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-08 11:09:59,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:09:59,558 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:59,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash 606755529, now seen corresponding path program 1 times [2024-11-08 11:09:59,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:59,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909317980] [2024-11-08 11:09:59,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:59,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-08 11:09:59,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:59,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909317980] [2024-11-08 11:09:59,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909317980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:09:59,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383878459] [2024-11-08 11:09:59,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:59,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:09:59,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:09:59,991 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-08 11:09:59,993 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-08 11:10:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:00,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:10:00,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:10:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-11-08 11:10:00,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:10:00,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383878459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:00,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:10:00,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-08 11:10:00,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771684731] [2024-11-08 11:10:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:00,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:00,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:00,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:00,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:10:00,523 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-08 11:10:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:00,959 INFO L93 Difference]: Finished difference Result 1535 states and 1759 transitions. [2024-11-08 11:10:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:00,960 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 246 [2024-11-08 11:10:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:00,963 INFO L225 Difference]: With dead ends: 1535 [2024-11-08 11:10:00,964 INFO L226 Difference]: Without dead ends: 1533 [2024-11-08 11:10:00,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 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-08 11:10:00,965 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-08 11:10:00,965 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-08 11:10:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-11-08 11:10:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1116. [2024-11-08 11:10:00,976 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-08 11:10:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1306 transitions. [2024-11-08 11:10:00,978 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1306 transitions. Word has length 246 [2024-11-08 11:10:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:00,978 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1306 transitions. [2024-11-08 11:10:00,979 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-08 11:10:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1306 transitions. [2024-11-08 11:10:00,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-11-08 11:10:00,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:00,981 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:10:00,995 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-08 11:10:01,182 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-08 11:10:01,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:01,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1835122135, now seen corresponding path program 1 times [2024-11-08 11:10:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:01,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680702538] [2024-11-08 11:10:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 60 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:01,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:01,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680702538] [2024-11-08 11:10:01,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680702538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:01,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098582624] [2024-11-08 11:10:01,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:01,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:01,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:01,635 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-08 11:10:01,636 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-08 11:10:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:01,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:10:01,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:10:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 11:10:01,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:10:01,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098582624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:01,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:10:01,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-08 11:10:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118455256] [2024-11-08 11:10:01,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:01,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:01,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:01,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:01,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:10:01,804 INFO L87 Difference]: Start difference. First operand 1116 states and 1306 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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-08 11:10:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:02,153 INFO L93 Difference]: Finished difference Result 2369 states and 2844 transitions. [2024-11-08 11:10:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:02,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 310 [2024-11-08 11:10:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:02,156 INFO L225 Difference]: With dead ends: 2369 [2024-11-08 11:10:02,157 INFO L226 Difference]: Without dead ends: 1394 [2024-11-08 11:10:02,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 310 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-08 11:10:02,158 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 80 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 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-08 11:10:02,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 225 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:10:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-08 11:10:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2024-11-08 11:10:02,189 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-08 11:10:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1460 transitions. [2024-11-08 11:10:02,195 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1460 transitions. Word has length 310 [2024-11-08 11:10:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:02,195 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1460 transitions. [2024-11-08 11:10:02,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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-08 11:10:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1460 transitions. [2024-11-08 11:10:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-11-08 11:10:02,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:02,202 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 11:10:02,228 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-08 11:10:02,406 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-08 11:10:02,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:02,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:02,407 INFO L85 PathProgramCache]: Analyzing trace with hash 419342785, now seen corresponding path program 1 times [2024-11-08 11:10:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:02,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367945650] [2024-11-08 11:10:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:02,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-08 11:10:02,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:02,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367945650] [2024-11-08 11:10:02,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367945650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:02,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:02,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:02,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123967279] [2024-11-08 11:10:02,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:02,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:02,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:02,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:02,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:02,747 INFO L87 Difference]: Start difference. First operand 1255 states and 1460 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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-08 11:10:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:03,098 INFO L93 Difference]: Finished difference Result 1672 states and 1911 transitions. [2024-11-08 11:10:03,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:03,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 361 [2024-11-08 11:10:03,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:03,099 INFO L225 Difference]: With dead ends: 1672 [2024-11-08 11:10:03,099 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:10:03,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-08 11:10:03,101 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 122 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:03,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 8 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:10:03,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:10:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:10:03,101 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-08 11:10:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:10:03,101 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 361 [2024-11-08 11:10:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:03,102 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:10:03,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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-08 11:10:03,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:10:03,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:10:03,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:10:03,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:10:03,107 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:03,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:10:03,288 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:10:03,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:10:03 BoogieIcfgContainer [2024-11-08 11:10:03,307 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:10:03,311 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:10:03,311 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:10:03,311 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:10:03,312 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:54" (3/4) ... [2024-11-08 11:10:03,317 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:10:03,331 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:10:03,332 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:10:03,336 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:10:03,336 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:10:03,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:10:03,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:10:03,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:10:03,467 INFO L158 Benchmark]: Toolchain (without parser) took 10117.07ms. Allocated memory was 192.9MB in the beginning and 335.5MB in the end (delta: 142.6MB). Free memory was 121.9MB in the beginning and 254.9MB in the end (delta: -133.0MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-11-08 11:10:03,467 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 117.4MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:10:03,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.39ms. Allocated memory is still 192.9MB. Free memory was 121.7MB in the beginning and 91.9MB in the end (delta: 29.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 11:10:03,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.58ms. Allocated memory is still 192.9MB. Free memory was 91.9MB in the beginning and 158.6MB in the end (delta: -66.8MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-08 11:10:03,467 INFO L158 Benchmark]: Boogie Preprocessor took 122.16ms. Allocated memory is still 192.9MB. Free memory was 158.6MB in the beginning and 149.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 11:10:03,467 INFO L158 Benchmark]: RCFGBuilder took 815.34ms. Allocated memory is still 192.9MB. Free memory was 149.1MB in the beginning and 150.9MB in the end (delta: -1.8MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2024-11-08 11:10:03,468 INFO L158 Benchmark]: TraceAbstraction took 8526.49ms. Allocated memory was 192.9MB in the beginning and 335.5MB in the end (delta: 142.6MB). Free memory was 149.9MB in the beginning and 266.4MB in the end (delta: -116.6MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-11-08 11:10:03,468 INFO L158 Benchmark]: Witness Printer took 155.00ms. Allocated memory is still 335.5MB. Free memory was 266.4MB in the beginning and 254.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 11:10:03,469 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 117.4MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.39ms. Allocated memory is still 192.9MB. Free memory was 121.7MB in the beginning and 91.9MB in the end (delta: 29.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.58ms. Allocated memory is still 192.9MB. Free memory was 91.9MB in the beginning and 158.6MB in the end (delta: -66.8MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.16ms. Allocated memory is still 192.9MB. Free memory was 158.6MB in the beginning and 149.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 815.34ms. Allocated memory is still 192.9MB. Free memory was 149.1MB in the beginning and 150.9MB in the end (delta: -1.8MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8526.49ms. Allocated memory was 192.9MB in the beginning and 335.5MB in the end (delta: 142.6MB). Free memory was 149.9MB in the beginning and 266.4MB in the end (delta: -116.6MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Witness Printer took 155.00ms. Allocated memory is still 335.5MB. Free memory was 266.4MB in the beginning and 254.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 200]: 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: 8.3s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 845 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 845 mSDsluCounter, 902 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 531 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3603 IncrementalHoareTripleChecker+Invalid, 4134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 531 mSolverCounterUnsat, 853 mSDtfsCounter, 3603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 568 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 556 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2261 NumberOfCodeBlocks, 2261 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2250 ConstructedInterpolants, 0 QuantifiedInterpolants, 7514 SizeOfPredicates, 0 NumberOfNonLiveVariables, 760 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 1308/1569 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) && (a19 != 8)) && (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))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:10:03,507 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