./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label10.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 8be7027f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label10.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 5f4b32ab55ef7da7a1c45381b7a9ca93704fa76788ea88b9dbed6ebccc0ba509
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m
[2024-11-11 16:04:35,599 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-11 16:04:35,673 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-11 16:04:35,682 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-11 16:04:35,683 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-11 16:04:35,716 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-11 16:04:35,718 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-11 16:04:35,718 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-11 16:04:35,719 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-11 16:04:35,721 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-11 16:04:35,721 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-11 16:04:35,722 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-11 16:04:35,722 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-11 16:04:35,724 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-11 16:04:35,724 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-11 16:04:35,724 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-11 16:04:35,725 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-11 16:04:35,725 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-11 16:04:35,725 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-11 16:04:35,726 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-11 16:04:35,726 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-11 16:04:35,726 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-11 16:04:35,727 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-11 16:04:35,727 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-11 16:04:35,727 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-11 16:04:35,728 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-11 16:04:35,728 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-11 16:04:35,728 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-11 16:04:35,729 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-11 16:04:35,729 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-11 16:04:35,729 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-11 16:04:35,729 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-11 16:04:35,730 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-11 16:04:35,730 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-11 16:04:35,731 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-11 16:04:35,731 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-11 16:04:35,731 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-11 16:04:35,731 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-11 16:04:35,732 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-11 16:04:35,732 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-11 16:04:35,732 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-11 16:04:35,733 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-11 16:04:35,733 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 -> 5f4b32ab55ef7da7a1c45381b7a9ca93704fa76788ea88b9dbed6ebccc0ba509
[2024-11-11 16:04:36,023 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-11 16:04:36,049 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-11 16:04:36,052 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-11 16:04:36,054 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-11 16:04:36,054 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-11 16:04:36,055 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label10.c
[2024-11-11 16:04:37,458 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-11 16:04:37,709 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-11 16:04:37,710 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label10.c
[2024-11-11 16:04:37,732 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56cc2e8e7/71ad5ecbf9dd47258ef08e1abcbe841c/FLAGcf297334a
[2024-11-11 16:04:38,040 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56cc2e8e7/71ad5ecbf9dd47258ef08e1abcbe841c
[2024-11-11 16:04:38,042 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-11 16:04:38,043 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-11 16:04:38,045 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-11 16:04:38,045 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-11 16:04:38,050 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-11 16:04:38,051 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,052 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1612db2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38, skipping insertion in model container
[2024-11-11 16:04:38,054 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,094 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-11 16:04:38,432 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label10.c[19224,19237]
[2024-11-11 16:04:38,473 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-11 16:04:38,487 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-11 16:04:38,582 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label10.c[19224,19237]
[2024-11-11 16:04:38,595 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-11 16:04:38,615 INFO  L204         MainTranslator]: Completed translation
[2024-11-11 16:04:38,615 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38 WrapperNode
[2024-11-11 16:04:38,615 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-11 16:04:38,616 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-11 16:04:38,617 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-11 16:04:38,617 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-11 16:04:38,625 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,647 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,711 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658
[2024-11-11 16:04:38,712 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-11 16:04:38,712 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-11 16:04:38,712 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-11 16:04:38,713 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-11 16:04:38,723 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,723 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,734 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,767 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-11 16:04:38,770 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,771 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,791 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,803 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,814 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,820 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,827 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-11 16:04:38,829 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-11 16:04:38,830 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-11 16:04:38,830 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-11 16:04:38,831 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (1/1) ...
[2024-11-11 16:04:38,836 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-11 16:04:38,849 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 16:04:38,866 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-11 16:04:38,868 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-11 16:04:38,915 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-11 16:04:38,915 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-11 16:04:38,916 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-11 16:04:38,916 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-11 16:04:38,986 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-11 16:04:38,988 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-11 16:04:39,890 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2024-11-11 16:04:39,890 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-11 16:04:39,915 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-11 16:04:39,916 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-11 16:04:39,916 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:04:39 BoogieIcfgContainer
[2024-11-11 16:04:39,916 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-11 16:04:39,919 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-11 16:04:39,919 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-11 16:04:39,922 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-11 16:04:39,922 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:04:38" (1/3) ...
[2024-11-11 16:04:39,923 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e842d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:04:39, skipping insertion in model container
[2024-11-11 16:04:39,923 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:38" (2/3) ...
[2024-11-11 16:04:39,924 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e842d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:04:39, skipping insertion in model container
[2024-11-11 16:04:39,924 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:04:39" (3/3) ...
[2024-11-11 16:04:39,925 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem01_label10.c
[2024-11-11 16:04:39,940 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-11 16:04:39,941 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-11 16:04:40,010 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-11 16:04:40,017 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;@5e27871e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-11 16:04:40,017 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-11 16:04:40,026 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:40,035 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2024-11-11 16:04:40,036 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:40,037 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:04:40,040 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:40,045 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:40,045 INFO  L85        PathProgramCache]: Analyzing trace with hash -1265250489, now seen corresponding path program 1 times
[2024-11-11 16:04:40,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:40,055 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530182430]
[2024-11-11 16:04:40,055 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:40,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:40,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:40,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 16:04:40,944 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:40,944 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530182430]
[2024-11-11 16:04:40,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530182430] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:40,945 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:40,946 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:04:40,947 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215961624]
[2024-11-11 16:04:40,949 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:40,954 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 16:04:40,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:40,980 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 16:04:40,980 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:04:40,983 INFO  L87              Difference]: Start difference. First operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:42,047 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:42,047 INFO  L93              Difference]: Finished difference Result 662 states and 1178 transitions.
[2024-11-11 16:04:42,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-11 16:04:42,051 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 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 110
[2024-11-11 16:04:42,052 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:42,065 INFO  L225             Difference]: With dead ends: 662
[2024-11-11 16:04:42,065 INFO  L226             Difference]: Without dead ends: 397
[2024-11-11 16:04:42,069 INFO  L434           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-11-11 16:04:42,073 INFO  L435           NwaCegarLoop]: 65 mSDtfsCounter, 335 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:42,073 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 81 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-11 16:04:42,089 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 397 states.
[2024-11-11 16:04:42,124 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397.
[2024-11-11 16:04:42,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 397 states, 396 states have (on average 1.3055555555555556) internal successors, (517), 396 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:42,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 517 transitions.
[2024-11-11 16:04:42,133 INFO  L78                 Accepts]: Start accepts. Automaton has 397 states and 517 transitions. Word has length 110
[2024-11-11 16:04:42,133 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:42,135 INFO  L471      AbstractCegarLoop]: Abstraction has 397 states and 517 transitions.
[2024-11-11 16:04:42,136 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:42,136 INFO  L276                IsEmpty]: Start isEmpty. Operand 397 states and 517 transitions.
[2024-11-11 16:04:42,142 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2024-11-11 16:04:42,143 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:42,144 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2024-11-11 16:04:42,144 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-11 16:04:42,145 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:42,146 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:42,146 INFO  L85        PathProgramCache]: Analyzing trace with hash 2120064666, now seen corresponding path program 1 times
[2024-11-11 16:04:42,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:42,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386455803]
[2024-11-11 16:04:42,147 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:42,148 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:42,213 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:42,601 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 16:04:42,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:42,602 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386455803]
[2024-11-11 16:04:42,602 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386455803] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:42,603 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:42,603 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:04:42,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383875470]
[2024-11-11 16:04:42,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:42,606 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 16:04:42,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:42,608 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 16:04:42,608 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:04:42,609 INFO  L87              Difference]: Start difference. First operand 397 states and 517 transitions. Second operand  has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:43,197 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:43,198 INFO  L93              Difference]: Finished difference Result 887 states and 1235 transitions.
[2024-11-11 16:04:43,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 16:04:43,199 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 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 117
[2024-11-11 16:04:43,200 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:43,203 INFO  L225             Difference]: With dead ends: 887
[2024-11-11 16:04:43,204 INFO  L226             Difference]: Without dead ends: 528
[2024-11-11 16:04:43,206 INFO  L434           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-11-11 16:04:43,209 INFO  L435           NwaCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:43,210 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 81 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-11 16:04:43,211 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2024-11-11 16:04:43,234 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397.
[2024-11-11 16:04:43,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 397 states, 396 states have (on average 1.196969696969697) internal successors, (474), 396 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:43,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 474 transitions.
[2024-11-11 16:04:43,237 INFO  L78                 Accepts]: Start accepts. Automaton has 397 states and 474 transitions. Word has length 117
[2024-11-11 16:04:43,237 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:43,238 INFO  L471      AbstractCegarLoop]: Abstraction has 397 states and 474 transitions.
[2024-11-11 16:04:43,238 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:43,238 INFO  L276                IsEmpty]: Start isEmpty. Operand 397 states and 474 transitions.
[2024-11-11 16:04:43,243 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-11 16:04:43,244 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:43,244 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:04:43,244 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-11 16:04:43,244 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:43,245 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:43,245 INFO  L85        PathProgramCache]: Analyzing trace with hash 1758005848, now seen corresponding path program 1 times
[2024-11-11 16:04:43,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:43,246 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48340425]
[2024-11-11 16:04:43,246 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:43,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:43,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:43,418 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-11 16:04:43,418 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:43,418 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48340425]
[2024-11-11 16:04:43,418 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48340425] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:43,418 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:43,419 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 16:04:43,419 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690441986]
[2024-11-11 16:04:43,419 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:43,419 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:04:43,419 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:43,420 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:04:43,420 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:43,420 INFO  L87              Difference]: Start difference. First operand 397 states and 474 transitions. Second operand  has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:43,761 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:43,761 INFO  L93              Difference]: Finished difference Result 923 states and 1105 transitions.
[2024-11-11 16:04:43,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:04:43,762 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 125
[2024-11-11 16:04:43,762 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:43,764 INFO  L225             Difference]: With dead ends: 923
[2024-11-11 16:04:43,764 INFO  L226             Difference]: Without dead ends: 528
[2024-11-11 16:04:43,765 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:43,766 INFO  L435           NwaCegarLoop]: 42 mSDtfsCounter, 124 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:43,766 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 47 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:04:43,767 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2024-11-11 16:04:43,782 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2024-11-11 16:04:43,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 528 states, 527 states have (on average 1.1707779886148009) internal successors, (617), 527 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:43,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 617 transitions.
[2024-11-11 16:04:43,785 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 617 transitions. Word has length 125
[2024-11-11 16:04:43,785 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:43,786 INFO  L471      AbstractCegarLoop]: Abstraction has 528 states and 617 transitions.
[2024-11-11 16:04:43,786 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:43,786 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 617 transitions.
[2024-11-11 16:04:43,788 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2024-11-11 16:04:43,788 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:43,788 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:04:43,788 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-11 16:04:43,789 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:43,789 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:43,789 INFO  L85        PathProgramCache]: Analyzing trace with hash 2053434938, now seen corresponding path program 1 times
[2024-11-11 16:04:43,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:43,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225255750]
[2024-11-11 16:04:43,790 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:43,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:43,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:43,911 INFO  L134       CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-11 16:04:43,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:43,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225255750]
[2024-11-11 16:04:43,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225255750] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:43,913 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:43,913 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:04:43,913 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400382381]
[2024-11-11 16:04:43,913 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:43,914 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:04:43,914 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:43,915 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:04:43,915 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:43,915 INFO  L87              Difference]: Start difference. First operand 528 states and 617 transitions. Second operand  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 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-11-11 16:04:44,277 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:44,277 INFO  L93              Difference]: Finished difference Result 1578 states and 1846 transitions.
[2024-11-11 16:04:44,278 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:04:44,278 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 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 134
[2024-11-11 16:04:44,278 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:44,282 INFO  L225             Difference]: With dead ends: 1578
[2024-11-11 16:04:44,283 INFO  L226             Difference]: Without dead ends: 1052
[2024-11-11 16:04:44,284 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:44,285 INFO  L435           NwaCegarLoop]: 25 mSDtfsCounter, 130 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:44,285 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 30 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:04:44,287 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1052 states.
[2024-11-11 16:04:44,301 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921.
[2024-11-11 16:04:44,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 921 states, 920 states have (on average 1.1880434782608695) internal successors, (1093), 920 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:44,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1093 transitions.
[2024-11-11 16:04:44,305 INFO  L78                 Accepts]: Start accepts. Automaton has 921 states and 1093 transitions. Word has length 134
[2024-11-11 16:04:44,306 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:44,306 INFO  L471      AbstractCegarLoop]: Abstraction has 921 states and 1093 transitions.
[2024-11-11 16:04:44,306 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 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-11-11 16:04:44,306 INFO  L276                IsEmpty]: Start isEmpty. Operand 921 states and 1093 transitions.
[2024-11-11 16:04:44,308 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2024-11-11 16:04:44,309 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:44,309 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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]
[2024-11-11 16:04:44,309 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-11 16:04:44,309 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:44,310 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:44,310 INFO  L85        PathProgramCache]: Analyzing trace with hash -1921508774, now seen corresponding path program 1 times
[2024-11-11 16:04:44,310 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:44,310 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329203863]
[2024-11-11 16:04:44,311 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:44,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:44,340 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:44,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2024-11-11 16:04:44,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:44,495 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329203863]
[2024-11-11 16:04:44,495 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329203863] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:44,495 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:44,495 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:04:44,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373657654]
[2024-11-11 16:04:44,496 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:44,496 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 16:04:44,496 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:44,497 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 16:04:44,497 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:04:44,497 INFO  L87              Difference]: Start difference. First operand 921 states and 1093 transitions. Second operand  has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:45,042 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:45,043 INFO  L93              Difference]: Finished difference Result 2364 states and 2853 transitions.
[2024-11-11 16:04:45,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 16:04:45,043 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159
[2024-11-11 16:04:45,043 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:45,048 INFO  L225             Difference]: With dead ends: 2364
[2024-11-11 16:04:45,048 INFO  L226             Difference]: Without dead ends: 1445
[2024-11-11 16:04:45,049 INFO  L434           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-11-11 16:04:45,050 INFO  L435           NwaCegarLoop]: 27 mSDtfsCounter, 258 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:45,051 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 36 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-11 16:04:45,052 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1445 states.
[2024-11-11 16:04:45,065 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1052.
[2024-11-11 16:04:45,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1052 states, 1051 states have (on average 1.1722169362511894) internal successors, (1232), 1051 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:45,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1232 transitions.
[2024-11-11 16:04:45,069 INFO  L78                 Accepts]: Start accepts. Automaton has 1052 states and 1232 transitions. Word has length 159
[2024-11-11 16:04:45,069 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:45,069 INFO  L471      AbstractCegarLoop]: Abstraction has 1052 states and 1232 transitions.
[2024-11-11 16:04:45,069 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:45,070 INFO  L276                IsEmpty]: Start isEmpty. Operand 1052 states and 1232 transitions.
[2024-11-11 16:04:45,072 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2024-11-11 16:04:45,072 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:45,072 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-11 16:04:45,072 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-11 16:04:45,073 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:45,073 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:45,073 INFO  L85        PathProgramCache]: Analyzing trace with hash -2088756233, now seen corresponding path program 1 times
[2024-11-11 16:04:45,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:45,073 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666295468]
[2024-11-11 16:04:45,073 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:45,074 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:45,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:45,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 112 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2024-11-11 16:04:45,306 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:45,307 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666295468]
[2024-11-11 16:04:45,307 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666295468] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:45,307 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:45,307 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:04:45,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154918573]
[2024-11-11 16:04:45,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:45,308 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 16:04:45,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:45,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 16:04:45,309 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:04:45,309 INFO  L87              Difference]: Start difference. First operand 1052 states and 1232 transitions. Second operand  has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:45,858 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:45,858 INFO  L93              Difference]: Finished difference Result 2626 states and 3090 transitions.
[2024-11-11 16:04:45,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 16:04:45,859 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173
[2024-11-11 16:04:45,859 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:45,864 INFO  L225             Difference]: With dead ends: 2626
[2024-11-11 16:04:45,865 INFO  L226             Difference]: Without dead ends: 1576
[2024-11-11 16:04:45,866 INFO  L434           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-11-11 16:04:45,868 INFO  L435           NwaCegarLoop]: 35 mSDtfsCounter, 344 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:45,870 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 44 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-11 16:04:45,873 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2024-11-11 16:04:45,892 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445.
[2024-11-11 16:04:45,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1445 states, 1444 states have (on average 1.164819944598338) internal successors, (1682), 1444 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:45,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions.
[2024-11-11 16:04:45,898 INFO  L78                 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 173
[2024-11-11 16:04:45,898 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:45,899 INFO  L471      AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions.
[2024-11-11 16:04:45,899 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:45,899 INFO  L276                IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions.
[2024-11-11 16:04:45,903 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2024-11-11 16:04:45,903 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:45,903 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:04:45,903 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-11 16:04:45,904 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:45,904 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:45,904 INFO  L85        PathProgramCache]: Analyzing trace with hash 118097752, now seen corresponding path program 1 times
[2024-11-11 16:04:45,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:45,904 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048674037]
[2024-11-11 16:04:45,905 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:45,912 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:45,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:46,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 212 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2024-11-11 16:04:46,203 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:46,203 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048674037]
[2024-11-11 16:04:46,203 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048674037] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:46,203 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:46,203 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-11 16:04:46,204 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961350041]
[2024-11-11 16:04:46,204 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:46,204 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 16:04:46,204 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:46,205 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 16:04:46,205 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:04:46,208 INFO  L87              Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand  has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:46,795 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:46,795 INFO  L93              Difference]: Finished difference Result 3281 states and 3801 transitions.
[2024-11-11 16:04:46,796 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 16:04:46,796 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215
[2024-11-11 16:04:46,796 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:46,802 INFO  L225             Difference]: With dead ends: 3281
[2024-11-11 16:04:46,802 INFO  L226             Difference]: Without dead ends: 1838
[2024-11-11 16:04:46,804 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-11 16:04:46,805 INFO  L435           NwaCegarLoop]: 23 mSDtfsCounter, 222 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:46,805 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 33 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-11 16:04:46,808 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-11 16:04:46,850 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576.
[2024-11-11 16:04:46,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1576 states, 1575 states have (on average 1.1498412698412699) internal successors, (1811), 1575 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:46,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1811 transitions.
[2024-11-11 16:04:46,856 INFO  L78                 Accepts]: Start accepts. Automaton has 1576 states and 1811 transitions. Word has length 215
[2024-11-11 16:04:46,857 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:46,857 INFO  L471      AbstractCegarLoop]: Abstraction has 1576 states and 1811 transitions.
[2024-11-11 16:04:46,857 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:46,857 INFO  L276                IsEmpty]: Start isEmpty. Operand 1576 states and 1811 transitions.
[2024-11-11 16:04:46,861 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 259
[2024-11-11 16:04:46,861 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:46,861 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:04:46,862 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-11 16:04:46,862 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:46,862 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:46,862 INFO  L85        PathProgramCache]: Analyzing trace with hash 640262584, now seen corresponding path program 1 times
[2024-11-11 16:04:46,863 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:46,863 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136986402]
[2024-11-11 16:04:46,863 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:46,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:46,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:47,050 INFO  L134       CoverageAnalysis]: Checked inductivity of 375 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked.
[2024-11-11 16:04:47,051 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:47,051 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136986402]
[2024-11-11 16:04:47,051 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136986402] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:47,051 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:47,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:04:47,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170683530]
[2024-11-11 16:04:47,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:47,052 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:04:47,052 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:47,053 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:04:47,053 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:47,053 INFO  L87              Difference]: Start difference. First operand 1576 states and 1811 transitions. Second operand  has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:47,420 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:47,420 INFO  L93              Difference]: Finished difference Result 3412 states and 3893 transitions.
[2024-11-11 16:04:47,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:04:47,421 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 258
[2024-11-11 16:04:47,421 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:47,427 INFO  L225             Difference]: With dead ends: 3412
[2024-11-11 16:04:47,427 INFO  L226             Difference]: Without dead ends: 1838
[2024-11-11 16:04:47,429 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:47,430 INFO  L435           NwaCegarLoop]: 173 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:47,431 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 178 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:04:47,434 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-11 16:04:47,456 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707.
[2024-11-11 16:04:47,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.1201641266119577) internal successors, (1911), 1706 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:47,462 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1911 transitions.
[2024-11-11 16:04:47,462 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 1911 transitions. Word has length 258
[2024-11-11 16:04:47,462 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:47,463 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 1911 transitions.
[2024-11-11 16:04:47,463 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:47,463 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 1911 transitions.
[2024-11-11 16:04:47,467 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 281
[2024-11-11 16:04:47,467 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:47,468 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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]
[2024-11-11 16:04:47,468 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-11 16:04:47,468 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:47,468 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:47,469 INFO  L85        PathProgramCache]: Analyzing trace with hash 769718351, now seen corresponding path program 1 times
[2024-11-11 16:04:47,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:47,469 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115581101]
[2024-11-11 16:04:47,469 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:47,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:47,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:48,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 407 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2024-11-11 16:04:48,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:48,055 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115581101]
[2024-11-11 16:04:48,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115581101] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:48,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:48,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-11 16:04:48,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142801817]
[2024-11-11 16:04:48,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:48,057 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 16:04:48,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:48,058 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 16:04:48,058 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:04:48,058 INFO  L87              Difference]: Start difference. First operand 1707 states and 1911 transitions. Second operand  has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:48,648 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:48,649 INFO  L93              Difference]: Finished difference Result 3541 states and 3953 transitions.
[2024-11-11 16:04:48,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 16:04:48,651 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 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 280
[2024-11-11 16:04:48,651 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:48,651 INFO  L225             Difference]: With dead ends: 3541
[2024-11-11 16:04:48,651 INFO  L226             Difference]: Without dead ends: 0
[2024-11-11 16:04:48,654 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-11 16:04:48,654 INFO  L435           NwaCegarLoop]: 34 mSDtfsCounter, 224 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:48,655 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 46 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-11 16:04:48,655 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-11 16:04:48,655 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-11 16:04:48,655 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:48,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-11 16:04:48,656 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 280
[2024-11-11 16:04:48,656 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:48,656 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-11 16:04:48,656 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:48,656 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-11 16:04:48,656 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-11 16:04:48,659 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-11 16:04:48,660 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-11 16:04:48,663 INFO  L421         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:04:48,665 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-11 16:04:48,853 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-11 16:04:48,870 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:04:48 BoogieIcfgContainer
[2024-11-11 16:04:48,871 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-11 16:04:48,871 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-11 16:04:48,871 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-11 16:04:48,871 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-11 16:04:48,872 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:04:39" (3/4) ...
[2024-11-11 16:04:48,874 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-11 16:04:48,895 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-11 16:04:48,896 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-11 16:04:48,897 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-11 16:04:48,897 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-11 16:04:49,049 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-11 16:04:49,050 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-11 16:04:49,050 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-11 16:04:49,050 INFO  L158              Benchmark]: Toolchain (without parser) took 11007.15ms. Allocated memory was 192.9MB in the beginning and 299.9MB in the end (delta: 107.0MB). Free memory was 124.7MB in the beginning and 186.8MB in the end (delta: -62.0MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB.
[2024-11-11 16:04:49,051 INFO  L158              Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 76.7MB in the beginning and 76.5MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-11 16:04:49,051 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 571.15ms. Allocated memory is still 192.9MB. Free memory was 124.7MB in the beginning and 156.9MB in the end (delta: -32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2024-11-11 16:04:49,051 INFO  L158              Benchmark]: Boogie Procedure Inliner took 95.21ms. Allocated memory is still 192.9MB. Free memory was 156.9MB in the beginning and 151.5MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-11 16:04:49,051 INFO  L158              Benchmark]: Boogie Preprocessor took 116.04ms. Allocated memory is still 192.9MB. Free memory was 151.5MB in the beginning and 145.6MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-11 16:04:49,052 INFO  L158              Benchmark]: RCFGBuilder took 1087.31ms. Allocated memory is still 192.9MB. Free memory was 145.6MB in the beginning and 139.5MB in the end (delta: 6.2MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB.
[2024-11-11 16:04:49,052 INFO  L158              Benchmark]: TraceAbstraction took 8952.08ms. Allocated memory was 192.9MB in the beginning and 299.9MB in the end (delta: 107.0MB). Free memory was 139.5MB in the beginning and 198.3MB in the end (delta: -58.8MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB.
[2024-11-11 16:04:49,052 INFO  L158              Benchmark]: Witness Printer took 178.66ms. Allocated memory is still 299.9MB. Free memory was 198.3MB in the beginning and 186.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-11-11 16:04:49,054 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.16ms. Allocated memory is still 104.9MB. Free memory was 76.7MB in the beginning and 76.5MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 571.15ms. Allocated memory is still 192.9MB. Free memory was 124.7MB in the beginning and 156.9MB in the end (delta: -32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 95.21ms. Allocated memory is still 192.9MB. Free memory was 156.9MB in the beginning and 151.5MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 116.04ms. Allocated memory is still 192.9MB. Free memory was 151.5MB in the beginning and 145.6MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1087.31ms. Allocated memory is still 192.9MB. Free memory was 145.6MB in the beginning and 139.5MB in the end (delta: 6.2MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8952.08ms. Allocated memory was 192.9MB in the beginning and 299.9MB in the end (delta: 107.0MB). Free memory was 139.5MB in the beginning and 198.3MB in the end (delta: -58.8MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB.
 * Witness Printer took 178.66ms. Allocated memory is still 299.9MB. Free memory was 198.3MB in the beginning and 186.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 516]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 9, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1853 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1853 mSDsluCounter, 576 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 808 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4255 IncrementalHoareTripleChecker+Invalid, 5063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 808 mSolverCounterUnsat, 495 mSDtfsCounter, 4255 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=8, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1179 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1571 NumberOfCodeBlocks, 1571 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1562 ConstructedInterpolants, 0 QuantifiedInterpolants, 6245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 1261/1261 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: 593]: Loop Invariant
    Derived loop invariant: (((((a21 == 1) && (a16 <= 5)) || ((a7 != 1) && (a21 == 1))) || (a20 == 1)) || ((a17 == 1) && (a16 <= 5)))
RESULT: Ultimate proved your program to be correct!
[2024-11-11 16:04:49,083 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