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


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


Checking for ERROR reachability
Using default analysis
Version c7c6ca5d
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label55.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash faf917cd0a1eaa2ad9dee590b3f946754d69847d6ec93638a854081a172b37da
--- Real Ultimate output ---
This is Ultimate 0.2.5-?-c7c6ca5-m
[2024-11-08 10:27:20,619 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-08 10:27:20,691 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 10:27:20,697 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 10:27:20,697 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 10:27:20,723 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 10:27:20,723 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 10:27:20,724 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 10:27:20,724 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 10:27:20,724 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-08 10:27:20,725 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 10:27:20,725 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 10:27:20,726 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 10:27:20,726 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-08 10:27:20,727 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-08 10:27:20,728 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 10:27:20,728 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-08 10:27:20,728 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-08 10:27:20,729 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-08 10:27:20,729 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-08 10:27:20,729 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-08 10:27:20,733 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 10:27:20,733 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 10:27:20,733 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 10:27:20,734 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-08 10:27:20,734 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-08 10:27:20,734 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-08 10:27:20,734 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-08 10:27:20,735 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 10:27:20,735 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-08 10:27:20,735 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 10:27:20,735 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-08 10:27:20,735 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 10:27:20,736 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 10:27:20,736 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 10:27:20,736 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 10:27:20,736 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-08 10:27:20,737 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 10:27:20,737 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 10:27:20,737 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 10:27:20,737 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 10:27:20,738 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 10:27:20,738 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 -> faf917cd0a1eaa2ad9dee590b3f946754d69847d6ec93638a854081a172b37da
[2024-11-08 10:27:20,984 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 10:27:21,008 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 10:27:21,011 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 10:27:21,012 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-08 10:27:21,012 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-08 10:27:21,013 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label55.c
[2024-11-08 10:27:22,425 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-08 10:27:22,683 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-08 10:27:22,684 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label55.c
[2024-11-08 10:27:22,709 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfad1c6f/a1ca94a9d2c74c568d0e3b69d8ec234b/FLAG369cf36e6
[2024-11-08 10:27:22,728 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfad1c6f/a1ca94a9d2c74c568d0e3b69d8ec234b
[2024-11-08 10:27:22,731 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 10:27:22,732 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 10:27:22,734 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 10:27:22,734 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 10:27:22,739 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 10:27:22,740 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:22" (1/1) ...
[2024-11-08 10:27:22,743 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aae1360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:22, skipping insertion in model container
[2024-11-08 10:27:22,743 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:22" (1/1) ...
[2024-11-08 10:27:22,788 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-08 10:27:23,159 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label55.c[19349,19362]
[2024-11-08 10:27:23,198 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 10:27:23,214 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-08 10:27:23,309 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label55.c[19349,19362]
[2024-11-08 10:27:23,321 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 10:27:23,354 INFO  L204         MainTranslator]: Completed translation
[2024-11-08 10:27:23,354 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23 WrapperNode
[2024-11-08 10:27:23,354 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 10:27:23,355 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 10:27:23,356 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 10:27:23,356 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 10:27:23,363 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (1/1) ...
[2024-11-08 10:27:23,384 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (1/1) ...
[2024-11-08 10:27:23,434 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658
[2024-11-08 10:27:23,435 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 10:27:23,435 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 10:27:23,436 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 10:27:23,436 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 10:27:23,448 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (1/1) ...
[2024-11-08 10:27:23,448 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (1/1) ...
[2024-11-08 10:27:23,452 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (1/1) ...
[2024-11-08 10:27:23,485 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-08 10:27:23,486 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (1/1) ...
[2024-11-08 10:27:23,486 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (1/1) ...
[2024-11-08 10:27:23,511 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (1/1) ...
[2024-11-08 10:27:23,523 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (1/1) ...
[2024-11-08 10:27:23,534 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (1/1) ...
[2024-11-08 10:27:23,540 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (1/1) ...
[2024-11-08 10:27:23,547 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 10:27:23,548 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 10:27:23,548 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 10:27:23,548 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-08 10:27:23,549 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (1/1) ...
[2024-11-08 10:27:23,554 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 10:27:23,565 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 10:27:23,580 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-08 10:27:23,583 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-08 10:27:23,630 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 10:27:23,630 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 10:27:23,631 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 10:27:23,631 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 10:27:23,704 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-08 10:27:23,706 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 10:27:24,677 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2024-11-08 10:27:24,677 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-08 10:27:24,699 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 10:27:24,700 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 10:27:24,701 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:24 BoogieIcfgContainer
[2024-11-08 10:27:24,701 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 10:27:24,703 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 10:27:24,703 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 10:27:24,706 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-08 10:27:24,706 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:27:22" (1/3) ...
[2024-11-08 10:27:24,707 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412aa3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:24, skipping insertion in model container
[2024-11-08 10:27:24,707 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:23" (2/3) ...
[2024-11-08 10:27:24,708 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412aa3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:24, skipping insertion in model container
[2024-11-08 10:27:24,709 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:24" (3/3) ...
[2024-11-08 10:27:24,710 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem01_label55.c
[2024-11-08 10:27:24,725 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 10:27:24,726 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 10:27:24,796 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 10:27:24,802 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;@5bb847c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 10:27:24,802 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 10:27:24,806 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:24,817 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-08 10:27:24,817 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:24,818 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:24,818 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:24,823 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:24,824 INFO  L85        PathProgramCache]: Analyzing trace with hash -568054802, now seen corresponding path program 1 times
[2024-11-08 10:27:24,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:24,833 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021901719]
[2024-11-08 10:27:24,834 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:24,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:25,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:25,457 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-08 10:27:25,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:25,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021901719]
[2024-11-08 10:27:25,458 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021901719] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:25,461 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:25,461 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 10:27:25,463 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671378468]
[2024-11-08 10:27:25,464 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:25,469 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:25,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:25,496 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:25,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:25,501 INFO  L87              Difference]: Start difference. First operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:26,194 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:26,195 INFO  L93              Difference]: Finished difference Result 528 states and 915 transitions.
[2024-11-08 10:27:26,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:26,199 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111
[2024-11-08 10:27:26,200 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:26,209 INFO  L225             Difference]: With dead ends: 528
[2024-11-08 10:27:26,209 INFO  L226             Difference]: Without dead ends: 266
[2024-11-08 10:27:26,213 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-08 10:27:26,216 INFO  L432           NwaCegarLoop]: 36 mSDtfsCounter, 84 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:26,217 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 44 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 10:27:26,233 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2024-11-08 10:27:26,259 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266.
[2024-11-08 10:27:26,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 266 states, 265 states have (on average 1.4792452830188678) internal successors, (392), 265 states have internal predecessors, (392), 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-08 10:27:26,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 392 transitions.
[2024-11-08 10:27:26,265 INFO  L78                 Accepts]: Start accepts. Automaton has 266 states and 392 transitions. Word has length 111
[2024-11-08 10:27:26,266 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:26,267 INFO  L471      AbstractCegarLoop]: Abstraction has 266 states and 392 transitions.
[2024-11-08 10:27:26,267 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:26,267 INFO  L276                IsEmpty]: Start isEmpty. Operand 266 states and 392 transitions.
[2024-11-08 10:27:26,271 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2024-11-08 10:27:26,271 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:26,271 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:26,272 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 10:27:26,272 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:26,272 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:26,273 INFO  L85        PathProgramCache]: Analyzing trace with hash -163687658, now seen corresponding path program 1 times
[2024-11-08 10:27:26,273 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:26,273 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449840516]
[2024-11-08 10:27:26,273 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:26,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:26,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:26,426 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 10:27:26,427 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:26,427 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449840516]
[2024-11-08 10:27:26,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449840516] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:26,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:26,428 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 10:27:26,428 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129671586]
[2024-11-08 10:27:26,428 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:26,436 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:26,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:26,437 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:26,438 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:26,438 INFO  L87              Difference]: Start difference. First operand 266 states and 392 transitions. Second operand  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:26,883 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:26,884 INFO  L93              Difference]: Finished difference Result 792 states and 1171 transitions.
[2024-11-08 10:27:26,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:26,885 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116
[2024-11-08 10:27:26,885 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:26,887 INFO  L225             Difference]: With dead ends: 792
[2024-11-08 10:27:26,888 INFO  L226             Difference]: Without dead ends: 528
[2024-11-08 10:27:26,889 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-08 10:27:26,890 INFO  L432           NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:26,891 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:26,892 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2024-11-08 10:27:26,920 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2024-11-08 10:27:26,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 528 states, 527 states have (on average 1.413662239089184) internal successors, (745), 527 states have internal predecessors, (745), 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-08 10:27:26,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions.
[2024-11-08 10:27:26,926 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 116
[2024-11-08 10:27:26,926 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:26,927 INFO  L471      AbstractCegarLoop]: Abstraction has 528 states and 745 transitions.
[2024-11-08 10:27:26,927 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:26,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions.
[2024-11-08 10:27:26,931 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2024-11-08 10:27:26,931 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:26,932 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:26,932 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 10:27:26,932 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:26,933 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:26,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -390312305, now seen corresponding path program 1 times
[2024-11-08 10:27:26,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:26,933 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152308914]
[2024-11-08 10:27:26,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:26,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:26,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:27,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 10:27:27,168 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:27,168 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152308914]
[2024-11-08 10:27:27,168 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152308914] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:27,169 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:27,169 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 10:27:27,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199903149]
[2024-11-08 10:27:27,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:27,170 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:27,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:27,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:27,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:27,171 INFO  L87              Difference]: Start difference. First operand 528 states and 745 transitions. Second operand  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:27,588 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:27,589 INFO  L93              Difference]: Finished difference Result 1447 states and 2032 transitions.
[2024-11-08 10:27:27,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:27,589 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2024-11-08 10:27:27,590 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:27,594 INFO  L225             Difference]: With dead ends: 1447
[2024-11-08 10:27:27,594 INFO  L226             Difference]: Without dead ends: 921
[2024-11-08 10:27:27,595 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-08 10:27:27,596 INFO  L432           NwaCegarLoop]: 51 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:27,597 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 56 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:27,598 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 921 states.
[2024-11-08 10:27:27,623 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 790.
[2024-11-08 10:27:27,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 790 states, 789 states have (on average 1.3219264892268694) internal successors, (1043), 789 states have internal predecessors, (1043), 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-08 10:27:27,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1043 transitions.
[2024-11-08 10:27:27,626 INFO  L78                 Accepts]: Start accepts. Automaton has 790 states and 1043 transitions. Word has length 126
[2024-11-08 10:27:27,626 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:27,626 INFO  L471      AbstractCegarLoop]: Abstraction has 790 states and 1043 transitions.
[2024-11-08 10:27:27,627 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:27,627 INFO  L276                IsEmpty]: Start isEmpty. Operand 790 states and 1043 transitions.
[2024-11-08 10:27:27,628 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2024-11-08 10:27:27,629 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:27,629 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:27,629 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 10:27:27,629 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:27,630 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:27,630 INFO  L85        PathProgramCache]: Analyzing trace with hash 1566292639, now seen corresponding path program 1 times
[2024-11-08 10:27:27,630 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:27,630 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468238743]
[2024-11-08 10:27:27,630 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:27,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:27,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:27,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-08 10:27:27,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:27,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468238743]
[2024-11-08 10:27:27,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468238743] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:27,823 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:27,823 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 10:27:27,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939539027]
[2024-11-08 10:27:27,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:27,824 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:27,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:27,824 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:27,825 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:27,825 INFO  L87              Difference]: Start difference. First operand 790 states and 1043 transitions. Second operand  has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:28,215 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:28,215 INFO  L93              Difference]: Finished difference Result 1840 states and 2437 transitions.
[2024-11-08 10:27:28,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:28,216 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127
[2024-11-08 10:27:28,216 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:28,220 INFO  L225             Difference]: With dead ends: 1840
[2024-11-08 10:27:28,220 INFO  L226             Difference]: Without dead ends: 1052
[2024-11-08 10:27:28,221 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-08 10:27:28,222 INFO  L432           NwaCegarLoop]: 69 mSDtfsCounter, 127 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:28,222 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 74 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:28,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1052 states.
[2024-11-08 10:27:28,236 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921.
[2024-11-08 10:27:28,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 921 states, 920 states have (on average 1.2891304347826087) internal successors, (1186), 920 states have internal predecessors, (1186), 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-08 10:27:28,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1186 transitions.
[2024-11-08 10:27:28,240 INFO  L78                 Accepts]: Start accepts. Automaton has 921 states and 1186 transitions. Word has length 127
[2024-11-08 10:27:28,240 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:28,241 INFO  L471      AbstractCegarLoop]: Abstraction has 921 states and 1186 transitions.
[2024-11-08 10:27:28,241 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:28,241 INFO  L276                IsEmpty]: Start isEmpty. Operand 921 states and 1186 transitions.
[2024-11-08 10:27:28,243 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2024-11-08 10:27:28,243 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:28,243 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:28,243 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 10:27:28,243 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:28,244 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:28,244 INFO  L85        PathProgramCache]: Analyzing trace with hash 186858855, now seen corresponding path program 1 times
[2024-11-08 10:27:28,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:28,244 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140402054]
[2024-11-08 10:27:28,244 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:28,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:28,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:28,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-08 10:27:28,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:28,429 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140402054]
[2024-11-08 10:27:28,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140402054] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:28,429 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:28,429 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 10:27:28,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22024358]
[2024-11-08 10:27:28,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:28,430 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:28,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:28,431 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:28,431 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:28,431 INFO  L87              Difference]: Start difference. First operand 921 states and 1186 transitions. Second operand  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:28,849 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:28,849 INFO  L93              Difference]: Finished difference Result 2102 states and 2723 transitions.
[2024-11-08 10:27:28,849 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:28,850 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131
[2024-11-08 10:27:28,850 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:28,854 INFO  L225             Difference]: With dead ends: 2102
[2024-11-08 10:27:28,854 INFO  L226             Difference]: Without dead ends: 1183
[2024-11-08 10:27:28,856 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-08 10:27:28,857 INFO  L432           NwaCegarLoop]: 56 mSDtfsCounter, 130 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:28,861 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 60 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:28,863 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1183 states.
[2024-11-08 10:27:28,881 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183.
[2024-11-08 10:27:28,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1183 states, 1182 states have (on average 1.2614213197969544) internal successors, (1491), 1182 states have internal predecessors, (1491), 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-08 10:27:28,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1491 transitions.
[2024-11-08 10:27:28,886 INFO  L78                 Accepts]: Start accepts. Automaton has 1183 states and 1491 transitions. Word has length 131
[2024-11-08 10:27:28,887 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:28,887 INFO  L471      AbstractCegarLoop]: Abstraction has 1183 states and 1491 transitions.
[2024-11-08 10:27:28,888 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:28,888 INFO  L276                IsEmpty]: Start isEmpty. Operand 1183 states and 1491 transitions.
[2024-11-08 10:27:28,890 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-11-08 10:27:28,890 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:28,890 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:28,891 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 10:27:28,891 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:28,892 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:28,892 INFO  L85        PathProgramCache]: Analyzing trace with hash -350047557, now seen corresponding path program 1 times
[2024-11-08 10:27:28,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:28,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215798715]
[2024-11-08 10:27:28,893 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:28,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:28,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:29,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-08 10:27:29,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:29,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215798715]
[2024-11-08 10:27:29,151 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215798715] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:29,151 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:29,152 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:29,152 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567360907]
[2024-11-08 10:27:29,152 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:29,153 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 10:27:29,153 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:29,153 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 10:27:29,154 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:27:29,154 INFO  L87              Difference]: Start difference. First operand 1183 states and 1491 transitions. Second operand  has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:29,822 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:29,823 INFO  L93              Difference]: Finished difference Result 2888 states and 3588 transitions.
[2024-11-08 10:27:29,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 10:27:29,823 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160
[2024-11-08 10:27:29,824 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:29,830 INFO  L225             Difference]: With dead ends: 2888
[2024-11-08 10:27:29,831 INFO  L226             Difference]: Without dead ends: 1576
[2024-11-08 10:27:29,832 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:27:29,833 INFO  L432           NwaCegarLoop]: 29 mSDtfsCounter, 274 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:29,833 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 39 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 10:27:29,835 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2024-11-08 10:27:29,854 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576.
[2024-11-08 10:27:29,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1576 states, 1575 states have (on average 1.135873015873016) internal successors, (1789), 1575 states have internal predecessors, (1789), 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-08 10:27:29,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1789 transitions.
[2024-11-08 10:27:29,860 INFO  L78                 Accepts]: Start accepts. Automaton has 1576 states and 1789 transitions. Word has length 160
[2024-11-08 10:27:29,860 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:29,860 INFO  L471      AbstractCegarLoop]: Abstraction has 1576 states and 1789 transitions.
[2024-11-08 10:27:29,861 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:29,861 INFO  L276                IsEmpty]: Start isEmpty. Operand 1576 states and 1789 transitions.
[2024-11-08 10:27:29,864 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-08 10:27:29,864 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:29,864 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:29,864 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 10:27:29,865 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:29,865 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:29,865 INFO  L85        PathProgramCache]: Analyzing trace with hash -917422874, now seen corresponding path program 1 times
[2024-11-08 10:27:29,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:29,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634019558]
[2024-11-08 10:27:29,866 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:29,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:29,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:30,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked.
[2024-11-08 10:27:30,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:30,128 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634019558]
[2024-11-08 10:27:30,129 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634019558] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:30,129 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:30,129 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:30,129 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376004068]
[2024-11-08 10:27:30,129 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:30,130 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 10:27:30,130 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:30,130 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 10:27:30,130 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:27:30,131 INFO  L87              Difference]: Start difference. First operand 1576 states and 1789 transitions. Second operand  has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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-08 10:27:30,649 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:30,649 INFO  L93              Difference]: Finished difference Result 3412 states and 3900 transitions.
[2024-11-08 10:27:30,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 10:27:30,650 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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-08 10:27:30,653 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:30,658 INFO  L225             Difference]: With dead ends: 3412
[2024-11-08 10:27:30,659 INFO  L226             Difference]: Without dead ends: 1838
[2024-11-08 10:27:30,661 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:27:30,662 INFO  L432           NwaCegarLoop]: 34 mSDtfsCounter, 374 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:30,662 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 42 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 10:27:30,665 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-08 10:27:30,689 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838.
[2024-11-08 10:27:30,693 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1838 states, 1837 states have (on average 1.1377245508982037) internal successors, (2090), 1837 states have internal predecessors, (2090), 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-08 10:27:30,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2090 transitions.
[2024-11-08 10:27:30,698 INFO  L78                 Accepts]: Start accepts. Automaton has 1838 states and 2090 transitions. Word has length 177
[2024-11-08 10:27:30,698 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:30,698 INFO  L471      AbstractCegarLoop]: Abstraction has 1838 states and 2090 transitions.
[2024-11-08 10:27:30,699 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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-08 10:27:30,699 INFO  L276                IsEmpty]: Start isEmpty. Operand 1838 states and 2090 transitions.
[2024-11-08 10:27:30,702 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-08 10:27:30,702 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:30,702 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 10:27:30,703 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 10:27:30,703 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:30,703 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:30,703 INFO  L85        PathProgramCache]: Analyzing trace with hash 1781562584, now seen corresponding path program 1 times
[2024-11-08 10:27:30,703 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:30,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882163789]
[2024-11-08 10:27:30,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:30,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:30,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:30,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 95 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-08 10:27:30,943 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:30,943 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882163789]
[2024-11-08 10:27:30,943 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882163789] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:30,943 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:30,943 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 10:27:30,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12803730]
[2024-11-08 10:27:30,943 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:30,944 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 10:27:30,944 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:30,944 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 10:27:30,944 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:27:30,945 INFO  L87              Difference]: Start difference. First operand 1838 states and 2090 transitions. Second operand  has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:31,548 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:31,548 INFO  L93              Difference]: Finished difference Result 3936 states and 4451 transitions.
[2024-11-08 10:27:31,549 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 10:27:31,549 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177
[2024-11-08 10:27:31,549 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:31,556 INFO  L225             Difference]: With dead ends: 3936
[2024-11-08 10:27:31,556 INFO  L226             Difference]: Without dead ends: 2100
[2024-11-08 10:27:31,558 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:27:31,561 INFO  L432           NwaCegarLoop]: 22 mSDtfsCounter, 222 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:31,561 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 32 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 10:27:31,563 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2100 states.
[2024-11-08 10:27:31,588 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838.
[2024-11-08 10:27:31,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1838 states, 1837 states have (on average 1.120304844855743) internal successors, (2058), 1837 states have internal predecessors, (2058), 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-08 10:27:31,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2058 transitions.
[2024-11-08 10:27:31,593 INFO  L78                 Accepts]: Start accepts. Automaton has 1838 states and 2058 transitions. Word has length 177
[2024-11-08 10:27:31,594 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:31,595 INFO  L471      AbstractCegarLoop]: Abstraction has 1838 states and 2058 transitions.
[2024-11-08 10:27:31,595 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:31,595 INFO  L276                IsEmpty]: Start isEmpty. Operand 1838 states and 2058 transitions.
[2024-11-08 10:27:31,598 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2024-11-08 10:27:31,598 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:31,598 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-08 10:27:31,599 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 10:27:31,599 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:31,599 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:31,599 INFO  L85        PathProgramCache]: Analyzing trace with hash -213833625, now seen corresponding path program 1 times
[2024-11-08 10:27:31,599 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:31,600 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895046883]
[2024-11-08 10:27:31,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:31,600 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:31,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:31,755 INFO  L134       CoverageAnalysis]: Checked inductivity of 119 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 10:27:31,755 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:31,755 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895046883]
[2024-11-08 10:27:31,755 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895046883] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:31,755 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:31,756 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:31,756 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725492191]
[2024-11-08 10:27:31,756 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:31,756 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:31,756 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:31,757 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:31,757 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:31,757 INFO  L87              Difference]: Start difference. First operand 1838 states and 2058 transitions. Second operand  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-08 10:27:32,088 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:32,089 INFO  L93              Difference]: Finished difference Result 3936 states and 4387 transitions.
[2024-11-08 10:27:32,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:32,094 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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 195
[2024-11-08 10:27:32,094 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:32,100 INFO  L225             Difference]: With dead ends: 3936
[2024-11-08 10:27:32,100 INFO  L226             Difference]: Without dead ends: 2100
[2024-11-08 10:27:32,102 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-08 10:27:32,104 INFO  L432           NwaCegarLoop]: 172 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:32,105 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 177 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 10:27:32,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2100 states.
[2024-11-08 10:27:32,138 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969.
[2024-11-08 10:27:32,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1969 states, 1968 states have (on average 1.0965447154471544) internal successors, (2158), 1968 states have internal predecessors, (2158), 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-08 10:27:32,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2158 transitions.
[2024-11-08 10:27:32,145 INFO  L78                 Accepts]: Start accepts. Automaton has 1969 states and 2158 transitions. Word has length 195
[2024-11-08 10:27:32,145 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:32,145 INFO  L471      AbstractCegarLoop]: Abstraction has 1969 states and 2158 transitions.
[2024-11-08 10:27:32,146 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-08 10:27:32,146 INFO  L276                IsEmpty]: Start isEmpty. Operand 1969 states and 2158 transitions.
[2024-11-08 10:27:32,149 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 218
[2024-11-08 10:27:32,149 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:32,149 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:32,150 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 10:27:32,150 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:32,150 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:32,150 INFO  L85        PathProgramCache]: Analyzing trace with hash -1426363216, now seen corresponding path program 1 times
[2024-11-08 10:27:32,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:32,150 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141493003]
[2024-11-08 10:27:32,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:32,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:32,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:32,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked.
[2024-11-08 10:27:32,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:32,346 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141493003]
[2024-11-08 10:27:32,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141493003] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:32,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:32,346 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 10:27:32,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809058280]
[2024-11-08 10:27:32,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:32,346 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:32,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:32,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:32,347 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:32,347 INFO  L87              Difference]: Start difference. First operand 1969 states and 2158 transitions. Second operand  has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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-08 10:27:32,675 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:32,675 INFO  L93              Difference]: Finished difference Result 2626 states and 2855 transitions.
[2024-11-08 10:27:32,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:32,676 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 217
[2024-11-08 10:27:32,676 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:32,683 INFO  L225             Difference]: With dead ends: 2626
[2024-11-08 10:27:32,684 INFO  L226             Difference]: Without dead ends: 2624
[2024-11-08 10:27:32,684 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-08 10:27:32,685 INFO  L432           NwaCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:32,685 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 30 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 10:27:32,688 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2624 states.
[2024-11-08 10:27:32,715 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1969.
[2024-11-08 10:27:32,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1969 states, 1968 states have (on average 1.0955284552845528) internal successors, (2156), 1968 states have internal predecessors, (2156), 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-08 10:27:32,721 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2156 transitions.
[2024-11-08 10:27:32,721 INFO  L78                 Accepts]: Start accepts. Automaton has 1969 states and 2156 transitions. Word has length 217
[2024-11-08 10:27:32,721 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:32,721 INFO  L471      AbstractCegarLoop]: Abstraction has 1969 states and 2156 transitions.
[2024-11-08 10:27:32,722 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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-08 10:27:32,722 INFO  L276                IsEmpty]: Start isEmpty. Operand 1969 states and 2156 transitions.
[2024-11-08 10:27:32,726 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 282
[2024-11-08 10:27:32,726 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:32,726 INFO  L215           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:32,727 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-08 10:27:32,727 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:32,727 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:32,727 INFO  L85        PathProgramCache]: Analyzing trace with hash -1908530202, now seen corresponding path program 1 times
[2024-11-08 10:27:32,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:32,728 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326470564]
[2024-11-08 10:27:32,728 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:32,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:32,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:33,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 407 backedges. 256 proven. 142 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-11-08 10:27:33,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:33,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326470564]
[2024-11-08 10:27:33,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326470564] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 10:27:33,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490920982]
[2024-11-08 10:27:33,486 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:33,486 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 10:27:33,486 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 10:27:33,488 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 10:27:33,489 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 10:27:33,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:33,659 INFO  L255         TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 10:27:33,674 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 10:27:33,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 407 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked.
[2024-11-08 10:27:33,901 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 10:27:33,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [490920982] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:33,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 10:27:33,901 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7
[2024-11-08 10:27:33,901 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769686197]
[2024-11-08 10:27:33,901 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:33,902 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:33,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:33,902 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:33,902 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-08 10:27:33,903 INFO  L87              Difference]: Start difference. First operand 1969 states and 2156 transitions. Second operand  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-08 10:27:34,263 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:34,263 INFO  L93              Difference]: Finished difference Result 4327 states and 4718 transitions.
[2024-11-08 10:27:34,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:34,263 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 281
[2024-11-08 10:27:34,264 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:34,264 INFO  L225             Difference]: With dead ends: 4327
[2024-11-08 10:27:34,264 INFO  L226             Difference]: Without dead ends: 0
[2024-11-08 10:27:34,268 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-08 10:27:34,268 INFO  L432           NwaCegarLoop]: 164 mSDtfsCounter, 28 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:34,268 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 169 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 10:27:34,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-08 10:27:34,269 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-08 10:27:34,269 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-08 10:27:34,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-08 10:27:34,269 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281
[2024-11-08 10:27:34,269 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:34,269 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-08 10:27:34,270 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-08 10:27:34,270 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-08 10:27:34,270 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-08 10:27:34,272 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 10:27:34,291 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-08 10:27:34,476 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2024-11-08 10:27:34,480 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:34,482 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-08 10:27:34,654 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 10:27:34,672 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:27:34 BoogieIcfgContainer
[2024-11-08 10:27:34,672 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 10:27:34,674 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 10:27:34,674 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-08 10:27:34,674 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-08 10:27:34,675 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:24" (3/4) ...
[2024-11-08 10:27:34,677 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-08 10:27:34,695 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-08 10:27:34,697 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-08 10:27:34,697 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-08 10:27:34,698 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-08 10:27:34,857 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-08 10:27:34,859 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-08 10:27:34,859 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 10:27:34,860 INFO  L158              Benchmark]: Toolchain (without parser) took 12127.68ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 97.7MB in the beginning and 265.8MB in the end (delta: -168.1MB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB.
[2024-11-08 10:27:34,860 INFO  L158              Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 10:27:34,860 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 620.55ms. Allocated memory is still 165.7MB. Free memory was 97.5MB in the beginning and 118.2MB in the end (delta: -20.7MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB.
[2024-11-08 10:27:34,861 INFO  L158              Benchmark]: Boogie Procedure Inliner took 79.56ms. Allocated memory is still 165.7MB. Free memory was 118.2MB in the beginning and 112.6MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 10:27:34,861 INFO  L158              Benchmark]: Boogie Preprocessor took 111.74ms. Allocated memory is still 165.7MB. Free memory was 112.6MB in the beginning and 107.1MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-08 10:27:34,862 INFO  L158              Benchmark]: RCFGBuilder took 1153.26ms. Allocated memory is still 165.7MB. Free memory was 107.1MB in the beginning and 106.6MB in the end (delta: 516.7kB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB.
[2024-11-08 10:27:34,862 INFO  L158              Benchmark]: TraceAbstraction took 9970.18ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 106.6MB in the beginning and 98.2MB in the end (delta: 8.4MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB.
[2024-11-08 10:27:34,862 INFO  L158              Benchmark]: Witness Printer took 185.76ms. Allocated memory is still 310.4MB. Free memory was 98.2MB in the beginning and 265.8MB in the end (delta: -167.6MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB.
[2024-11-08 10:27:34,864 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.21ms. Allocated memory is still 109.1MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 620.55ms. Allocated memory is still 165.7MB. Free memory was 97.5MB in the beginning and 118.2MB in the end (delta: -20.7MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 79.56ms. Allocated memory is still 165.7MB. Free memory was 118.2MB in the beginning and 112.6MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 111.74ms. Allocated memory is still 165.7MB. Free memory was 112.6MB in the beginning and 107.1MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1153.26ms. Allocated memory is still 165.7MB. Free memory was 107.1MB in the beginning and 106.6MB in the end (delta: 516.7kB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 9970.18ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 106.6MB in the beginning and 98.2MB in the end (delta: 8.4MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB.
 * Witness Printer took 185.76ms. Allocated memory is still 310.4MB. Free memory was 98.2MB in the beginning and 265.8MB in the end (delta: -167.6MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 519]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1663 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1663 mSDsluCounter, 752 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 815 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4228 IncrementalHoareTripleChecker+Invalid, 5043 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 815 mSolverCounterUnsat, 683 mSDtfsCounter, 4228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=9, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2099 NumberOfCodeBlocks, 2099 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2087 ConstructedInterpolants, 0 QuantifiedInterpolants, 5232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 516 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1268/1410 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 593]: Loop Invariant
    Derived loop invariant: (((((a21 == 1) && (a16 <= 5)) || (a8 <= 13)) || ((a21 == 1) && (15 <= a8))) || ((a21 == 1) && (a20 == 1)))
RESULT: Ultimate proved your program to be correct!
[2024-11-08 10:27:34,895 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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