./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label46.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version a046e57d
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label46.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 14408b329878540946fe7764dd35bdde7ddb2280d1dd9f9e09220bf70c4bb1b5
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m
[2024-10-12 15:15:51,296 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-12 15:15:51,377 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-12 15:15:51,384 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-12 15:15:51,385 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-12 15:15:51,424 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-12 15:15:51,425 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-12 15:15:51,425 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-12 15:15:51,426 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-12 15:15:51,428 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-10-12 15:15:51,428 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-12 15:15:51,429 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-12 15:15:51,429 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-12 15:15:51,429 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-12 15:15:51,430 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-12 15:15:51,430 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-12 15:15:51,430 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-12 15:15:51,430 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-12 15:15:51,431 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-12 15:15:51,431 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-12 15:15:51,431 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-12 15:15:51,432 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-12 15:15:51,432 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-12 15:15:51,432 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-12 15:15:51,432 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-12 15:15:51,433 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-12 15:15:51,433 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-12 15:15:51,433 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-12 15:15:51,434 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-12 15:15:51,434 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-12 15:15:51,434 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-10-12 15:15:51,435 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-12 15:15:51,435 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-12 15:15:51,435 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-12 15:15:51,435 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-12 15:15:51,435 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-12 15:15:51,435 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-12 15:15:51,436 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-12 15:15:51,436 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-12 15:15:51,436 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-12 15:15:51,436 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-10-12 15:15:51,437 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-12 15:15:51,437 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 -> 14408b329878540946fe7764dd35bdde7ddb2280d1dd9f9e09220bf70c4bb1b5
[2024-10-12 15:15:51,678 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-12 15:15:51,706 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-12 15:15:51,709 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-12 15:15:51,710 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-12 15:15:51,710 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-12 15:15:51,711 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label46.c
[2024-10-12 15:15:53,156 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-12 15:15:53,419 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-12 15:15:53,420 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label46.c
[2024-10-12 15:15:53,433 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbbcb2ae/fe7ea83f98e84184b649c3befc4dbac6/FLAGfe676f4ff
[2024-10-12 15:15:53,731 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbbcb2ae/fe7ea83f98e84184b649c3befc4dbac6
[2024-10-12 15:15:53,733 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-12 15:15:53,735 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-12 15:15:53,736 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-12 15:15:53,736 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-12 15:15:53,744 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-12 15:15:53,745 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:15:53" (1/1) ...
[2024-10-12 15:15:53,746 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbc449f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:53, skipping insertion in model container
[2024-10-12 15:15:53,746 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:15:53" (1/1) ...
[2024-10-12 15:15:53,797 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-12 15:15:54,150 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label46.c[19475,19488]
[2024-10-12 15:15:54,183 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-12 15:15:54,203 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-12 15:15:54,310 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label46.c[19475,19488]
[2024-10-12 15:15:54,319 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-12 15:15:54,340 INFO  L204         MainTranslator]: Completed translation
[2024-10-12 15:15:54,340 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54 WrapperNode
[2024-10-12 15:15:54,340 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-12 15:15:54,342 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-12 15:15:54,342 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-12 15:15:54,342 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-12 15:15:54,349 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (1/1) ...
[2024-10-12 15:15:54,371 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (1/1) ...
[2024-10-12 15:15:54,417 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658
[2024-10-12 15:15:54,417 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-12 15:15:54,418 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-12 15:15:54,418 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-12 15:15:54,418 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-12 15:15:54,437 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (1/1) ...
[2024-10-12 15:15:54,438 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (1/1) ...
[2024-10-12 15:15:54,442 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (1/1) ...
[2024-10-12 15:15:54,479 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-10-12 15:15:54,479 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (1/1) ...
[2024-10-12 15:15:54,479 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (1/1) ...
[2024-10-12 15:15:54,509 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (1/1) ...
[2024-10-12 15:15:54,517 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (1/1) ...
[2024-10-12 15:15:54,523 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (1/1) ...
[2024-10-12 15:15:54,528 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (1/1) ...
[2024-10-12 15:15:54,536 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-12 15:15:54,537 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-12 15:15:54,538 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-12 15:15:54,538 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-12 15:15:54,539 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (1/1) ...
[2024-10-12 15:15:54,548 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-12 15:15:54,574 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-12 15:15:54,595 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-10-12 15:15:54,598 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-10-12 15:15:54,646 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-12 15:15:54,646 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-12 15:15:54,647 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-12 15:15:54,647 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-12 15:15:54,718 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-12 15:15:54,720 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-12 15:15:55,677 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2024-10-12 15:15:55,677 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-12 15:15:55,740 INFO  L309             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-12 15:15:55,741 INFO  L314             CfgBuilder]: Removed 1 assume(true) statements.
[2024-10-12 15:15:55,741 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:15:55 BoogieIcfgContainer
[2024-10-12 15:15:55,742 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-12 15:15:55,744 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-12 15:15:55,745 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-12 15:15:55,748 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-12 15:15:55,748 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:15:53" (1/3) ...
[2024-10-12 15:15:55,748 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7834c1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:15:55, skipping insertion in model container
[2024-10-12 15:15:55,748 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:54" (2/3) ...
[2024-10-12 15:15:55,749 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7834c1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:15:55, skipping insertion in model container
[2024-10-12 15:15:55,749 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:15:55" (3/3) ...
[2024-10-12 15:15:55,750 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem01_label46.c
[2024-10-12 15:15:55,762 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-12 15:15:55,762 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-12 15:15:55,831 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-12 15:15:55,837 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;@685f3248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-12 15:15:55,838 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-12 15:15:55,841 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:55,849 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-10-12 15:15:55,850 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-12 15:15:55,850 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 15:15:55,851 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 15:15:55,855 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 15:15:55,856 INFO  L85        PathProgramCache]: Analyzing trace with hash 1955188418, now seen corresponding path program 1 times
[2024-10-12 15:15:55,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 15:15:55,863 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852865986]
[2024-10-12 15:15:55,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 15:15:55,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 15:15:56,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 15:15:56,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-12 15:15:56,288 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-12 15:15:56,288 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852865986]
[2024-10-12 15:15:56,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852865986] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-12 15:15:56,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-12 15:15:56,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-12 15:15:56,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417988881]
[2024-10-12 15:15:56,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-12 15:15:56,296 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-10-12 15:15:56,298 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-12 15:15:56,326 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-10-12 15:15:56,327 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-12 15:15:56,330 INFO  L87              Difference]: Start difference. First operand  has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:56,366 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-12 15:15:56,367 INFO  L93              Difference]: Finished difference Result 271 states and 529 transitions.
[2024-10-12 15:15:56,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-12 15:15:56,370 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 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 111
[2024-10-12 15:15:56,370 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-12 15:15:56,379 INFO  L225             Difference]: With dead ends: 271
[2024-10-12 15:15:56,379 INFO  L226             Difference]: Without dead ends: 134
[2024-10-12 15:15:56,381 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-12 15:15:56,384 INFO  L432           NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-12 15:15:56,385 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-12 15:15:56,401 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2024-10-12 15:15:56,417 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134.
[2024-10-12 15:15:56,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:56,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions.
[2024-10-12 15:15:56,421 INFO  L78                 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 111
[2024-10-12 15:15:56,422 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-12 15:15:56,422 INFO  L471      AbstractCegarLoop]: Abstraction has 134 states and 200 transitions.
[2024-10-12 15:15:56,423 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:56,423 INFO  L276                IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions.
[2024-10-12 15:15:56,425 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-10-12 15:15:56,425 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-12 15:15:56,425 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 15:15:56,425 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-12 15:15:56,426 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 15:15:56,426 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 15:15:56,426 INFO  L85        PathProgramCache]: Analyzing trace with hash 158178319, now seen corresponding path program 1 times
[2024-10-12 15:15:56,427 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 15:15:56,427 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865450080]
[2024-10-12 15:15:56,427 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 15:15:56,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 15:15:56,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 15:15:56,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-12 15:15:56,742 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-12 15:15:56,742 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865450080]
[2024-10-12 15:15:56,742 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865450080] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-12 15:15:56,742 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-12 15:15:56,742 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-12 15:15:56,742 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943097621]
[2024-10-12 15:15:56,743 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-12 15:15:56,748 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-12 15:15:56,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-12 15:15:56,749 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-12 15:15:56,749 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-12 15:15:56,749 INFO  L87              Difference]: Start difference. First operand 134 states and 200 transitions. Second operand  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:57,293 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-12 15:15:57,294 INFO  L93              Difference]: Finished difference Result 398 states and 597 transitions.
[2024-10-12 15:15:57,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-12 15:15:57,295 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 111
[2024-10-12 15:15:57,296 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-12 15:15:57,298 INFO  L225             Difference]: With dead ends: 398
[2024-10-12 15:15:57,299 INFO  L226             Difference]: Without dead ends: 265
[2024-10-12 15:15:57,301 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-12 15:15:57,302 INFO  L432           NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-10-12 15:15:57,303 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 17 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-10-12 15:15:57,304 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 265 states.
[2024-10-12 15:15:57,317 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265.
[2024-10-12 15:15:57,318 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 265 states, 264 states have (on average 1.481060606060606) internal successors, (391), 264 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:57,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 391 transitions.
[2024-10-12 15:15:57,320 INFO  L78                 Accepts]: Start accepts. Automaton has 265 states and 391 transitions. Word has length 111
[2024-10-12 15:15:57,330 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-12 15:15:57,331 INFO  L471      AbstractCegarLoop]: Abstraction has 265 states and 391 transitions.
[2024-10-12 15:15:57,332 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:57,332 INFO  L276                IsEmpty]: Start isEmpty. Operand 265 states and 391 transitions.
[2024-10-12 15:15:57,334 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2024-10-12 15:15:57,335 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-12 15:15:57,336 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 15:15:57,336 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-12 15:15:57,337 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 15:15:57,337 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 15:15:57,338 INFO  L85        PathProgramCache]: Analyzing trace with hash 247977511, now seen corresponding path program 1 times
[2024-10-12 15:15:57,338 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 15:15:57,338 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412625402]
[2024-10-12 15:15:57,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 15:15:57,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 15:15:57,379 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 15:15:57,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-12 15:15:57,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-12 15:15:57,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412625402]
[2024-10-12 15:15:57,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412625402] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-12 15:15:57,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-12 15:15:57,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-12 15:15:57,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610581068]
[2024-10-12 15:15:57,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-12 15:15:57,481 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-12 15:15:57,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-12 15:15:57,481 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-12 15:15:57,482 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-12 15:15:57,482 INFO  L87              Difference]: Start difference. First operand 265 states and 391 transitions. Second operand  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:57,932 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-12 15:15:57,933 INFO  L93              Difference]: Finished difference Result 791 states and 1170 transitions.
[2024-10-12 15:15:57,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-12 15:15:57,933 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116
[2024-10-12 15:15:57,933 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-12 15:15:57,936 INFO  L225             Difference]: With dead ends: 791
[2024-10-12 15:15:57,937 INFO  L226             Difference]: Without dead ends: 527
[2024-10-12 15:15:57,937 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-12 15:15:57,938 INFO  L432           NwaCegarLoop]: 23 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-12 15:15:57,939 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 27 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-12 15:15:57,940 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 527 states.
[2024-10-12 15:15:57,978 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527.
[2024-10-12 15:15:57,979 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 527 states, 526 states have (on average 1.414448669201521) internal successors, (744), 526 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:57,980 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 744 transitions.
[2024-10-12 15:15:57,981 INFO  L78                 Accepts]: Start accepts. Automaton has 527 states and 744 transitions. Word has length 116
[2024-10-12 15:15:57,981 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-12 15:15:57,981 INFO  L471      AbstractCegarLoop]: Abstraction has 527 states and 744 transitions.
[2024-10-12 15:15:57,981 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:57,981 INFO  L276                IsEmpty]: Start isEmpty. Operand 527 states and 744 transitions.
[2024-10-12 15:15:57,984 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2024-10-12 15:15:57,984 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-12 15:15:57,985 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 15:15:57,985 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-12 15:15:57,985 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 15:15:57,986 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 15:15:57,986 INFO  L85        PathProgramCache]: Analyzing trace with hash -930176562, now seen corresponding path program 1 times
[2024-10-12 15:15:57,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 15:15:57,986 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775404651]
[2024-10-12 15:15:57,986 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 15:15:57,986 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 15:15:58,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 15:15:58,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-12 15:15:58,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-12 15:15:58,243 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775404651]
[2024-10-12 15:15:58,243 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775404651] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-12 15:15:58,244 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-12 15:15:58,244 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-12 15:15:58,244 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790601237]
[2024-10-12 15:15:58,244 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-12 15:15:58,244 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-12 15:15:58,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-12 15:15:58,245 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-12 15:15:58,246 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-12 15:15:58,246 INFO  L87              Difference]: Start difference. First operand 527 states and 744 transitions. Second operand  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:58,639 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-12 15:15:58,640 INFO  L93              Difference]: Finished difference Result 1446 states and 2031 transitions.
[2024-10-12 15:15:58,640 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-12 15:15:58,640 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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 126
[2024-10-12 15:15:58,640 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-12 15:15:58,643 INFO  L225             Difference]: With dead ends: 1446
[2024-10-12 15:15:58,644 INFO  L226             Difference]: Without dead ends: 920
[2024-10-12 15:15:58,645 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-12 15:15:58,646 INFO  L432           NwaCegarLoop]: 49 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-12 15:15:58,646 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 54 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-12 15:15:58,648 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 920 states.
[2024-10-12 15:15:58,661 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 789.
[2024-10-12 15:15:58,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 789 states, 788 states have (on average 1.3223350253807107) internal successors, (1042), 788 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:58,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1042 transitions.
[2024-10-12 15:15:58,665 INFO  L78                 Accepts]: Start accepts. Automaton has 789 states and 1042 transitions. Word has length 126
[2024-10-12 15:15:58,665 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-12 15:15:58,665 INFO  L471      AbstractCegarLoop]: Abstraction has 789 states and 1042 transitions.
[2024-10-12 15:15:58,665 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:58,666 INFO  L276                IsEmpty]: Start isEmpty. Operand 789 states and 1042 transitions.
[2024-10-12 15:15:58,668 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2024-10-12 15:15:58,668 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-12 15:15:58,669 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 15:15:58,669 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-12 15:15:58,669 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 15:15:58,669 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 15:15:58,670 INFO  L85        PathProgramCache]: Analyzing trace with hash -327408770, now seen corresponding path program 1 times
[2024-10-12 15:15:58,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 15:15:58,670 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914645165]
[2024-10-12 15:15:58,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 15:15:58,670 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 15:15:58,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 15:15:58,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-10-12 15:15:58,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-12 15:15:58,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914645165]
[2024-10-12 15:15:58,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914645165] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-12 15:15:58,807 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-12 15:15:58,807 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-12 15:15:58,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009503392]
[2024-10-12 15:15:58,808 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-12 15:15:58,808 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-12 15:15:58,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-12 15:15:58,809 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-12 15:15:58,809 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-12 15:15:58,809 INFO  L87              Difference]: Start difference. First operand 789 states and 1042 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-10-12 15:15:59,204 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-12 15:15:59,205 INFO  L93              Difference]: Finished difference Result 1839 states and 2436 transitions.
[2024-10-12 15:15:59,205 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-12 15:15:59,215 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 127
[2024-10-12 15:15:59,216 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-12 15:15:59,219 INFO  L225             Difference]: With dead ends: 1839
[2024-10-12 15:15:59,219 INFO  L226             Difference]: Without dead ends: 1051
[2024-10-12 15:15:59,220 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-12 15:15:59,221 INFO  L432           NwaCegarLoop]: 67 mSDtfsCounter, 127 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-12 15:15:59,221 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 72 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-12 15:15:59,223 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1051 states.
[2024-10-12 15:15:59,235 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 920.
[2024-10-12 15:15:59,237 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 920 states, 919 states have (on average 1.2894450489662677) internal successors, (1185), 919 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:15:59,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1185 transitions.
[2024-10-12 15:15:59,240 INFO  L78                 Accepts]: Start accepts. Automaton has 920 states and 1185 transitions. Word has length 127
[2024-10-12 15:15:59,240 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-12 15:15:59,240 INFO  L471      AbstractCegarLoop]: Abstraction has 920 states and 1185 transitions.
[2024-10-12 15:15:59,240 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-10-12 15:15:59,241 INFO  L276                IsEmpty]: Start isEmpty. Operand 920 states and 1185 transitions.
[2024-10-12 15:15:59,242 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2024-10-12 15:15:59,243 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-12 15:15:59,243 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 15:15:59,243 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-12 15:15:59,243 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 15:15:59,244 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 15:15:59,244 INFO  L85        PathProgramCache]: Analyzing trace with hash 1625688502, now seen corresponding path program 1 times
[2024-10-12 15:15:59,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 15:15:59,244 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28344570]
[2024-10-12 15:15:59,244 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 15:15:59,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 15:15:59,272 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 15:15:59,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-10-12 15:15:59,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-12 15:15:59,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28344570]
[2024-10-12 15:15:59,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28344570] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-12 15:15:59,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363321360]
[2024-10-12 15:15:59,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 15:15:59,457 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-12 15:15:59,457 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-12 15:15:59,460 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-12 15:15:59,461 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-10-12 15:15:59,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 15:15:59,575 INFO  L255         TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-12 15:15:59,585 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-12 15:15:59,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-10-12 15:15:59,778 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-12 15:15:59,778 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [363321360] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-12 15:15:59,778 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-12 15:15:59,778 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2024-10-12 15:15:59,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958699672]
[2024-10-12 15:15:59,779 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-12 15:15:59,779 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-12 15:15:59,779 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-12 15:15:59,780 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-12 15:15:59,780 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-12 15:15:59,780 INFO  L87              Difference]: Start difference. First operand 920 states and 1185 transitions. Second operand  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:16:00,175 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-12 15:16:00,175 INFO  L93              Difference]: Finished difference Result 1315 states and 1645 transitions.
[2024-10-12 15:16:00,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-12 15:16:00,176 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131
[2024-10-12 15:16:00,176 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-12 15:16:00,180 INFO  L225             Difference]: With dead ends: 1315
[2024-10-12 15:16:00,181 INFO  L226             Difference]: Without dead ends: 1313
[2024-10-12 15:16:00,181 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-12 15:16:00,182 INFO  L432           NwaCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-12 15:16:00,182 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 29 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-12 15:16:00,184 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1313 states.
[2024-10-12 15:16:00,196 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 920.
[2024-10-12 15:16:00,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 920 states, 919 states have (on average 1.2883569096844396) internal successors, (1184), 919 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:16:00,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1184 transitions.
[2024-10-12 15:16:00,201 INFO  L78                 Accepts]: Start accepts. Automaton has 920 states and 1184 transitions. Word has length 131
[2024-10-12 15:16:00,201 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-12 15:16:00,201 INFO  L471      AbstractCegarLoop]: Abstraction has 920 states and 1184 transitions.
[2024-10-12 15:16:00,202 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:16:00,202 INFO  L276                IsEmpty]: Start isEmpty. Operand 920 states and 1184 transitions.
[2024-10-12 15:16:00,204 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-10-12 15:16:00,204 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-12 15:16:00,205 INFO  L215           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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 15:16:00,224 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-10-12 15:16:00,409 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2024-10-12 15:16:00,410 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 15:16:00,410 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 15:16:00,411 INFO  L85        PathProgramCache]: Analyzing trace with hash -87425617, now seen corresponding path program 1 times
[2024-10-12 15:16:00,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 15:16:00,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826351144]
[2024-10-12 15:16:00,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 15:16:00,411 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 15:16:00,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 15:16:00,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2024-10-12 15:16:00,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-12 15:16:00,670 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826351144]
[2024-10-12 15:16:00,671 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826351144] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-12 15:16:00,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574873281]
[2024-10-12 15:16:00,671 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 15:16:00,671 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-12 15:16:00,671 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-12 15:16:00,673 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-12 15:16:00,675 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-10-12 15:16:00,782 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 15:16:00,784 INFO  L255         TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-12 15:16:00,788 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-12 15:16:00,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2024-10-12 15:16:00,980 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-12 15:16:00,980 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [574873281] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-12 15:16:00,980 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-12 15:16:00,980 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2024-10-12 15:16:00,980 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030757332]
[2024-10-12 15:16:00,980 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-12 15:16:00,981 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-12 15:16:00,981 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-12 15:16:00,981 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-12 15:16:00,982 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-12 15:16:00,982 INFO  L87              Difference]: Start difference. First operand 920 states and 1184 transitions. Second operand  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:16:01,394 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-12 15:16:01,394 INFO  L93              Difference]: Finished difference Result 1837 states and 2366 transitions.
[2024-10-12 15:16:01,394 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-12 15:16:01,395 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 170
[2024-10-12 15:16:01,395 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-12 15:16:01,395 INFO  L225             Difference]: With dead ends: 1837
[2024-10-12 15:16:01,396 INFO  L226             Difference]: Without dead ends: 0
[2024-10-12 15:16:01,397 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-12 15:16:01,398 INFO  L432           NwaCegarLoop]: 183 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-12 15:16:01,398 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 187 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-12 15:16:01,399 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-10-12 15:16:01,399 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-10-12 15:16:01,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:16:01,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-10-12 15:16:01,400 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170
[2024-10-12 15:16:01,400 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-12 15:16:01,400 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-10-12 15:16:01,400 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-12 15:16:01,400 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-10-12 15:16:01,401 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-10-12 15:16:01,403 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-10-12 15:16:01,421 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-10-12 15:16:01,607 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2024-10-12 15:16:01,610 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2024-10-12 15:16:01,612 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-10-12 15:16:01,674 INFO  L165   ceAbstractionStarter]: Computing trace abstraction results
[2024-10-12 15:16:01,694 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:16:01 BoogieIcfgContainer
[2024-10-12 15:16:01,694 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-12 15:16:01,695 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-12 15:16:01,695 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-10-12 15:16:01,695 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-10-12 15:16:01,696 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:15:55" (3/4) ...
[2024-10-12 15:16:01,698 INFO  L139         WitnessPrinter]: Generating witness for correct program
[2024-10-12 15:16:01,713 INFO  L904   BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2024-10-12 15:16:01,714 INFO  L904   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-10-12 15:16:01,715 INFO  L904   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-10-12 15:16:01,716 INFO  L904   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-10-12 15:16:01,872 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-10-12 15:16:01,875 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-10-12 15:16:01,875 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-12 15:16:01,876 INFO  L158              Benchmark]: Toolchain (without parser) took 8140.98ms. Allocated memory was 178.3MB in the beginning and 251.7MB in the end (delta: 73.4MB). Free memory was 121.2MB in the beginning and 113.2MB in the end (delta: 8.0MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB.
[2024-10-12 15:16:01,876 INFO  L158              Benchmark]: CDTParser took 0.17ms. Allocated memory is still 178.3MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-12 15:16:01,876 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 604.35ms. Allocated memory is still 178.3MB. Free memory was 120.8MB in the beginning and 91.5MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
[2024-10-12 15:16:01,876 INFO  L158              Benchmark]: Boogie Procedure Inliner took 75.74ms. Allocated memory is still 178.3MB. Free memory was 91.5MB in the beginning and 85.6MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-10-12 15:16:01,877 INFO  L158              Benchmark]: Boogie Preprocessor took 118.65ms. Allocated memory is still 178.3MB. Free memory was 85.6MB in the beginning and 80.1MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-10-12 15:16:01,877 INFO  L158              Benchmark]: RCFGBuilder took 1205.17ms. Allocated memory is still 178.3MB. Free memory was 80.1MB in the beginning and 81.8MB in the end (delta: -1.7MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB.
[2024-10-12 15:16:01,877 INFO  L158              Benchmark]: TraceAbstraction took 5950.27ms. Allocated memory was 178.3MB in the beginning and 251.7MB in the end (delta: 73.4MB). Free memory was 80.9MB in the beginning and 125.7MB in the end (delta: -44.8MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB.
[2024-10-12 15:16:01,878 INFO  L158              Benchmark]: Witness Printer took 179.87ms. Allocated memory is still 251.7MB. Free memory was 125.7MB in the beginning and 113.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-10-12 15:16:01,879 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.17ms. Allocated memory is still 178.3MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 604.35ms. Allocated memory is still 178.3MB. Free memory was 120.8MB in the beginning and 91.5MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 75.74ms. Allocated memory is still 178.3MB. Free memory was 91.5MB in the beginning and 85.6MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 118.65ms. Allocated memory is still 178.3MB. Free memory was 85.6MB in the beginning and 80.1MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1205.17ms. Allocated memory is still 178.3MB. Free memory was 80.1MB in the beginning and 81.8MB in the end (delta: -1.7MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB.
 * TraceAbstraction took 5950.27ms. Allocated memory was 178.3MB in the beginning and 251.7MB in the end (delta: 73.4MB). Free memory was 80.9MB in the beginning and 125.7MB in the end (delta: -44.8MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB.
 * Witness Printer took 179.87ms. Allocated memory is still 251.7MB. Free memory was 125.7MB in the beginning and 113.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 522]: 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 529 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 529 mSDsluCounter, 586 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 375 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1960 IncrementalHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 375 mSolverCounterUnsat, 558 mSDtfsCounter, 1960 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=920occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 655 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1193 NumberOfCodeBlocks, 1193 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1184 ConstructedInterpolants, 0 QuantifiedInterpolants, 2272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 639 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 307/313 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) || ((a21 == 1) && (a16 <= 5))) || ((a21 == 1) && (15 <= a8))) || ((a21 == 1) && (a20 == 1)))
RESULT: Ultimate proved your program to be correct!
[2024-10-12 15:16:01,913 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE