./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label55.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 8e1a5ec7c69529be2d8c0f142d6c458fe9f526e0a4b1c8c2c339cb2c1b253dd3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:53:28,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:53:28,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:53:28,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:53:28,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:53:28,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:53:28,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:53:28,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:53:28,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:53:28,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:53:28,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:53:28,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:53:28,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:53:28,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:53:28,436 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:53:28,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:53:28,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:53:28,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:53:28,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:53:28,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:53:28,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:53:28,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:53:28,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:53:28,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:53:28,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:53:28,439 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:53:28,439 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:53:28,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:53:28,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:53:28,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:53:28,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:53:28,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:53:28,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:53:28,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:53:28,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:53:28,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:53:28,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:53:28,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:53:28,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:53:28,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:53:28,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:53:28,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:53:28,446 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 -> 8e1a5ec7c69529be2d8c0f142d6c458fe9f526e0a4b1c8c2c339cb2c1b253dd3 [2024-10-13 23:53:28,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:53:28,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:53:28,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:53:28,747 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:53:28,747 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:53:28,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label55.c [2024-10-13 23:53:30,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:53:30,593 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:53:30,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label55.c [2024-10-13 23:53:30,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9bd72b5/97ddc8c7e7a44465a5aaffeb3d4e4e64/FLAG94a35e7d7 [2024-10-13 23:53:30,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9bd72b5/97ddc8c7e7a44465a5aaffeb3d4e4e64 [2024-10-13 23:53:30,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:53:30,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:53:30,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:53:30,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:53:30,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:53:30,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:53:30" (1/1) ... [2024-10-13 23:53:30,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59680859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:30, skipping insertion in model container [2024-10-13 23:53:30,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:53:30" (1/1) ... [2024-10-13 23:53:30,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:53:30,990 WARN L248 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/Problem16_label55.c[5995,6008] [2024-10-13 23:53:31,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:53:31,366 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:53:31,394 WARN L248 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/Problem16_label55.c[5995,6008] [2024-10-13 23:53:31,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:53:31,650 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:53:31,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31 WrapperNode [2024-10-13 23:53:31,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:53:31,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:53:31,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:53:31,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:53:31,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (1/1) ... [2024-10-13 23:53:31,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (1/1) ... [2024-10-13 23:53:31,838 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-13 23:53:31,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:53:31,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:53:31,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:53:31,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:53:31,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (1/1) ... [2024-10-13 23:53:31,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (1/1) ... [2024-10-13 23:53:31,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (1/1) ... [2024-10-13 23:53:31,930 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-10-13 23:53:31,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (1/1) ... [2024-10-13 23:53:31,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (1/1) ... [2024-10-13 23:53:32,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (1/1) ... [2024-10-13 23:53:32,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (1/1) ... [2024-10-13 23:53:32,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (1/1) ... [2024-10-13 23:53:32,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (1/1) ... [2024-10-13 23:53:32,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:53:32,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:53:32,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:53:32,083 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:53:32,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (1/1) ... [2024-10-13 23:53:32,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:53:32,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:53:32,122 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-10-13 23:53:32,128 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-10-13 23:53:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:53:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:53:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:53:32,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:53:32,266 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:53:32,268 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:53:34,434 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-13 23:53:34,435 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:53:34,493 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:53:34,494 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:53:34,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:53:34 BoogieIcfgContainer [2024-10-13 23:53:34,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:53:34,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:53:34,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:53:34,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:53:34,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:53:30" (1/3) ... [2024-10-13 23:53:34,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad9739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:53:34, skipping insertion in model container [2024-10-13 23:53:34,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:31" (2/3) ... [2024-10-13 23:53:34,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad9739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:53:34, skipping insertion in model container [2024-10-13 23:53:34,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:53:34" (3/3) ... [2024-10-13 23:53:34,506 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label55.c [2024-10-13 23:53:34,525 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:53:34,525 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:53:34,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:53:34,626 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;@7266a05c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:53:34,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:53:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 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-10-13 23:53:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 23:53:34,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:34,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:53:34,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:34,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:34,651 INFO L85 PathProgramCache]: Analyzing trace with hash 823800410, now seen corresponding path program 1 times [2024-10-13 23:53:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:34,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528474512] [2024-10-13 23:53:34,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:34,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:34,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528474512] [2024-10-13 23:53:34,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528474512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:34,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:34,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:53:34,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788804018] [2024-10-13 23:53:34,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:34,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:53:34,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:34,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:53:34,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:53:34,919 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 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 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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-10-13 23:53:34,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:34,990 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-13 23:53:34,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:53:34,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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 56 [2024-10-13 23:53:34,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:35,004 INFO L225 Difference]: With dead ends: 667 [2024-10-13 23:53:35,004 INFO L226 Difference]: Without dead ends: 332 [2024-10-13 23:53:35,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:53:35,013 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:35,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:53:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-13 23:53:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-13 23:53:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 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-10-13 23:53:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-13 23:53:35,065 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 56 [2024-10-13 23:53:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:35,065 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-13 23:53:35,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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-10-13 23:53:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-13 23:53:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 23:53:35,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:35,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:53:35,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:53:35,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:35,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1707648021, now seen corresponding path program 1 times [2024-10-13 23:53:35,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:35,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635211338] [2024-10-13 23:53:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:35,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:35,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635211338] [2024-10-13 23:53:35,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635211338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:35,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:35,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:53:35,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751490562] [2024-10-13 23:53:35,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:35,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:35,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:35,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:35,355 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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-10-13 23:53:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:36,803 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-13 23:53:36,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:36,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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 56 [2024-10-13 23:53:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:36,807 INFO L225 Difference]: With dead ends: 992 [2024-10-13 23:53:36,807 INFO L226 Difference]: Without dead ends: 661 [2024-10-13 23:53:36,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:36,812 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 314 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:36,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 199 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:53:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-13 23:53:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-13 23:53:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5196969696969698) internal successors, (1003), 660 states have internal predecessors, (1003), 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-10-13 23:53:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1003 transitions. [2024-10-13 23:53:36,846 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1003 transitions. Word has length 56 [2024-10-13 23:53:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:36,846 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1003 transitions. [2024-10-13 23:53:36,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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-10-13 23:53:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1003 transitions. [2024-10-13 23:53:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 23:53:36,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:36,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:53:36,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:53:36,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:36,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:36,851 INFO L85 PathProgramCache]: Analyzing trace with hash -827139718, now seen corresponding path program 1 times [2024-10-13 23:53:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564734435] [2024-10-13 23:53:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:37,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:37,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564734435] [2024-10-13 23:53:37,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564734435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:37,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:37,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:53:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260481088] [2024-10-13 23:53:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:37,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:37,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:37,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:37,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:37,155 INFO L87 Difference]: Start difference. First operand 661 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-10-13 23:53:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:38,580 INFO L93 Difference]: Finished difference Result 1979 states and 3006 transitions. [2024-10-13 23:53:38,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:38,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2024-10-13 23:53:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:38,586 INFO L225 Difference]: With dead ends: 1979 [2024-10-13 23:53:38,586 INFO L226 Difference]: Without dead ends: 1319 [2024-10-13 23:53:38,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:38,589 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 269 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:38,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 214 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:53:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-13 23:53:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-13 23:53:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.456752655538695) internal successors, (1920), 1318 states have internal predecessors, (1920), 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-10-13 23:53:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1920 transitions. [2024-10-13 23:53:38,627 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1920 transitions. Word has length 124 [2024-10-13 23:53:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:38,628 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1920 transitions. [2024-10-13 23:53:38,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-10-13 23:53:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1920 transitions. [2024-10-13 23:53:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 23:53:38,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:38,631 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-10-13 23:53:38,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:53:38,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:38,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:38,632 INFO L85 PathProgramCache]: Analyzing trace with hash -621913189, now seen corresponding path program 1 times [2024-10-13 23:53:38,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:38,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901501624] [2024-10-13 23:53:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:38,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:38,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901501624] [2024-10-13 23:53:38,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901501624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:38,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:38,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:53:38,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015181593] [2024-10-13 23:53:38,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:38,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:38,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:38,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:38,815 INFO L87 Difference]: Start difference. First operand 1319 states and 1920 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:40,201 INFO L93 Difference]: Finished difference Result 3953 states and 5757 transitions. [2024-10-13 23:53:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:40,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2024-10-13 23:53:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:40,213 INFO L225 Difference]: With dead ends: 3953 [2024-10-13 23:53:40,213 INFO L226 Difference]: Without dead ends: 2635 [2024-10-13 23:53:40,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:40,216 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 369 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:40,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 153 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:53:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-13 23:53:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2024-10-13 23:53:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.3249810174639332) internal successors, (3490), 2634 states have internal predecessors, (3490), 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-10-13 23:53:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3490 transitions. [2024-10-13 23:53:40,275 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3490 transitions. Word has length 135 [2024-10-13 23:53:40,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:40,277 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3490 transitions. [2024-10-13 23:53:40,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3490 transitions. [2024-10-13 23:53:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-13 23:53:40,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:40,284 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:53:40,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:53:40,284 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:40,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:40,285 INFO L85 PathProgramCache]: Analyzing trace with hash 880984157, now seen corresponding path program 1 times [2024-10-13 23:53:40,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:40,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888357182] [2024-10-13 23:53:40,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:40,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:40,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:40,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888357182] [2024-10-13 23:53:40,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888357182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:40,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:40,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:53:40,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914772205] [2024-10-13 23:53:40,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:40,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:40,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:40,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:40,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:40,474 INFO L87 Difference]: Start difference. First operand 2635 states and 3490 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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-10-13 23:53:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:41,788 INFO L93 Difference]: Finished difference Result 6585 states and 8549 transitions. [2024-10-13 23:53:41,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:41,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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 187 [2024-10-13 23:53:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:41,802 INFO L225 Difference]: With dead ends: 6585 [2024-10-13 23:53:41,803 INFO L226 Difference]: Without dead ends: 3951 [2024-10-13 23:53:41,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:41,809 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:41,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 81 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:53:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-13 23:53:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-13 23:53:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.2172151898734178) internal successors, (4808), 3950 states have internal predecessors, (4808), 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-10-13 23:53:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4808 transitions. [2024-10-13 23:53:41,881 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4808 transitions. Word has length 187 [2024-10-13 23:53:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:41,882 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4808 transitions. [2024-10-13 23:53:41,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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-10-13 23:53:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4808 transitions. [2024-10-13 23:53:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-13 23:53:41,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:41,889 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:53:41,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:53:41,890 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:41,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:41,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1536825825, now seen corresponding path program 1 times [2024-10-13 23:53:41,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:41,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122836353] [2024-10-13 23:53:41,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:41,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:42,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:42,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122836353] [2024-10-13 23:53:42,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122836353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:42,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:42,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:53:42,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653049545] [2024-10-13 23:53:42,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:42,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:42,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:42,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:42,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:42,166 INFO L87 Difference]: Start difference. First operand 3951 states and 4808 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-10-13 23:53:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:43,495 INFO L93 Difference]: Finished difference Result 9546 states and 11835 transitions. [2024-10-13 23:53:43,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:43,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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 291 [2024-10-13 23:53:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:43,517 INFO L225 Difference]: With dead ends: 9546 [2024-10-13 23:53:43,518 INFO L226 Difference]: Without dead ends: 5596 [2024-10-13 23:53:43,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:43,527 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 275 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:43,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 592 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:53:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2024-10-13 23:53:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2024-10-13 23:53:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.1801608579088472) internal successors, (6603), 5595 states have internal predecessors, (6603), 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-10-13 23:53:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 6603 transitions. [2024-10-13 23:53:43,621 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 6603 transitions. Word has length 291 [2024-10-13 23:53:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:43,622 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 6603 transitions. [2024-10-13 23:53:43,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-10-13 23:53:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 6603 transitions. [2024-10-13 23:53:43,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-10-13 23:53:43,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:43,626 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:53:43,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:53:43,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:43,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:43,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1247512294, now seen corresponding path program 1 times [2024-10-13 23:53:43,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:43,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120420387] [2024-10-13 23:53:43,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:44,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:44,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120420387] [2024-10-13 23:53:44,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120420387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:44,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:44,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:53:44,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862845445] [2024-10-13 23:53:44,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:44,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:53:44,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:44,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:53:44,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:53:44,172 INFO L87 Difference]: Start difference. First operand 5596 states and 6603 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 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-10-13 23:53:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:45,493 INFO L93 Difference]: Finished difference Result 11520 states and 13546 transitions. [2024-10-13 23:53:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:53:45,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 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 301 [2024-10-13 23:53:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:45,515 INFO L225 Difference]: With dead ends: 11520 [2024-10-13 23:53:45,516 INFO L226 Difference]: Without dead ends: 5925 [2024-10-13 23:53:45,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:53:45,524 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 127 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:45,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 318 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:53:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5925 states. [2024-10-13 23:53:45,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5925 to 5925. [2024-10-13 23:53:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5925 states, 5924 states have (on average 1.1711681296421337) internal successors, (6938), 5924 states have internal predecessors, (6938), 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-10-13 23:53:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 6938 transitions. [2024-10-13 23:53:45,612 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 6938 transitions. Word has length 301 [2024-10-13 23:53:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:45,613 INFO L471 AbstractCegarLoop]: Abstraction has 5925 states and 6938 transitions. [2024-10-13 23:53:45,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 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-10-13 23:53:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 6938 transitions. [2024-10-13 23:53:45,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-10-13 23:53:45,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:45,620 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:53:45,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:53:45,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:45,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1939379008, now seen corresponding path program 1 times [2024-10-13 23:53:45,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:45,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713638775] [2024-10-13 23:53:45,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:45,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:46,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:46,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713638775] [2024-10-13 23:53:46,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713638775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:46,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:46,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 23:53:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524878103] [2024-10-13 23:53:46,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:46,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 23:53:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:46,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 23:53:46,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:53:46,387 INFO L87 Difference]: Start difference. First operand 5925 states and 6938 transitions. Second operand has 7 states, 7 states have (on average 55.42857142857143) internal successors, (388), 6 states have internal predecessors, (388), 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-10-13 23:53:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:48,271 INFO L93 Difference]: Finished difference Result 11379 states and 13387 transitions. [2024-10-13 23:53:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 23:53:48,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 55.42857142857143) internal successors, (388), 6 states have internal predecessors, (388), 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 388 [2024-10-13 23:53:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:48,293 INFO L225 Difference]: With dead ends: 11379 [2024-10-13 23:53:48,293 INFO L226 Difference]: Without dead ends: 5596 [2024-10-13 23:53:48,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:53:48,301 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 289 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:48,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 291 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2333 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 23:53:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2024-10-13 23:53:48,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2024-10-13 23:53:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.068811438784629) internal successors, (5980), 5595 states have internal predecessors, (5980), 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-10-13 23:53:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 5980 transitions. [2024-10-13 23:53:48,387 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 5980 transitions. Word has length 388 [2024-10-13 23:53:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:48,387 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 5980 transitions. [2024-10-13 23:53:48,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.42857142857143) internal successors, (388), 6 states have internal predecessors, (388), 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-10-13 23:53:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 5980 transitions. [2024-10-13 23:53:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2024-10-13 23:53:48,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:48,399 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:53:48,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:53:48,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:48,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:48,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1026232864, now seen corresponding path program 1 times [2024-10-13 23:53:48,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:48,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972291237] [2024-10-13 23:53:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:48,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-13 23:53:48,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:48,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972291237] [2024-10-13 23:53:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972291237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:48,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:53:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282469146] [2024-10-13 23:53:48,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:48,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:48,650 INFO L87 Difference]: Start difference. First operand 5596 states and 5980 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-10-13 23:53:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:49,529 INFO L93 Difference]: Finished difference Result 12836 states and 13842 transitions. [2024-10-13 23:53:49,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:49,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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 395 [2024-10-13 23:53:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:49,550 INFO L225 Difference]: With dead ends: 12836 [2024-10-13 23:53:49,551 INFO L226 Difference]: Without dead ends: 7570 [2024-10-13 23:53:49,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:49,558 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 291 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:49,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 38 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:53:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2024-10-13 23:53:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 7570. [2024-10-13 23:53:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7570 states, 7569 states have (on average 1.0738538776588717) internal successors, (8128), 7569 states have internal predecessors, (8128), 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-10-13 23:53:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7570 states to 7570 states and 8128 transitions. [2024-10-13 23:53:49,697 INFO L78 Accepts]: Start accepts. Automaton has 7570 states and 8128 transitions. Word has length 395 [2024-10-13 23:53:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:49,698 INFO L471 AbstractCegarLoop]: Abstraction has 7570 states and 8128 transitions. [2024-10-13 23:53:49,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-10-13 23:53:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7570 states and 8128 transitions. [2024-10-13 23:53:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2024-10-13 23:53:49,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:49,706 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:53:49,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:53:49,707 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:49,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2147025625, now seen corresponding path program 1 times [2024-10-13 23:53:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:49,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968266466] [2024-10-13 23:53:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:50,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:50,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968266466] [2024-10-13 23:53:50,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968266466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:50,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:53:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152293285] [2024-10-13 23:53:50,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:50,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:53:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:50,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:53:50,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:53:50,345 INFO L87 Difference]: Start difference. First operand 7570 states and 8128 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 3 states have internal predecessors, (449), 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-10-13 23:53:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:51,267 INFO L93 Difference]: Finished difference Result 15139 states and 16258 transitions. [2024-10-13 23:53:51,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:51,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 3 states have internal predecessors, (449), 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 449 [2024-10-13 23:53:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:51,281 INFO L225 Difference]: With dead ends: 15139 [2024-10-13 23:53:51,282 INFO L226 Difference]: Without dead ends: 7899 [2024-10-13 23:53:51,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:53:51,290 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 172 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:51,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 116 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:53:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7899 states. [2024-10-13 23:53:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7899 to 7899. [2024-10-13 23:53:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7899 states, 7898 states have (on average 1.0710306406685237) internal successors, (8459), 7898 states have internal predecessors, (8459), 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-10-13 23:53:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7899 states to 7899 states and 8459 transitions. [2024-10-13 23:53:51,385 INFO L78 Accepts]: Start accepts. Automaton has 7899 states and 8459 transitions. Word has length 449 [2024-10-13 23:53:51,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:51,386 INFO L471 AbstractCegarLoop]: Abstraction has 7899 states and 8459 transitions. [2024-10-13 23:53:51,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 3 states have internal predecessors, (449), 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-10-13 23:53:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 7899 states and 8459 transitions. [2024-10-13 23:53:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2024-10-13 23:53:51,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:51,390 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:53:51,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:53:51,390 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:51,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1214779245, now seen corresponding path program 1 times [2024-10-13 23:53:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:51,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408449067] [2024-10-13 23:53:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-13 23:53:51,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:51,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408449067] [2024-10-13 23:53:51,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408449067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:51,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:51,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:53:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890926757] [2024-10-13 23:53:51,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:51,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:51,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:51,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:51,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:51,812 INFO L87 Difference]: Start difference. First operand 7899 states and 8459 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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-10-13 23:53:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:52,705 INFO L93 Difference]: Finished difference Result 17113 states and 18469 transitions. [2024-10-13 23:53:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:52,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 510 [2024-10-13 23:53:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:52,721 INFO L225 Difference]: With dead ends: 17113 [2024-10-13 23:53:52,721 INFO L226 Difference]: Without dead ends: 9873 [2024-10-13 23:53:52,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:52,730 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 292 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:52,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 28 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:53:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9873 states. [2024-10-13 23:53:52,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9873 to 9873. [2024-10-13 23:53:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9873 states, 9872 states have (on average 1.0778970826580228) internal successors, (10641), 9872 states have internal predecessors, (10641), 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-10-13 23:53:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9873 states to 9873 states and 10641 transitions. [2024-10-13 23:53:52,839 INFO L78 Accepts]: Start accepts. Automaton has 9873 states and 10641 transitions. Word has length 510 [2024-10-13 23:53:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:52,840 INFO L471 AbstractCegarLoop]: Abstraction has 9873 states and 10641 transitions. [2024-10-13 23:53:52,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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-10-13 23:53:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 9873 states and 10641 transitions. [2024-10-13 23:53:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2024-10-13 23:53:52,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:52,846 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:53:52,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:53:52,846 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:52,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1159744806, now seen corresponding path program 1 times [2024-10-13 23:53:52,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:52,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537218656] [2024-10-13 23:53:52,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:52,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-13 23:53:53,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:53,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537218656] [2024-10-13 23:53:53,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537218656] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:53:53,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834984910] [2024-10-13 23:53:53,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:53,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:53:53,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:53:53,412 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-10-13 23:53:53,414 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-10-13 23:53:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:53,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:53:53,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:53:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-10-13 23:53:54,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:53:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834984910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:54,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:53:54,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-13 23:53:54,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084491787] [2024-10-13 23:53:54,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:54,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:54,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:54,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:54,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:53:54,287 INFO L87 Difference]: Start difference. First operand 9873 states and 10641 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 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-10-13 23:53:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:54,921 INFO L93 Difference]: Finished difference Result 12507 states and 13352 transitions. [2024-10-13 23:53:54,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:54,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 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 553 [2024-10-13 23:53:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:54,940 INFO L225 Difference]: With dead ends: 12507 [2024-10-13 23:53:54,941 INFO L226 Difference]: Without dead ends: 12505 [2024-10-13 23:53:54,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 552 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-10-13 23:53:54,947 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 107 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:54,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 81 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:53:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2024-10-13 23:53:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 9873. [2024-10-13 23:53:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9873 states, 9872 states have (on average 1.077694489465154) internal successors, (10639), 9872 states have internal predecessors, (10639), 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-10-13 23:53:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9873 states to 9873 states and 10639 transitions. [2024-10-13 23:53:55,079 INFO L78 Accepts]: Start accepts. Automaton has 9873 states and 10639 transitions. Word has length 553 [2024-10-13 23:53:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:55,080 INFO L471 AbstractCegarLoop]: Abstraction has 9873 states and 10639 transitions. [2024-10-13 23:53:55,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 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-10-13 23:53:55,080 INFO L276 IsEmpty]: Start isEmpty. Operand 9873 states and 10639 transitions. [2024-10-13 23:53:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 934 [2024-10-13 23:53:55,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:55,095 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-13 23:53:55,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:53:55,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 23:53:55,297 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:55,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:55,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2086484009, now seen corresponding path program 1 times [2024-10-13 23:53:55,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:55,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995368085] [2024-10-13 23:53:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 1073 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2024-10-13 23:53:56,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:56,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995368085] [2024-10-13 23:53:56,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995368085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:56,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:56,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:53:56,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779423319] [2024-10-13 23:53:56,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:56,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:56,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:56,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:56,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:56,058 INFO L87 Difference]: Start difference. First operand 9873 states and 10639 transitions. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-10-13 23:53:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:56,796 INFO L93 Difference]: Finished difference Result 24022 states and 26092 transitions. [2024-10-13 23:53:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:56,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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 933 [2024-10-13 23:53:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:56,819 INFO L225 Difference]: With dead ends: 24022 [2024-10-13 23:53:56,819 INFO L226 Difference]: Without dead ends: 12834 [2024-10-13 23:53:56,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:56,831 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 270 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:56,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 427 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:53:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12834 states. [2024-10-13 23:53:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12834 to 12176. [2024-10-13 23:53:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12176 states, 12175 states have (on average 1.0661190965092402) internal successors, (12980), 12175 states have internal predecessors, (12980), 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-10-13 23:53:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 12980 transitions. [2024-10-13 23:53:57,046 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 12980 transitions. Word has length 933 [2024-10-13 23:53:57,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:57,047 INFO L471 AbstractCegarLoop]: Abstraction has 12176 states and 12980 transitions. [2024-10-13 23:53:57,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-10-13 23:53:57,047 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 12980 transitions. [2024-10-13 23:53:57,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2024-10-13 23:53:57,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:57,085 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:53:57,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:53:57,086 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:57,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:57,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1009589385, now seen corresponding path program 1 times [2024-10-13 23:53:57,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:57,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992832613] [2024-10-13 23:53:57,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:57,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2797 backedges. 1960 proven. 0 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-10-13 23:53:58,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:58,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992832613] [2024-10-13 23:53:58,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992832613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:58,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:58,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 23:53:58,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097162615] [2024-10-13 23:53:58,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:58,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 23:53:58,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:58,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 23:53:58,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:53:58,696 INFO L87 Difference]: Start difference. First operand 12176 states and 12980 transitions. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 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-10-13 23:53:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:59,638 INFO L93 Difference]: Finished difference Result 23694 states and 25298 transitions. [2024-10-13 23:53:59,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 23:53:59,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 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 1228 [2024-10-13 23:53:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:59,653 INFO L225 Difference]: With dead ends: 23694 [2024-10-13 23:53:59,653 INFO L226 Difference]: Without dead ends: 12177 [2024-10-13 23:53:59,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:53:59,665 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 357 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:59,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 559 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:53:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2024-10-13 23:53:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12176. [2024-10-13 23:53:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12176 states, 12175 states have (on average 1.064312114989733) internal successors, (12958), 12175 states have internal predecessors, (12958), 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-10-13 23:53:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 12958 transitions. [2024-10-13 23:53:59,790 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 12958 transitions. Word has length 1228 [2024-10-13 23:53:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:59,791 INFO L471 AbstractCegarLoop]: Abstraction has 12176 states and 12958 transitions. [2024-10-13 23:53:59,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 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-10-13 23:53:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 12958 transitions. [2024-10-13 23:53:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1243 [2024-10-13 23:53:59,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:59,814 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:53:59,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:53:59,814 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:59,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:59,815 INFO L85 PathProgramCache]: Analyzing trace with hash 376039841, now seen corresponding path program 1 times [2024-10-13 23:53:59,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:59,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662808057] [2024-10-13 23:53:59,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:59,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:54:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:54:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 1847 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-10-13 23:54:01,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:54:01,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662808057] [2024-10-13 23:54:01,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662808057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:54:01,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:54:01,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:54:01,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278633669] [2024-10-13 23:54:01,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:54:01,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:54:01,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:54:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:54:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:54:01,201 INFO L87 Difference]: Start difference. First operand 12176 states and 12958 transitions. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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-10-13 23:54:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:54:02,101 INFO L93 Difference]: Finished difference Result 23701 states and 25261 transitions. [2024-10-13 23:54:02,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 23:54:02,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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 1242 [2024-10-13 23:54:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:54:02,115 INFO L225 Difference]: With dead ends: 23701 [2024-10-13 23:54:02,115 INFO L226 Difference]: Without dead ends: 12184 [2024-10-13 23:54:02,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:54:02,122 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:54:02,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 440 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:54:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12184 states. [2024-10-13 23:54:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12184 to 11847. [2024-10-13 23:54:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11846 states have (on average 1.0653385108897517) internal successors, (12620), 11846 states have internal predecessors, (12620), 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-10-13 23:54:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 12620 transitions. [2024-10-13 23:54:02,241 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 12620 transitions. Word has length 1242 [2024-10-13 23:54:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:54:02,243 INFO L471 AbstractCegarLoop]: Abstraction has 11847 states and 12620 transitions. [2024-10-13 23:54:02,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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-10-13 23:54:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 12620 transitions. [2024-10-13 23:54:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1245 [2024-10-13 23:54:02,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:54:02,269 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:54:02,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:54:02,270 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:54:02,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:54:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1746448906, now seen corresponding path program 1 times [2024-10-13 23:54:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:54:02,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050727062] [2024-10-13 23:54:02,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:54:02,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:54:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:54:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2992 backedges. 1179 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2024-10-13 23:54:02,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:54:02,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050727062] [2024-10-13 23:54:02,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050727062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:54:02,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:54:02,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:54:02,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890618535] [2024-10-13 23:54:02,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:54:02,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:54:02,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:54:02,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:54:02,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:54:02,901 INFO L87 Difference]: Start difference. First operand 11847 states and 12620 transitions. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-10-13 23:54:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:54:03,601 INFO L93 Difference]: Finished difference Result 25665 states and 27344 transitions. [2024-10-13 23:54:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:54:03,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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 1244 [2024-10-13 23:54:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:54:03,603 INFO L225 Difference]: With dead ends: 25665 [2024-10-13 23:54:03,603 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:54:03,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:54:03,614 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 170 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:54:03,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 406 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:54:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:54:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:54:03,616 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-10-13 23:54:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:54:03,616 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1244 [2024-10-13 23:54:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:54:03,616 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:54:03,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-10-13 23:54:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:54:03,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:54:03,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:54:03,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:54:03,623 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:54:03,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:54:03,909 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:54:03,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:54:03 BoogieIcfgContainer [2024-10-13 23:54:03,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:54:03,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:54:03,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:54:03,930 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:54:03,930 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:53:34" (3/4) ... [2024-10-13 23:54:03,932 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:54:03,961 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 23:54:03,963 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:54:03,965 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:54:03,967 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:54:04,171 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:54:04,171 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:54:04,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:54:04,172 INFO L158 Benchmark]: Toolchain (without parser) took 33530.12ms. Allocated memory was 146.8MB in the beginning and 1.0GB in the end (delta: 887.1MB). Free memory was 87.7MB in the beginning and 581.1MB in the end (delta: -493.4MB). Peak memory consumption was 395.6MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,172 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 146.8MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:54:04,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1005.72ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 87.7MB in the beginning and 157.7MB in the end (delta: -70.0MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 186.36ms. Allocated memory is still 213.9MB. Free memory was 157.7MB in the beginning and 133.6MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,173 INFO L158 Benchmark]: Boogie Preprocessor took 241.83ms. Allocated memory is still 213.9MB. Free memory was 133.6MB in the beginning and 99.0MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,173 INFO L158 Benchmark]: RCFGBuilder took 2412.22ms. Allocated memory was 213.9MB in the beginning and 335.5MB in the end (delta: 121.6MB). Free memory was 99.0MB in the beginning and 179.5MB in the end (delta: -80.6MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,173 INFO L158 Benchmark]: TraceAbstraction took 29432.36ms. Allocated memory was 335.5MB in the beginning and 1.0GB in the end (delta: 698.4MB). Free memory was 178.5MB in the beginning and 607.2MB in the end (delta: -428.8MB). Peak memory consumption was 270.6MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,174 INFO L158 Benchmark]: Witness Printer took 241.65ms. Allocated memory is still 1.0GB. Free memory was 607.2MB in the beginning and 581.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,177 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.22ms. Allocated memory is still 146.8MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1005.72ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 87.7MB in the beginning and 157.7MB in the end (delta: -70.0MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 186.36ms. Allocated memory is still 213.9MB. Free memory was 157.7MB in the beginning and 133.6MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 241.83ms. Allocated memory is still 213.9MB. Free memory was 133.6MB in the beginning and 99.0MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2412.22ms. Allocated memory was 213.9MB in the beginning and 335.5MB in the end (delta: 121.6MB). Free memory was 99.0MB in the beginning and 179.5MB in the end (delta: -80.6MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * TraceAbstraction took 29432.36ms. Allocated memory was 335.5MB in the beginning and 1.0GB in the end (delta: 698.4MB). Free memory was 178.5MB in the beginning and 607.2MB in the end (delta: -428.8MB). Peak memory consumption was 270.6MB. Max. memory is 16.1GB. * Witness Printer took 241.65ms. Allocated memory is still 1.0GB. Free memory was 607.2MB in the beginning and 581.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 188]: 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, 334 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.0s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3797 SdHoareTripleChecker+Valid, 15.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3797 mSDsluCounter, 4539 SdHoareTripleChecker+Invalid, 13.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 288 mSDsCounter, 2245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16084 IncrementalHoareTripleChecker+Invalid, 18329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2245 mSolverCounterUnsat, 4251 mSDtfsCounter, 16084 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 607 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12176occurred in iteration=13, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 3628 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 8645 NumberOfCodeBlocks, 8645 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 8628 ConstructedInterpolants, 0 QuantifiedInterpolants, 25342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 667 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 12336/12510 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: 1783]: Loop Invariant Derived loop invariant: ((((((a16 == 8) || ((a15 <= 3) && (11 <= a16))) || (a16 == 9)) || ((a12 == 6) && (a16 <= 11))) || ((a15 <= 3) && (a12 <= 8))) || ((a12 <= 5) && (a16 <= 11))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:54:04,206 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