./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label57.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/Problem02_label57.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 cd0e9e348944f288c85b96bc2a95060d4855821a916ce78d5b1c45cd9e69ad53 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:28:29,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:28:29,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:28:29,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:28:29,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:28:30,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:28:30,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:28:30,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:28:30,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:28:30,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:28:30,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:28:30,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:28:30,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:28:30,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:28:30,016 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:28:30,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:28:30,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:28:30,017 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:28:30,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:28:30,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:28:30,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:28:30,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:28:30,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:28:30,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:28:30,021 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:28:30,021 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:28:30,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:28:30,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:28:30,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:28:30,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:28:30,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:28:30,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:28:30,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:28:30,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:28:30,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:28:30,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:28:30,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:28:30,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:28:30,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:28:30,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:28:30,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:28:30,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:28:30,027 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 -> cd0e9e348944f288c85b96bc2a95060d4855821a916ce78d5b1c45cd9e69ad53 [2024-11-08 10:28:30,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:28:30,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:28:30,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:28:30,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:28:30,361 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:28:30,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label57.c [2024-11-08 10:28:31,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:28:32,072 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:28:32,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label57.c [2024-11-08 10:28:32,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16bce84a/0cd747c7fae844e0b2b76bffd1ad2529/FLAGe48a1c36c [2024-11-08 10:28:32,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16bce84a/0cd747c7fae844e0b2b76bffd1ad2529 [2024-11-08 10:28:32,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:28:32,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:28:32,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:28:32,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:28:32,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:28:32,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:32,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2d597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32, skipping insertion in model container [2024-11-08 10:28:32,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:32,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:28:32,759 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/Problem02_label57.c[15764,15777] [2024-11-08 10:28:32,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:28:32,827 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:28:32,904 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/Problem02_label57.c[15764,15777] [2024-11-08 10:28:32,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:28:32,954 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:28:32,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32 WrapperNode [2024-11-08 10:28:32,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:28:32,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:28:32,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:28:32,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:28:32,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:32,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:33,026 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-08 10:28:33,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:28:33,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:28:33,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:28:33,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:28:33,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:33,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:33,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:33,085 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 10:28:33,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:33,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:33,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:33,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:33,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:33,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:33,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:28:33,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:28:33,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:28:33,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:28:33,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (1/1) ... [2024-11-08 10:28:33,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:28:33,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:28:33,195 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 10:28:33,202 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 10:28:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:28:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:28:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:28:33,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:28:33,424 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:28:33,426 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:28:34,421 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 10:28:34,421 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:28:34,467 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:28:34,469 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:28:34,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:34 BoogieIcfgContainer [2024-11-08 10:28:34,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:28:34,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:28:34,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:28:34,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:28:34,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:28:32" (1/3) ... [2024-11-08 10:28:34,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53df58a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:28:34, skipping insertion in model container [2024-11-08 10:28:34,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:32" (2/3) ... [2024-11-08 10:28:34,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53df58a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:28:34, skipping insertion in model container [2024-11-08 10:28:34,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:34" (3/3) ... [2024-11-08 10:28:34,485 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label57.c [2024-11-08 10:28:34,508 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:28:34,509 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:28:34,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:28:34,638 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;@4b0c14b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:28:34,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:28:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 10:28:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 10:28:34,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:34,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:34,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:34,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:34,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1333629293, now seen corresponding path program 1 times [2024-11-08 10:28:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:34,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120837175] [2024-11-08 10:28:34,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:34,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:35,138 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 10:28:35,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:35,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120837175] [2024-11-08 10:28:35,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120837175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:35,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:35,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:35,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495902196] [2024-11-08 10:28:35,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:35,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:35,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:35,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:35,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:35,180 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 10:28:36,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:36,038 INFO L93 Difference]: Finished difference Result 601 states and 1035 transitions. [2024-11-08 10:28:36,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:36,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-08 10:28:36,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:36,055 INFO L225 Difference]: With dead ends: 601 [2024-11-08 10:28:36,055 INFO L226 Difference]: Without dead ends: 310 [2024-11-08 10:28:36,059 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 10:28:36,065 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 143 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:36,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 116 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:28:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-08 10:28:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-08 10:28:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4368932038834952) internal successors, (444), 309 states have internal predecessors, (444), 0 states have call successors, (0), 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 10:28:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2024-11-08 10:28:36,125 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 91 [2024-11-08 10:28:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:36,126 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2024-11-08 10:28:36,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 10:28:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2024-11-08 10:28:36,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 10:28:36,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:36,131 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:36,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:28:36,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:36,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 122307570, now seen corresponding path program 1 times [2024-11-08 10:28:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:36,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410118666] [2024-11-08 10:28:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:36,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:36,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410118666] [2024-11-08 10:28:36,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410118666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:36,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:36,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:36,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147154488] [2024-11-08 10:28:36,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:36,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:36,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:36,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:36,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:36,368 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 10:28:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:36,847 INFO L93 Difference]: Finished difference Result 911 states and 1313 transitions. [2024-11-08 10:28:36,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:36,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-08 10:28:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:36,851 INFO L225 Difference]: With dead ends: 911 [2024-11-08 10:28:36,852 INFO L226 Difference]: Without dead ends: 603 [2024-11-08 10:28:36,853 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 10:28:36,854 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 156 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:36,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 98 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:28:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-08 10:28:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 598. [2024-11-08 10:28:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.3953098827470687) internal successors, (833), 597 states have internal predecessors, (833), 0 states have call successors, (0), 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 10:28:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 833 transitions. [2024-11-08 10:28:36,893 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 833 transitions. Word has length 109 [2024-11-08 10:28:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:36,893 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 833 transitions. [2024-11-08 10:28:36,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 10:28:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 833 transitions. [2024-11-08 10:28:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 10:28:36,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:36,903 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:36,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:28:36,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:36,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1707230710, now seen corresponding path program 1 times [2024-11-08 10:28:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:36,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218500866] [2024-11-08 10:28:36,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:36,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:37,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:37,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218500866] [2024-11-08 10:28:37,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218500866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:37,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:37,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:37,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632649957] [2024-11-08 10:28:37,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:37,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:37,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:37,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:37,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:37,098 INFO L87 Difference]: Start difference. First operand 598 states and 833 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 10:28:37,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:37,563 INFO L93 Difference]: Finished difference Result 1755 states and 2451 transitions. [2024-11-08 10:28:37,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:37,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-08 10:28:37,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:37,569 INFO L225 Difference]: With dead ends: 1755 [2024-11-08 10:28:37,569 INFO L226 Difference]: Without dead ends: 1159 [2024-11-08 10:28:37,572 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 10:28:37,573 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 144 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:37,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 90 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:28:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-08 10:28:37,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2024-11-08 10:28:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 1.3411053540587219) internal successors, (1553), 1158 states have internal predecessors, (1553), 0 states have call successors, (0), 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 10:28:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1553 transitions. [2024-11-08 10:28:37,606 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1553 transitions. Word has length 119 [2024-11-08 10:28:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:37,607 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1553 transitions. [2024-11-08 10:28:37,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 10:28:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1553 transitions. [2024-11-08 10:28:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 10:28:37,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:37,611 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:37,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:28:37,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:37,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2038016010, now seen corresponding path program 1 times [2024-11-08 10:28:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:37,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435962424] [2024-11-08 10:28:37,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:37,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:37,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:37,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435962424] [2024-11-08 10:28:37,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435962424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:37,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:37,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:37,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747130090] [2024-11-08 10:28:37,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:37,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:37,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:37,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:37,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:37,817 INFO L87 Difference]: Start difference. First operand 1159 states and 1553 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:38,271 INFO L93 Difference]: Finished difference Result 2877 states and 3826 transitions. [2024-11-08 10:28:38,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:38,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2024-11-08 10:28:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:38,278 INFO L225 Difference]: With dead ends: 2877 [2024-11-08 10:28:38,278 INFO L226 Difference]: Without dead ends: 1720 [2024-11-08 10:28:38,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:38,283 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 139 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:38,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 230 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:28:38,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-11-08 10:28:38,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1719. [2024-11-08 10:28:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1718 states have (on average 1.229918509895227) internal successors, (2113), 1718 states have internal predecessors, (2113), 0 states have call successors, (0), 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 10:28:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2113 transitions. [2024-11-08 10:28:38,319 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2113 transitions. Word has length 127 [2024-11-08 10:28:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:38,320 INFO L471 AbstractCegarLoop]: Abstraction has 1719 states and 2113 transitions. [2024-11-08 10:28:38,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2113 transitions. [2024-11-08 10:28:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 10:28:38,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:38,323 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:38,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:28:38,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:38,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:38,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2097771569, now seen corresponding path program 1 times [2024-11-08 10:28:38,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:38,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601263749] [2024-11-08 10:28:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 10:28:38,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:38,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601263749] [2024-11-08 10:28:38,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601263749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:38,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:38,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529211723] [2024-11-08 10:28:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:38,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:38,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:38,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:38,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:38,438 INFO L87 Difference]: Start difference. First operand 1719 states and 2113 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 10:28:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:38,679 INFO L93 Difference]: Finished difference Result 3422 states and 4207 transitions. [2024-11-08 10:28:38,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:38,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 129 [2024-11-08 10:28:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:38,686 INFO L225 Difference]: With dead ends: 3422 [2024-11-08 10:28:38,686 INFO L226 Difference]: Without dead ends: 1705 [2024-11-08 10:28:38,689 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 10:28:38,692 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:38,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 22 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:28:38,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2024-11-08 10:28:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1705. [2024-11-08 10:28:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1704 states have (on average 1.1713615023474178) internal successors, (1996), 1704 states have internal predecessors, (1996), 0 states have call successors, (0), 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 10:28:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 1996 transitions. [2024-11-08 10:28:38,744 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 1996 transitions. Word has length 129 [2024-11-08 10:28:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:38,745 INFO L471 AbstractCegarLoop]: Abstraction has 1705 states and 1996 transitions. [2024-11-08 10:28:38,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 10:28:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 1996 transitions. [2024-11-08 10:28:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 10:28:38,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:38,749 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:38,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:28:38,749 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:38,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:38,750 INFO L85 PathProgramCache]: Analyzing trace with hash 800107746, now seen corresponding path program 1 times [2024-11-08 10:28:38,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:38,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058439431] [2024-11-08 10:28:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:38,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 10:28:39,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:39,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058439431] [2024-11-08 10:28:39,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058439431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:39,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:39,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:28:39,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242462583] [2024-11-08 10:28:39,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:39,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:28:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:39,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:28:39,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:28:39,067 INFO L87 Difference]: Start difference. First operand 1705 states and 1996 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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 10:28:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:39,890 INFO L93 Difference]: Finished difference Result 3828 states and 4485 transitions. [2024-11-08 10:28:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:28:39,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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 156 [2024-11-08 10:28:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:39,902 INFO L225 Difference]: With dead ends: 3828 [2024-11-08 10:28:39,902 INFO L226 Difference]: Without dead ends: 2265 [2024-11-08 10:28:39,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:28:39,907 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 341 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:39,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 112 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:28:39,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2024-11-08 10:28:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 1845. [2024-11-08 10:28:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1845 states, 1844 states have (on average 1.161062906724512) internal successors, (2141), 1844 states have internal predecessors, (2141), 0 states have call successors, (0), 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 10:28:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2141 transitions. [2024-11-08 10:28:39,952 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2141 transitions. Word has length 156 [2024-11-08 10:28:39,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:39,954 INFO L471 AbstractCegarLoop]: Abstraction has 1845 states and 2141 transitions. [2024-11-08 10:28:39,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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 10:28:39,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2141 transitions. [2024-11-08 10:28:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 10:28:39,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:39,958 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:39,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:28:39,959 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:39,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:39,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1286803197, now seen corresponding path program 1 times [2024-11-08 10:28:39,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:39,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487532558] [2024-11-08 10:28:39,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 10:28:40,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:40,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487532558] [2024-11-08 10:28:40,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487532558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:40,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:40,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:40,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960717973] [2024-11-08 10:28:40,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:40,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:40,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:40,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:40,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:40,110 INFO L87 Difference]: Start difference. First operand 1845 states and 2141 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 10:28:40,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:40,510 INFO L93 Difference]: Finished difference Result 3540 states and 4116 transitions. [2024-11-08 10:28:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:40,510 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 159 [2024-11-08 10:28:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:40,511 INFO L225 Difference]: With dead ends: 3540 [2024-11-08 10:28:40,511 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:28:40,514 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 10:28:40,515 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 139 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:40,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 28 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:28:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:28:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:28:40,516 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 10:28:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:28:40,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2024-11-08 10:28:40,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:40,517 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:28:40,517 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 10:28:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:28:40,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:28:40,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:28:40,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:28:40,524 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:40,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:28:40,651 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:28:40,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:28:40 BoogieIcfgContainer [2024-11-08 10:28:40,673 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:28:40,674 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:28:40,674 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:28:40,674 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:28:40,674 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:34" (3/4) ... [2024-11-08 10:28:40,677 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:28:40,698 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:28:40,700 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:28:40,701 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:28:40,702 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:28:40,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:28:40,848 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:28:40,848 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:28:40,849 INFO L158 Benchmark]: Toolchain (without parser) took 8464.40ms. Allocated memory was 157.3MB in the beginning and 257.9MB in the end (delta: 100.7MB). Free memory was 109.7MB in the beginning and 148.8MB in the end (delta: -39.0MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2024-11-08 10:28:40,849 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 100.7MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:28:40,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.93ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 81.3MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 10:28:40,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.07ms. Allocated memory is still 157.3MB. Free memory was 81.0MB in the beginning and 75.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:28:40,850 INFO L158 Benchmark]: Boogie Preprocessor took 126.93ms. Allocated memory is still 157.3MB. Free memory was 75.6MB in the beginning and 69.9MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:28:40,851 INFO L158 Benchmark]: RCFGBuilder took 1314.67ms. Allocated memory is still 157.3MB. Free memory was 69.9MB in the beginning and 120.6MB in the end (delta: -50.7MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-08 10:28:40,851 INFO L158 Benchmark]: TraceAbstraction took 6199.59ms. Allocated memory was 157.3MB in the beginning and 257.9MB in the end (delta: 100.7MB). Free memory was 120.6MB in the beginning and 161.4MB in the end (delta: -40.7MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2024-11-08 10:28:40,852 INFO L158 Benchmark]: Witness Printer took 174.44ms. Allocated memory is still 257.9MB. Free memory was 161.4MB in the beginning and 148.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:28:40,854 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.12ms. Allocated memory is still 100.7MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.93ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 81.3MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.07ms. Allocated memory is still 157.3MB. Free memory was 81.0MB in the beginning and 75.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 126.93ms. Allocated memory is still 157.3MB. Free memory was 75.6MB in the beginning and 69.9MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1314.67ms. Allocated memory is still 157.3MB. Free memory was 69.9MB in the beginning and 120.6MB in the end (delta: -50.7MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6199.59ms. Allocated memory was 157.3MB in the beginning and 257.9MB in the end (delta: 100.7MB). Free memory was 120.6MB in the beginning and 161.4MB in the end (delta: -40.7MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. * Witness Printer took 174.44ms. Allocated memory is still 257.9MB. Free memory was 161.4MB in the beginning and 148.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 455]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1269 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1269 mSDsluCounter, 696 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 493 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2993 IncrementalHoareTripleChecker+Invalid, 3486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 493 mSolverCounterUnsat, 568 mSDtfsCounter, 2993 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1845occurred in iteration=6, InterpolantAutomatonStates: 23, 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, 7 MinimizatonAttempts, 426 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 890 NumberOfCodeBlocks, 890 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 883 ConstructedInterpolants, 0 QuantifiedInterpolants, 1724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 337/337 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: 616]: Loop Invariant Derived loop invariant: (((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1)) || ((a17 <= 8) && (a28 <= 10))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:28:40,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE