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


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


Checking for ERROR reachability
Using default analysis
Version 023d838f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label17.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 d3602c5801c05a09989d37521ec0a56c80d33e64222732bb3b7051e65443f9ad
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m
[2024-11-09 18:37:36,157 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-09 18:37:36,242 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-09 18:37:36,252 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-09 18:37:36,253 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-09 18:37:36,282 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-09 18:37:36,283 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-09 18:37:36,283 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-09 18:37:36,284 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-09 18:37:36,285 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-09 18:37:36,285 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-09 18:37:36,286 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-09 18:37:36,286 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-09 18:37:36,287 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-09 18:37:36,288 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-09 18:37:36,289 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-09 18:37:36,289 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-09 18:37:36,289 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-09 18:37:36,290 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-09 18:37:36,290 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-09 18:37:36,294 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-09 18:37:36,295 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-09 18:37:36,295 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-09 18:37:36,295 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-09 18:37:36,295 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-09 18:37:36,295 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-09 18:37:36,296 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-09 18:37:36,296 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-09 18:37:36,296 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-09 18:37:36,296 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-09 18:37:36,296 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-09 18:37:36,297 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-09 18:37:36,297 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-09 18:37:36,297 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-09 18:37:36,297 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-09 18:37:36,297 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-09 18:37:36,297 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-09 18:37:36,298 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-09 18:37:36,298 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-09 18:37:36,299 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-09 18:37:36,300 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-09 18:37:36,300 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-09 18:37:36,300 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 -> d3602c5801c05a09989d37521ec0a56c80d33e64222732bb3b7051e65443f9ad
[2024-11-09 18:37:36,564 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-09 18:37:36,581 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-09 18:37:36,585 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-09 18:37:36,587 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-09 18:37:36,587 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-09 18:37:36,588 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label17.c
[2024-11-09 18:37:37,996 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-09 18:37:38,271 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-09 18:37:38,271 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label17.c
[2024-11-09 18:37:38,284 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de015d62/308b4737a8724c87861d2028c30afc12/FLAG01d9efbb6
[2024-11-09 18:37:38,570 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de015d62/308b4737a8724c87861d2028c30afc12
[2024-11-09 18:37:38,572 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-09 18:37:38,574 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-09 18:37:38,576 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-09 18:37:38,576 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-09 18:37:38,580 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-09 18:37:38,581 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:38" (1/1) ...
[2024-11-09 18:37:38,582 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58e335f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:38, skipping insertion in model container
[2024-11-09 18:37:38,582 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:38" (1/1) ...
[2024-11-09 18:37:38,640 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-09 18:37:39,014 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label17.c[18943,18956]
[2024-11-09 18:37:39,052 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-09 18:37:39,067 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-09 18:37:39,148 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label17.c[18943,18956]
[2024-11-09 18:37:39,166 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-09 18:37:39,185 INFO  L204         MainTranslator]: Completed translation
[2024-11-09 18:37:39,185 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39 WrapperNode
[2024-11-09 18:37:39,186 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-09 18:37:39,187 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-09 18:37:39,187 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-09 18:37:39,187 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-09 18:37:39,194 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (1/1) ...
[2024-11-09 18:37:39,212 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (1/1) ...
[2024-11-09 18:37:39,266 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668
[2024-11-09 18:37:39,266 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-09 18:37:39,267 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-09 18:37:39,268 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-09 18:37:39,268 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-09 18:37:39,277 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (1/1) ...
[2024-11-09 18:37:39,277 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (1/1) ...
[2024-11-09 18:37:39,282 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (1/1) ...
[2024-11-09 18:37:39,306 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-09 18:37:39,306 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (1/1) ...
[2024-11-09 18:37:39,307 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (1/1) ...
[2024-11-09 18:37:39,340 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (1/1) ...
[2024-11-09 18:37:39,343 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (1/1) ...
[2024-11-09 18:37:39,350 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (1/1) ...
[2024-11-09 18:37:39,352 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (1/1) ...
[2024-11-09 18:37:39,365 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-09 18:37:39,366 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2024-11-09 18:37:39,366 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2024-11-09 18:37:39,366 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2024-11-09 18:37:39,367 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (1/1) ...
[2024-11-09 18:37:39,375 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-09 18:37:39,387 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-09 18:37:39,405 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-09 18:37:39,412 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-09 18:37:39,457 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-09 18:37:39,457 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-09 18:37:39,458 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-09 18:37:39,458 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-09 18:37:39,528 INFO  L256             CfgBuilder]: Building ICFG
[2024-11-09 18:37:39,530 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-09 18:37:40,585 INFO  L?                        ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2024-11-09 18:37:40,585 INFO  L307             CfgBuilder]: Performing block encoding
[2024-11-09 18:37:40,607 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-09 18:37:40,608 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-09 18:37:40,609 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:40 BoogieIcfgContainer
[2024-11-09 18:37:40,609 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2024-11-09 18:37:40,611 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-09 18:37:40,611 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-09 18:37:40,615 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-09 18:37:40,615 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:37:38" (1/3) ...
[2024-11-09 18:37:40,616 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111ec0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:37:40, skipping insertion in model container
[2024-11-09 18:37:40,616 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:39" (2/3) ...
[2024-11-09 18:37:40,617 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111ec0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:37:40, skipping insertion in model container
[2024-11-09 18:37:40,618 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:40" (3/3) ...
[2024-11-09 18:37:40,619 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem02_label17.c
[2024-11-09 18:37:40,635 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-09 18:37:40,635 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-09 18:37:40,703 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-09 18:37:40,711 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;@4f0de52d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-09 18:37:40,711 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-09 18:37:40,717 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:40,731 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2024-11-09 18:37:40,732 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:37:40,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:37:40,734 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:37:40,741 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:37:40,741 INFO  L85        PathProgramCache]: Analyzing trace with hash -162311118, now seen corresponding path program 1 times
[2024-11-09 18:37:40,754 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:37:40,754 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156428958]
[2024-11-09 18:37:40,754 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:37:40,755 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:37:40,945 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:37:41,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 18:37:41,306 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:37:41,307 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156428958]
[2024-11-09 18:37:41,308 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156428958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:37:41,308 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:37:41,309 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-09 18:37:41,310 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765802447]
[2024-11-09 18:37:41,311 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:37:41,316 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 18:37:41,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:37:41,342 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 18:37:41,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:41,346 INFO  L87              Difference]: Start difference. First operand  has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:42,095 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:37:42,095 INFO  L93              Difference]: Finished difference Result 607 states and 1041 transitions.
[2024-11-09 18:37:42,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 18:37:42,097 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121
[2024-11-09 18:37:42,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:37:42,107 INFO  L225             Difference]: With dead ends: 607
[2024-11-09 18:37:42,107 INFO  L226             Difference]: Without dead ends: 313
[2024-11-09 18:37:42,110 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:42,113 INFO  L432           NwaCegarLoop]: 99 mSDtfsCounter, 115 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-09 18:37:42,114 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 121 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-09 18:37:42,129 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 313 states.
[2024-11-09 18:37:42,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313.
[2024-11-09 18:37:42,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 313 states, 312 states have (on average 1.4326923076923077) internal successors, (447), 312 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:42,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 447 transitions.
[2024-11-09 18:37:42,158 INFO  L78                 Accepts]: Start accepts. Automaton has 313 states and 447 transitions. Word has length 121
[2024-11-09 18:37:42,159 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:37:42,159 INFO  L471      AbstractCegarLoop]: Abstraction has 313 states and 447 transitions.
[2024-11-09 18:37:42,160 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:42,160 INFO  L276                IsEmpty]: Start isEmpty. Operand 313 states and 447 transitions.
[2024-11-09 18:37:42,162 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-11-09 18:37:42,162 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:37:42,163 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:37:42,163 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-09 18:37:42,163 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:37:42,164 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:37:42,164 INFO  L85        PathProgramCache]: Analyzing trace with hash -1659595754, now seen corresponding path program 1 times
[2024-11-09 18:37:42,164 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:37:42,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474701996]
[2024-11-09 18:37:42,164 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:37:42,165 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:37:42,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:37:42,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 18:37:42,407 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:37:42,407 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474701996]
[2024-11-09 18:37:42,407 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474701996] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:37:42,407 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:37:42,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-09 18:37:42,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934263189]
[2024-11-09 18:37:42,408 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:37:42,409 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 18:37:42,412 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:37:42,413 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 18:37:42,413 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:42,413 INFO  L87              Difference]: Start difference. First operand 313 states and 447 transitions. Second operand  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:42,868 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:37:42,868 INFO  L93              Difference]: Finished difference Result 919 states and 1321 transitions.
[2024-11-09 18:37:42,869 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 18:37:42,869 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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 140
[2024-11-09 18:37:42,870 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:37:42,876 INFO  L225             Difference]: With dead ends: 919
[2024-11-09 18:37:42,876 INFO  L226             Difference]: Without dead ends: 608
[2024-11-09 18:37:42,877 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:42,878 INFO  L432           NwaCegarLoop]: 73 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-09 18:37:42,879 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 102 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-09 18:37:42,881 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 608 states.
[2024-11-09 18:37:42,918 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 603.
[2024-11-09 18:37:42,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 603 states, 602 states have (on average 1.3920265780730896) internal successors, (838), 602 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:42,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 838 transitions.
[2024-11-09 18:37:42,928 INFO  L78                 Accepts]: Start accepts. Automaton has 603 states and 838 transitions. Word has length 140
[2024-11-09 18:37:42,929 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:37:42,929 INFO  L471      AbstractCegarLoop]: Abstraction has 603 states and 838 transitions.
[2024-11-09 18:37:42,929 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:42,929 INFO  L276                IsEmpty]: Start isEmpty. Operand 603 states and 838 transitions.
[2024-11-09 18:37:42,932 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2024-11-09 18:37:42,936 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:37:42,936 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:37:42,937 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-09 18:37:42,937 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:37:42,937 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:37:42,938 INFO  L85        PathProgramCache]: Analyzing trace with hash 1614218809, now seen corresponding path program 1 times
[2024-11-09 18:37:42,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:37:42,938 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206746957]
[2024-11-09 18:37:42,938 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:37:42,938 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:37:42,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:37:43,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 18:37:43,100 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:37:43,100 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206746957]
[2024-11-09 18:37:43,100 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206746957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:37:43,100 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:37:43,100 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-09 18:37:43,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453867172]
[2024-11-09 18:37:43,101 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:37:43,101 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 18:37:43,101 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:37:43,102 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 18:37:43,102 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:43,103 INFO  L87              Difference]: Start difference. First operand 603 states and 838 transitions. Second operand  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:43,322 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:37:43,322 INFO  L93              Difference]: Finished difference Result 1191 states and 1658 transitions.
[2024-11-09 18:37:43,323 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 18:37:43,323 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 151
[2024-11-09 18:37:43,324 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:37:43,326 INFO  L225             Difference]: With dead ends: 1191
[2024-11-09 18:37:43,326 INFO  L226             Difference]: Without dead ends: 590
[2024-11-09 18:37:43,327 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:43,328 INFO  L432           NwaCegarLoop]: 25 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-09 18:37:43,329 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 25 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-09 18:37:43,330 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 590 states.
[2024-11-09 18:37:43,341 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590.
[2024-11-09 18:37:43,342 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 590 states, 589 states have (on average 1.2937181663837012) internal successors, (762), 589 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:43,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 762 transitions.
[2024-11-09 18:37:43,348 INFO  L78                 Accepts]: Start accepts. Automaton has 590 states and 762 transitions. Word has length 151
[2024-11-09 18:37:43,348 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:37:43,349 INFO  L471      AbstractCegarLoop]: Abstraction has 590 states and 762 transitions.
[2024-11-09 18:37:43,349 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:43,349 INFO  L276                IsEmpty]: Start isEmpty. Operand 590 states and 762 transitions.
[2024-11-09 18:37:43,351 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2024-11-09 18:37:43,351 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:37:43,354 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:37:43,354 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-09 18:37:43,355 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:37:43,355 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:37:43,355 INFO  L85        PathProgramCache]: Analyzing trace with hash 389227401, now seen corresponding path program 1 times
[2024-11-09 18:37:43,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:37:43,356 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184503810]
[2024-11-09 18:37:43,356 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:37:43,356 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:37:43,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:37:43,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 18:37:43,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:37:43,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184503810]
[2024-11-09 18:37:43,496 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184503810] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:37:43,496 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:37:43,496 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-09 18:37:43,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905751263]
[2024-11-09 18:37:43,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:37:43,497 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 18:37:43,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:37:43,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 18:37:43,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:43,499 INFO  L87              Difference]: Start difference. First operand 590 states and 762 transitions. Second operand  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:43,892 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:37:43,893 INFO  L93              Difference]: Finished difference Result 1742 states and 2252 transitions.
[2024-11-09 18:37:43,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 18:37:43,893 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 151
[2024-11-09 18:37:43,893 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:37:43,896 INFO  L225             Difference]: With dead ends: 1742
[2024-11-09 18:37:43,896 INFO  L226             Difference]: Without dead ends: 727
[2024-11-09 18:37:43,899 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:43,902 INFO  L432           NwaCegarLoop]: 228 mSDtfsCounter, 124 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-09 18:37:43,902 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 246 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-09 18:37:43,903 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 727 states.
[2024-11-09 18:37:43,913 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 726.
[2024-11-09 18:37:43,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 726 states, 725 states have (on average 1.1875862068965517) internal successors, (861), 725 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:43,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 861 transitions.
[2024-11-09 18:37:43,920 INFO  L78                 Accepts]: Start accepts. Automaton has 726 states and 861 transitions. Word has length 151
[2024-11-09 18:37:43,920 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:37:43,920 INFO  L471      AbstractCegarLoop]: Abstraction has 726 states and 861 transitions.
[2024-11-09 18:37:43,921 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:43,921 INFO  L276                IsEmpty]: Start isEmpty. Operand 726 states and 861 transitions.
[2024-11-09 18:37:43,923 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2024-11-09 18:37:43,923 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:37:43,923 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:37:43,924 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-09 18:37:43,924 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:37:43,924 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:37:43,924 INFO  L85        PathProgramCache]: Analyzing trace with hash 1059884789, now seen corresponding path program 1 times
[2024-11-09 18:37:43,925 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:37:43,925 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326033152]
[2024-11-09 18:37:43,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:37:43,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:37:43,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:37:44,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 18:37:44,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:37:44,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326033152]
[2024-11-09 18:37:44,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326033152] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:37:44,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:37:44,223 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-09 18:37:44,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400370211]
[2024-11-09 18:37:44,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:37:44,223 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-09 18:37:44,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:37:44,224 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-09 18:37:44,226 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-09 18:37:44,226 INFO  L87              Difference]: Start difference. First operand 726 states and 861 transitions. Second operand  has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:44,932 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:37:44,932 INFO  L93              Difference]: Finished difference Result 1732 states and 2062 transitions.
[2024-11-09 18:37:44,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-09 18:37:44,933 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156
[2024-11-09 18:37:44,933 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:37:44,936 INFO  L225             Difference]: With dead ends: 1732
[2024-11-09 18:37:44,936 INFO  L226             Difference]: Without dead ends: 1008
[2024-11-09 18:37:44,937 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-09 18:37:44,938 INFO  L432           NwaCegarLoop]: 47 mSDtfsCounter, 343 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-09 18:37:44,938 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 96 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-09 18:37:44,940 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1008 states.
[2024-11-09 18:37:44,956 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 867.
[2024-11-09 18:37:44,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 867 states, 866 states have (on average 1.1605080831408776) internal successors, (1005), 866 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:44,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1005 transitions.
[2024-11-09 18:37:44,960 INFO  L78                 Accepts]: Start accepts. Automaton has 867 states and 1005 transitions. Word has length 156
[2024-11-09 18:37:44,961 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:37:44,961 INFO  L471      AbstractCegarLoop]: Abstraction has 867 states and 1005 transitions.
[2024-11-09 18:37:44,962 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:44,962 INFO  L276                IsEmpty]: Start isEmpty. Operand 867 states and 1005 transitions.
[2024-11-09 18:37:44,964 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-09 18:37:44,965 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:37:44,965 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-09 18:37:44,965 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-09 18:37:44,965 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:37:44,966 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:37:44,966 INFO  L85        PathProgramCache]: Analyzing trace with hash 643711171, now seen corresponding path program 1 times
[2024-11-09 18:37:44,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:37:44,967 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117717329]
[2024-11-09 18:37:44,967 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:37:44,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:37:45,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:37:45,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 18:37:45,126 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:37:45,126 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117717329]
[2024-11-09 18:37:45,126 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117717329] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:37:45,126 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:37:45,126 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-09 18:37:45,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898089143]
[2024-11-09 18:37:45,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:37:45,127 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 18:37:45,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:37:45,129 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 18:37:45,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:45,129 INFO  L87              Difference]: Start difference. First operand 867 states and 1005 transitions. Second operand  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:45,506 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:37:45,506 INFO  L93              Difference]: Finished difference Result 2155 states and 2530 transitions.
[2024-11-09 18:37:45,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 18:37:45,507 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 177
[2024-11-09 18:37:45,508 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:37:45,511 INFO  L225             Difference]: With dead ends: 2155
[2024-11-09 18:37:45,512 INFO  L226             Difference]: Without dead ends: 1148
[2024-11-09 18:37:45,513 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:45,514 INFO  L432           NwaCegarLoop]: 53 mSDtfsCounter, 131 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-09 18:37:45,514 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 64 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-09 18:37:45,516 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1148 states.
[2024-11-09 18:37:45,531 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148.
[2024-11-09 18:37:45,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1148 states, 1147 states have (on average 1.1508282476024412) internal successors, (1320), 1147 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:45,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1320 transitions.
[2024-11-09 18:37:45,536 INFO  L78                 Accepts]: Start accepts. Automaton has 1148 states and 1320 transitions. Word has length 177
[2024-11-09 18:37:45,536 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:37:45,536 INFO  L471      AbstractCegarLoop]: Abstraction has 1148 states and 1320 transitions.
[2024-11-09 18:37:45,537 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:45,537 INFO  L276                IsEmpty]: Start isEmpty. Operand 1148 states and 1320 transitions.
[2024-11-09 18:37:45,539 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 186
[2024-11-09 18:37:45,540 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:37:45,540 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-09 18:37:45,540 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-09 18:37:45,540 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:37:45,541 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:37:45,541 INFO  L85        PathProgramCache]: Analyzing trace with hash 1694024279, now seen corresponding path program 1 times
[2024-11-09 18:37:45,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:37:45,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135135394]
[2024-11-09 18:37:45,541 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:37:45,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:37:45,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:37:45,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 18:37:45,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:37:45,670 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135135394]
[2024-11-09 18:37:45,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135135394] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:37:45,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:37:45,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-09 18:37:45,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931922474]
[2024-11-09 18:37:45,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:37:45,671 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 18:37:45,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:37:45,672 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 18:37:45,672 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:45,672 INFO  L87              Difference]: Start difference. First operand 1148 states and 1320 transitions. Second operand  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:46,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:37:46,035 INFO  L93              Difference]: Finished difference Result 2859 states and 3279 transitions.
[2024-11-09 18:37:46,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 18:37:46,036 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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 185
[2024-11-09 18:37:46,036 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:37:46,041 INFO  L225             Difference]: With dead ends: 2859
[2024-11-09 18:37:46,041 INFO  L226             Difference]: Without dead ends: 1713
[2024-11-09 18:37:46,043 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:46,044 INFO  L432           NwaCegarLoop]: 189 mSDtfsCounter, 132 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-09 18:37:46,044 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 198 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-09 18:37:46,046 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1713 states.
[2024-11-09 18:37:46,069 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1712.
[2024-11-09 18:37:46,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1712 states, 1711 states have (on average 1.1098772647574517) internal successors, (1899), 1711 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:46,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 1899 transitions.
[2024-11-09 18:37:46,075 INFO  L78                 Accepts]: Start accepts. Automaton has 1712 states and 1899 transitions. Word has length 185
[2024-11-09 18:37:46,075 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:37:46,076 INFO  L471      AbstractCegarLoop]: Abstraction has 1712 states and 1899 transitions.
[2024-11-09 18:37:46,076 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:46,076 INFO  L276                IsEmpty]: Start isEmpty. Operand 1712 states and 1899 transitions.
[2024-11-09 18:37:46,079 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2024-11-09 18:37:46,080 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:37:46,080 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:37:46,080 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-09 18:37:46,080 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:37:46,081 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:37:46,081 INFO  L85        PathProgramCache]: Analyzing trace with hash -754328272, now seen corresponding path program 1 times
[2024-11-09 18:37:46,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:37:46,081 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947699515]
[2024-11-09 18:37:46,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:37:46,081 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:37:46,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:37:46,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 118 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2024-11-09 18:37:46,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:37:46,252 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947699515]
[2024-11-09 18:37:46,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947699515] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:37:46,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:37:46,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-09 18:37:46,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690329466]
[2024-11-09 18:37:46,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:37:46,254 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 18:37:46,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:37:46,255 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 18:37:46,255 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:46,255 INFO  L87              Difference]: Start difference. First operand 1712 states and 1899 transitions. Second operand  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:46,620 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:37:46,621 INFO  L93              Difference]: Finished difference Result 3274 states and 3636 transitions.
[2024-11-09 18:37:46,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 18:37:46,622 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 208
[2024-11-09 18:37:46,622 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:37:46,623 INFO  L225             Difference]: With dead ends: 3274
[2024-11-09 18:37:46,623 INFO  L226             Difference]: Without dead ends: 0
[2024-11-09 18:37:46,626 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:37:46,627 INFO  L432           NwaCegarLoop]: 20 mSDtfsCounter, 51 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-09 18:37:46,628 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 25 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-09 18:37:46,628 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-09 18:37:46,628 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-09 18:37:46,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:46,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-09 18:37:46,629 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 208
[2024-11-09 18:37:46,629 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:37:46,629 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-09 18:37:46,630 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:37:46,630 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-09 18:37:46,630 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-09 18:37:46,633 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-09 18:37:46,634 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-09 18:37:46,637 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:37:46,640 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-09 18:37:46,794 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-09 18:37:46,807 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:37:46 BoogieIcfgContainer
[2024-11-09 18:37:46,808 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-09 18:37:46,809 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-09 18:37:46,809 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-09 18:37:46,809 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-09 18:37:46,809 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:40" (3/4) ...
[2024-11-09 18:37:46,812 INFO  L143         WitnessPrinter]: Generating witness for correct program
[2024-11-09 18:37:46,833 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges
[2024-11-09 18:37:46,834 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-09 18:37:46,835 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-09 18:37:46,836 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-09 18:37:46,990 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-09 18:37:46,990 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-09 18:37:46,990 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-09 18:37:46,991 INFO  L158              Benchmark]: Toolchain (without parser) took 8417.24ms. Allocated memory was 136.3MB in the beginning and 268.4MB in the end (delta: 132.1MB). Free memory was 62.9MB in the beginning and 188.7MB in the end (delta: -125.8MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB.
[2024-11-09 18:37:46,991 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 136.3MB. Free memory was 98.0MB in the beginning and 97.9MB in the end (delta: 103.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-09 18:37:46,992 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 610.48ms. Allocated memory was 136.3MB in the beginning and 174.1MB in the end (delta: 37.7MB). Free memory was 62.6MB in the beginning and 120.9MB in the end (delta: -58.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB.
[2024-11-09 18:37:46,992 INFO  L158              Benchmark]: Boogie Procedure Inliner took 79.60ms. Allocated memory is still 174.1MB. Free memory was 120.9MB in the beginning and 115.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-09 18:37:46,992 INFO  L158              Benchmark]: Boogie Preprocessor took 98.17ms. Allocated memory is still 174.1MB. Free memory was 115.6MB in the beginning and 110.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-09 18:37:46,992 INFO  L158              Benchmark]: IcfgBuilder took 1242.99ms. Allocated memory is still 174.1MB. Free memory was 110.5MB in the beginning and 88.4MB in the end (delta: 22.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB.
[2024-11-09 18:37:46,992 INFO  L158              Benchmark]: TraceAbstraction took 6197.16ms. Allocated memory was 174.1MB in the beginning and 268.4MB in the end (delta: 94.4MB). Free memory was 88.4MB in the beginning and 201.3MB in the end (delta: -112.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-09 18:37:46,993 INFO  L158              Benchmark]: Witness Printer took 181.91ms. Allocated memory is still 268.4MB. Free memory was 201.3MB in the beginning and 188.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-09 18:37:46,994 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.18ms. Allocated memory is still 136.3MB. Free memory was 98.0MB in the beginning and 97.9MB in the end (delta: 103.8kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 610.48ms. Allocated memory was 136.3MB in the beginning and 174.1MB in the end (delta: 37.7MB). Free memory was 62.6MB in the beginning and 120.9MB in the end (delta: -58.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 79.60ms. Allocated memory is still 174.1MB. Free memory was 120.9MB in the beginning and 115.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 98.17ms. Allocated memory is still 174.1MB. Free memory was 115.6MB in the beginning and 110.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * IcfgBuilder took 1242.99ms. Allocated memory is still 174.1MB. Free memory was 110.5MB in the beginning and 88.4MB in the end (delta: 22.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 6197.16ms. Allocated memory was 174.1MB in the beginning and 268.4MB in the end (delta: 94.4MB). Free memory was 88.4MB in the beginning and 201.3MB in the end (delta: -112.9MB). There was no memory consumed. Max. memory is 16.1GB.
 * Witness Printer took 181.91ms. Allocated memory is still 268.4MB. Free memory was 201.3MB in the beginning and 188.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 539]: 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, 230 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1238 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1238 mSDsluCounter, 877 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3154 IncrementalHoareTripleChecker+Invalid, 3640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 486 mSolverCounterUnsat, 734 mSDtfsCounter, 3154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1712occurred in iteration=7, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 148 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1289 NumberOfCodeBlocks, 1289 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1281 ConstructedInterpolants, 0 QuantifiedInterpolants, 2486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 413/413 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 616]: Location Invariant
    Derived location invariant: null
RESULT: Ultimate proved your program to be correct!
[2024-11-09 18:37:47,023 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