./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label34.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label34.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 550f3a62df7d5eada5d2aa8dd32299382207e40f85198cb35440276faa9cf7d3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:47:35,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:47:35,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:47:35,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:47:35,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:47:35,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:47:35,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:47:35,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:47:35,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:47:35,269 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:47:35,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:47:35,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:47:35,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:47:35,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:47:35,273 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:47:35,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:47:35,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:47:35,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:47:35,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:47:35,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:47:35,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:47:35,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:47:35,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:47:35,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:47:35,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:47:35,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:47:35,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:47:35,290 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:47:35,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:47:35,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:47:35,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:47:35,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:47:35,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:47:35,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:47:35,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:47:35,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:47:35,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:47:35,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:47:35,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:47:35,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:47:35,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:47:35,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:47:35,296 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 -> 550f3a62df7d5eada5d2aa8dd32299382207e40f85198cb35440276faa9cf7d3 [2024-11-11 16:47:35,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:47:35,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:47:35,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:47:35,582 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:47:35,582 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:47:35,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label34.c [2024-11-11 16:47:36,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:47:37,242 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:47:37,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label34.c [2024-11-11 16:47:37,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b194367/78dbb3a38fcb440caf12512d94a2c9b4/FLAG980953640 [2024-11-11 16:47:37,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b194367/78dbb3a38fcb440caf12512d94a2c9b4 [2024-11-11 16:47:37,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:47:37,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:47:37,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:47:37,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:47:37,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:47:37,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:37,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4d6786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37, skipping insertion in model container [2024-11-11 16:47:37,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:37,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:47:37,589 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_label34.c[7166,7179] [2024-11-11 16:47:37,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:47:37,734 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:47:37,772 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_label34.c[7166,7179] [2024-11-11 16:47:37,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:47:37,868 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:47:37,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37 WrapperNode [2024-11-11 16:47:37,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:47:37,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:47:37,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:47:37,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:47:37,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:37,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:37,966 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-11 16:47:37,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:47:37,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:47:37,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:47:37,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:47:37,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:37,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:37,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:38,021 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:47:38,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:38,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:38,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:38,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:38,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:38,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:38,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:47:38,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:47:38,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:47:38,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:47:38,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (1/1) ... [2024-11-11 16:47:38,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:47:38,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:38,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:47:38,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:47:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:47:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:47:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:47:38,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:47:38,246 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:47:38,248 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:47:39,390 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-11 16:47:39,390 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:47:39,411 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:47:39,413 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:47:39,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:47:39 BoogieIcfgContainer [2024-11-11 16:47:39,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:47:39,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:47:39,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:47:39,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:47:39,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:47:37" (1/3) ... [2024-11-11 16:47:39,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4cc20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:47:39, skipping insertion in model container [2024-11-11 16:47:39,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:37" (2/3) ... [2024-11-11 16:47:39,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4cc20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:47:39, skipping insertion in model container [2024-11-11 16:47:39,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:47:39" (3/3) ... [2024-11-11 16:47:39,424 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label34.c [2024-11-11 16:47:39,441 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:47:39,442 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:47:39,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:47:39,516 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;@4b734f4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:47:39,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:47:39,521 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-11 16:47:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 16:47:39,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:39,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:39,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:39,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:39,542 INFO L85 PathProgramCache]: Analyzing trace with hash -696204111, now seen corresponding path program 1 times [2024-11-11 16:47:39,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:39,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910779117] [2024-11-11 16:47:39,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:39,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:39,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:39,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910779117] [2024-11-11 16:47:39,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910779117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:39,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:39,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:47:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882070302] [2024-11-11 16:47:39,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:39,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:39,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:39,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:39,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:39,950 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 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:40,813 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-11 16:47:40,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:40,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 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 63 [2024-11-11 16:47:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:40,831 INFO L225 Difference]: With dead ends: 552 [2024-11-11 16:47:40,831 INFO L226 Difference]: Without dead ends: 282 [2024-11-11 16:47:40,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:40,843 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 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.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:40,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:47:40,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-11 16:47:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-11 16:47:40,893 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-11 16:47:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2024-11-11 16:47:40,896 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 63 [2024-11-11 16:47:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:40,896 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2024-11-11 16:47:40,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2024-11-11 16:47:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 16:47:40,900 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:40,900 INFO L218 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:40,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:47:40,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:40,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:40,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1562755460, now seen corresponding path program 1 times [2024-11-11 16:47:40,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:40,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127492394] [2024-11-11 16:47:40,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:40,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:41,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:41,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127492394] [2024-11-11 16:47:41,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127492394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:41,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:41,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:47:41,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182770633] [2024-11-11 16:47:41,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:41,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:41,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:41,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:41,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:41,175 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:41,683 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2024-11-11 16:47:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:41,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-11 16:47:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:41,688 INFO L225 Difference]: With dead ends: 701 [2024-11-11 16:47:41,688 INFO L226 Difference]: Without dead ends: 421 [2024-11-11 16:47:41,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:41,692 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 83 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 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.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:41,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:41,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-11 16:47:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-11 16:47:41,715 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-11 16:47:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2024-11-11 16:47:41,716 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 129 [2024-11-11 16:47:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:41,717 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2024-11-11 16:47:41,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2024-11-11 16:47:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-11 16:47:41,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:41,720 INFO L218 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:41,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:47:41,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:41,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:41,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1045343629, now seen corresponding path program 1 times [2024-11-11 16:47:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:41,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146987549] [2024-11-11 16:47:41,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:41,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:42,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:42,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146987549] [2024-11-11 16:47:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146987549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:42,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:42,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:47:42,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492945058] [2024-11-11 16:47:42,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:42,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:42,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:42,053 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:42,479 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2024-11-11 16:47:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:42,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2024-11-11 16:47:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:42,482 INFO L225 Difference]: With dead ends: 979 [2024-11-11 16:47:42,486 INFO L226 Difference]: Without dead ends: 560 [2024-11-11 16:47:42,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:42,488 INFO L435 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-11 16:47:42,488 INFO L436 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-11 16:47:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-11 16:47:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-11 16:47:42,509 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-11 16:47:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2024-11-11 16:47:42,510 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 136 [2024-11-11 16:47:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:42,511 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2024-11-11 16:47:42,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2024-11-11 16:47:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-11 16:47:42,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:42,514 INFO L218 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:42,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:47:42,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:42,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:42,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1197108312, now seen corresponding path program 1 times [2024-11-11 16:47:42,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:42,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780381126] [2024-11-11 16:47:42,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:42,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:42,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780381126] [2024-11-11 16:47:42,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780381126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:42,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:42,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 16:47:42,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071709261] [2024-11-11 16:47:42,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:42,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 16:47:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:42,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 16:47:42,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:47:42,877 INFO L87 Difference]: Start difference. First operand 560 states and 675 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:43,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:43,367 INFO L93 Difference]: Finished difference Result 1034 states and 1254 transitions. [2024-11-11 16:47:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 16:47:43,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 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 138 [2024-11-11 16:47:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:43,372 INFO L225 Difference]: With dead ends: 1034 [2024-11-11 16:47:43,372 INFO L226 Difference]: Without dead ends: 560 [2024-11-11 16:47:43,373 INFO L434 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-11 16:47:43,374 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:43,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-11 16:47:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-11 16:47:43,385 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-11 16:47:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 672 transitions. [2024-11-11 16:47:43,386 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 672 transitions. Word has length 138 [2024-11-11 16:47:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:43,387 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 672 transitions. [2024-11-11 16:47:43,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 672 transitions. [2024-11-11 16:47:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-11 16:47:43,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:43,389 INFO L218 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, 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] [2024-11-11 16:47:43,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:47:43,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:43,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1693346688, now seen corresponding path program 1 times [2024-11-11 16:47:43,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:43,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293014506] [2024-11-11 16:47:43,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:43,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:43,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:43,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293014506] [2024-11-11 16:47:43,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293014506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:43,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:43,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:47:43,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761484451] [2024-11-11 16:47:43,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:43,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:43,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:43,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:43,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:43,514 INFO L87 Difference]: Start difference. First operand 560 states and 672 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:44,012 INFO L93 Difference]: Finished difference Result 1257 states and 1566 transitions. [2024-11-11 16:47:44,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:44,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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 154 [2024-11-11 16:47:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:44,016 INFO L225 Difference]: With dead ends: 1257 [2024-11-11 16:47:44,016 INFO L226 Difference]: Without dead ends: 838 [2024-11-11 16:47:44,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:44,020 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:44,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-11 16:47:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-11 16:47:44,039 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-11 16:47:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1004 transitions. [2024-11-11 16:47:44,042 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1004 transitions. Word has length 154 [2024-11-11 16:47:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:44,043 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1004 transitions. [2024-11-11 16:47:44,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1004 transitions. [2024-11-11 16:47:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-11 16:47:44,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:44,047 INFO L218 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, 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] [2024-11-11 16:47:44,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:47:44,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:44,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:44,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1887789682, now seen corresponding path program 1 times [2024-11-11 16:47:44,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:44,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851444308] [2024-11-11 16:47:44,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:44,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:44,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851444308] [2024-11-11 16:47:44,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851444308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:44,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:44,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:47:44,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471104094] [2024-11-11 16:47:44,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:44,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:44,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:44,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:44,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:44,234 INFO L87 Difference]: Start difference. First operand 838 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:44,701 INFO L93 Difference]: Finished difference Result 1674 states and 2052 transitions. [2024-11-11 16:47:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:44,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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 174 [2024-11-11 16:47:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:44,705 INFO L225 Difference]: With dead ends: 1674 [2024-11-11 16:47:44,705 INFO L226 Difference]: Without dead ends: 977 [2024-11-11 16:47:44,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:44,707 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 92 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 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.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:44,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 190 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-11 16:47:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-11 16:47:44,721 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-11 16:47:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1118 transitions. [2024-11-11 16:47:44,727 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1118 transitions. Word has length 174 [2024-11-11 16:47:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:44,727 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1118 transitions. [2024-11-11 16:47:44,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1118 transitions. [2024-11-11 16:47:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-11 16:47:44,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:44,731 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11 16:47:44,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:47:44,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:44,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2078202414, now seen corresponding path program 1 times [2024-11-11 16:47:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:44,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201160911] [2024-11-11 16:47:44,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:44,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-11 16:47:45,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:45,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201160911] [2024-11-11 16:47:45,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201160911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:47:45,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214990492] [2024-11-11 16:47:45,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:45,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:45,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:45,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:47:45,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:47:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:45,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:47:45,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:47:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-11-11 16:47:45,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:47:45,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214990492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:45,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:47:45,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-11 16:47:45,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948880732] [2024-11-11 16:47:45,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:45,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:45,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:45,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:45,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:47:45,573 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-11 16:47:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:46,001 INFO L93 Difference]: Finished difference Result 1535 states and 1759 transitions. [2024-11-11 16:47:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:46,001 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 247 [2024-11-11 16:47:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:46,006 INFO L225 Difference]: With dead ends: 1535 [2024-11-11 16:47:46,006 INFO L226 Difference]: Without dead ends: 1533 [2024-11-11 16:47:46,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 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-11 16:47:46,007 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:46,007 INFO L436 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-11 16:47:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-11-11 16:47:46,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1116. [2024-11-11 16:47:46,025 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-11 16:47:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1306 transitions. [2024-11-11 16:47:46,028 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1306 transitions. Word has length 247 [2024-11-11 16:47:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:46,029 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1306 transitions. [2024-11-11 16:47:46,029 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-11 16:47:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1306 transitions. [2024-11-11 16:47:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-11-11 16:47:46,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:46,033 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11 16:47:46,053 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-11 16:47:46,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:46,235 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:46,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1601492366, now seen corresponding path program 1 times [2024-11-11 16:47:46,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:46,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427828456] [2024-11-11 16:47:46,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:46,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 61 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:46,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:46,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427828456] [2024-11-11 16:47:46,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427828456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:47:46,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109845213] [2024-11-11 16:47:46,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:46,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:46,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:46,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:47:46,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:47:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:47,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:47:47,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:47:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-11 16:47:47,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:47:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109845213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:47,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:47:47,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-11 16:47:47,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416271484] [2024-11-11 16:47:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:47,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:47,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:47,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:47:47,106 INFO L87 Difference]: Start difference. First operand 1116 states and 1306 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:47,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:47,555 INFO L93 Difference]: Finished difference Result 2369 states and 2844 transitions. [2024-11-11 16:47:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:47,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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 311 [2024-11-11 16:47:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:47,560 INFO L225 Difference]: With dead ends: 2369 [2024-11-11 16:47:47,560 INFO L226 Difference]: Without dead ends: 1394 [2024-11-11 16:47:47,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 311 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-11 16:47:47,562 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 79 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 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.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:47,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 225 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-11 16:47:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2024-11-11 16:47:47,581 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-11 16:47:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1460 transitions. [2024-11-11 16:47:47,584 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1460 transitions. Word has length 311 [2024-11-11 16:47:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:47,584 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1460 transitions. [2024-11-11 16:47:47,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1460 transitions. [2024-11-11 16:47:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-11-11 16:47:47,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:47,591 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-11 16:47:47,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 16:47:47,793 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-11 16:47:47,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:47,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:47,794 INFO L85 PathProgramCache]: Analyzing trace with hash -554731653, now seen corresponding path program 1 times [2024-11-11 16:47:47,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:47,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555097980] [2024-11-11 16:47:47,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:47,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 86 proven. 96 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-11 16:47:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555097980] [2024-11-11 16:47:48,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555097980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:47:48,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264746981] [2024-11-11 16:47:48,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:48,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:48,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:48,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:47:48,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 16:47:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:48,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:47:48,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:47:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-11 16:47:48,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:47:48,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264746981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:48,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:47:48,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 16:47:48,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472611462] [2024-11-11 16:47:48,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:48,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:48,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:48,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:48,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:47:48,523 INFO L87 Difference]: Start difference. First operand 1255 states and 1460 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:49,006 INFO L93 Difference]: Finished difference Result 2645 states and 3076 transitions. [2024-11-11 16:47:49,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:49,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 362 [2024-11-11 16:47:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:49,008 INFO L225 Difference]: With dead ends: 2645 [2024-11-11 16:47:49,008 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:47:49,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:47:49,011 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 79 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:49,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 222 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:49,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:47:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:47:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:47:49,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 362 [2024-11-11 16:47:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:49,014 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:47:49,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:47:49,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:47:49,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:47:49,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 16:47:49,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:49,222 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:49,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:47:49,361 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:47:49,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:47:49 BoogieIcfgContainer [2024-11-11 16:47:49,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:47:49,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:47:49,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:47:49,386 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:47:49,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:47:39" (3/4) ... [2024-11-11 16:47:49,389 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:47:49,413 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:47:49,414 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:47:49,414 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:47:49,415 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:47:49,588 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:47:49,589 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:47:49,589 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:47:49,589 INFO L158 Benchmark]: Toolchain (without parser) took 12302.19ms. Allocated memory was 176.2MB in the beginning and 377.5MB in the end (delta: 201.3MB). Free memory was 119.2MB in the beginning and 288.5MB in the end (delta: -169.3MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-11-11 16:47:49,590 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:47:49,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.39ms. Allocated memory is still 176.2MB. Free memory was 118.8MB in the beginning and 88.7MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-11 16:47:49,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.50ms. Allocated memory is still 176.2MB. Free memory was 88.7MB in the beginning and 80.7MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 16:47:49,590 INFO L158 Benchmark]: Boogie Preprocessor took 117.78ms. Allocated memory is still 176.2MB. Free memory was 80.3MB in the beginning and 70.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 16:47:49,591 INFO L158 Benchmark]: RCFGBuilder took 1328.13ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 70.2MB in the beginning and 154.5MB in the end (delta: -84.3MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2024-11-11 16:47:49,591 INFO L158 Benchmark]: TraceAbstraction took 9969.09ms. Allocated memory was 260.0MB in the beginning and 377.5MB in the end (delta: 117.4MB). Free memory was 153.4MB in the beginning and 300.0MB in the end (delta: -146.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:47:49,592 INFO L158 Benchmark]: Witness Printer took 203.50ms. Allocated memory is still 377.5MB. Free memory was 300.0MB in the beginning and 288.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 16:47:49,593 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.19ms. Allocated memory is still 176.2MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 580.39ms. Allocated memory is still 176.2MB. Free memory was 118.8MB in the beginning and 88.7MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.50ms. Allocated memory is still 176.2MB. Free memory was 88.7MB in the beginning and 80.7MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.78ms. Allocated memory is still 176.2MB. Free memory was 80.3MB in the beginning and 70.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1328.13ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 70.2MB in the beginning and 154.5MB in the end (delta: -84.3MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9969.09ms. Allocated memory was 260.0MB in the beginning and 377.5MB in the end (delta: 117.4MB). Free memory was 153.4MB in the beginning and 300.0MB in the end (delta: -146.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 203.50ms. Allocated memory is still 377.5MB. Free memory was 300.0MB in the beginning and 288.5MB 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: 203]: 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: 9.7s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 798 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 798 mSDsluCounter, 1116 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 528 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3593 IncrementalHoareTripleChecker+Invalid, 4121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 528 mSolverCounterUnsat, 1066 mSDtfsCounter, 3593 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 947 GetRequests, 926 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 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.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2634 NumberOfCodeBlocks, 2634 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2622 ConstructedInterpolants, 0 QuantifiedInterpolants, 9861 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1248 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 1706/2022 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 <= 6) && (14 == a4)) && (a12 == 0)) || (((a19 == 9) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (4 <= a10)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:47:49,620 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