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


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


Checking for ERROR reachability
Using default analysis
Version 3061b6dc
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_label34.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 734ea858638864cf111875fb6688bf68ceb15644fd98461d3cd9d71a49a35f2c
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-18 09:37:22,570 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-18 09:37:22,650 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-18 09:37:22,656 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-18 09:37:22,658 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-18 09:37:22,701 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-18 09:37:22,703 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-18 09:37:22,703 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-18 09:37:22,704 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-18 09:37:22,705 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-18 09:37:22,705 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-18 09:37:22,706 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-18 09:37:22,706 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-18 09:37:22,708 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-18 09:37:22,708 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-18 09:37:22,709 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-18 09:37:22,709 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-18 09:37:22,709 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-18 09:37:22,710 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-18 09:37:22,710 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-18 09:37:22,710 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-18 09:37:22,714 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-18 09:37:22,715 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-18 09:37:22,715 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-18 09:37:22,715 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-18 09:37:22,715 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-18 09:37:22,716 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-18 09:37:22,716 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-18 09:37:22,717 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-18 09:37:22,717 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-18 09:37:22,717 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-18 09:37:22,718 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-18 09:37:22,718 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-18 09:37:22,718 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-18 09:37:22,719 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-18 09:37:22,719 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-18 09:37:22,719 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-18 09:37:22,720 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-18 09:37:22,720 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-18 09:37:22,720 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-18 09:37:22,721 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-18 09:37:22,721 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-18 09:37:22,721 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 -> 734ea858638864cf111875fb6688bf68ceb15644fd98461d3cd9d71a49a35f2c
[2024-11-18 09:37:22,987 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-18 09:37:23,014 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-18 09:37:23,018 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-18 09:37:23,019 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-18 09:37:23,019 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-18 09:37:23,020 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label34.c
[2024-11-18 09:37:24,453 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-18 09:37:24,722 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-18 09:37:24,724 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label34.c
[2024-11-18 09:37:24,743 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fe60682/8af926788ace46568cb27aa44c096a3b/FLAGdfec64909
[2024-11-18 09:37:25,031 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fe60682/8af926788ace46568cb27aa44c096a3b
[2024-11-18 09:37:25,033 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-18 09:37:25,034 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-18 09:37:25,037 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-18 09:37:25,037 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-18 09:37:25,042 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-18 09:37:25,043 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,044 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c86cd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25, skipping insertion in model container
[2024-11-18 09:37:25,044 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,098 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-18 09:37:25,447 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_label34.c[18605,18618]
[2024-11-18 09:37:25,482 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-18 09:37:25,501 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-18 09:37:25,557 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_label34.c[18605,18618]
[2024-11-18 09:37:25,568 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-18 09:37:25,586 INFO  L204         MainTranslator]: Completed translation
[2024-11-18 09:37:25,587 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25 WrapperNode
[2024-11-18 09:37:25,587 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-18 09:37:25,588 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-18 09:37:25,589 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-18 09:37:25,589 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-18 09:37:25,595 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,617 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,675 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658
[2024-11-18 09:37:25,676 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-18 09:37:25,677 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-18 09:37:25,677 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-18 09:37:25,677 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-18 09:37:25,687 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,687 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,691 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,733 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-18 09:37:25,734 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,734 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,763 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,771 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,777 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,783 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,790 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-18 09:37:25,792 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-18 09:37:25,793 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-18 09:37:25,793 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-18 09:37:25,794 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (1/1) ...
[2024-11-18 09:37:25,799 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-18 09:37:25,811 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 09:37:25,827 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-18 09:37:25,832 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-18 09:37:25,886 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-18 09:37:25,887 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-18 09:37:25,887 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-18 09:37:25,888 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-18 09:37:25,976 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-18 09:37:25,978 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-18 09:37:26,929 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2024-11-18 09:37:26,930 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-18 09:37:26,953 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-18 09:37:26,954 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-18 09:37:26,955 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:37:26 BoogieIcfgContainer
[2024-11-18 09:37:26,955 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-18 09:37:26,957 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-18 09:37:26,957 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-18 09:37:26,961 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-18 09:37:26,961 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:37:25" (1/3) ...
[2024-11-18 09:37:26,962 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f34d277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:37:26, skipping insertion in model container
[2024-11-18 09:37:26,962 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:25" (2/3) ...
[2024-11-18 09:37:26,962 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f34d277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:37:26, skipping insertion in model container
[2024-11-18 09:37:26,963 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:37:26" (3/3) ...
[2024-11-18 09:37:26,964 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem01_label34.c
[2024-11-18 09:37:26,985 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-18 09:37:26,985 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-18 09:37:27,090 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-18 09:37:27,099 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;@25bc41ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-18 09:37:27,100 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-18 09:37:27,105 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-18 09:37:27,118 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2024-11-18 09:37:27,118 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:27,119 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]
[2024-11-18 09:37:27,119 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:27,124 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:27,124 INFO  L85        PathProgramCache]: Analyzing trace with hash 1487053686, now seen corresponding path program 1 times
[2024-11-18 09:37:27,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:27,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631674889]
[2024-11-18 09:37:27,135 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:27,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:27,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:27,655 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-18 09:37:27,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:27,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631674889]
[2024-11-18 09:37:27,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631674889] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:27,658 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:27,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 09:37:27,660 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225539545]
[2024-11-18 09:37:27,661 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:27,666 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:27,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:27,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:27,693 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:27,698 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 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-18 09:37:28,449 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:28,449 INFO  L93              Difference]: Finished difference Result 528 states and 915 transitions.
[2024-11-18 09:37:28,452 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:28,453 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105
[2024-11-18 09:37:28,454 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:28,466 INFO  L225             Difference]: With dead ends: 528
[2024-11-18 09:37:28,467 INFO  L226             Difference]: Without dead ends: 266
[2024-11-18 09:37:28,473 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-18 09:37:28,478 INFO  L432           NwaCegarLoop]: 65 mSDtfsCounter, 77 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:28,479 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 73 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-18 09:37:28,498 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2024-11-18 09:37:28,535 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266.
[2024-11-18 09:37:28,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 266 states, 265 states have (on average 1.411320754716981) internal successors, (374), 265 states have internal predecessors, (374), 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-18 09:37:28,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions.
[2024-11-18 09:37:28,541 INFO  L78                 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 105
[2024-11-18 09:37:28,542 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:28,543 INFO  L471      AbstractCegarLoop]: Abstraction has 266 states and 374 transitions.
[2024-11-18 09:37:28,543 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-18 09:37:28,543 INFO  L276                IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions.
[2024-11-18 09:37:28,548 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2024-11-18 09:37:28,548 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:28,549 INFO  L215           NwaCegarLoop]: trace histogram [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-18 09:37:28,549 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-18 09:37:28,549 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:28,550 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:28,550 INFO  L85        PathProgramCache]: Analyzing trace with hash -944739266, now seen corresponding path program 1 times
[2024-11-18 09:37:28,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:28,551 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104041407]
[2024-11-18 09:37:28,551 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:28,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:28,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:28,786 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-18 09:37:28,787 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:28,787 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104041407]
[2024-11-18 09:37:28,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104041407] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:28,787 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:28,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 09:37:28,788 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206148408]
[2024-11-18 09:37:28,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:28,793 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:28,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:28,794 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:28,794 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:28,794 INFO  L87              Difference]: Start difference. First operand 266 states and 374 transitions. Second operand  has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-18 09:37:29,218 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:29,219 INFO  L93              Difference]: Finished difference Result 792 states and 1117 transitions.
[2024-11-18 09:37:29,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:29,220 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 109
[2024-11-18 09:37:29,221 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:29,224 INFO  L225             Difference]: With dead ends: 792
[2024-11-18 09:37:29,224 INFO  L226             Difference]: Without dead ends: 528
[2024-11-18 09:37:29,225 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-18 09:37:29,226 INFO  L432           NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:29,227 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 31 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-18 09:37:29,228 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2024-11-18 09:37:29,253 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2024-11-18 09:37:29,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 528 states, 527 states have (on average 1.366223908918406) internal successors, (720), 527 states have internal predecessors, (720), 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-18 09:37:29,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions.
[2024-11-18 09:37:29,258 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 109
[2024-11-18 09:37:29,258 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:29,259 INFO  L471      AbstractCegarLoop]: Abstraction has 528 states and 720 transitions.
[2024-11-18 09:37:29,259 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-18 09:37:29,259 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions.
[2024-11-18 09:37:29,262 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2024-11-18 09:37:29,262 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:29,263 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]
[2024-11-18 09:37:29,263 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-18 09:37:29,263 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:29,264 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:29,264 INFO  L85        PathProgramCache]: Analyzing trace with hash 2090027166, now seen corresponding path program 1 times
[2024-11-18 09:37:29,264 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:29,265 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813770954]
[2024-11-18 09:37:29,265 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:29,265 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:29,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:29,399 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-18 09:37:29,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:29,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813770954]
[2024-11-18 09:37:29,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813770954] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:29,401 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:29,401 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 09:37:29,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371758553]
[2024-11-18 09:37:29,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:29,402 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:29,402 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:29,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:29,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:29,403 INFO  L87              Difference]: Start difference. First operand 528 states and 720 transitions. Second operand  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 09:37:29,810 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:29,811 INFO  L93              Difference]: Finished difference Result 1447 states and 1957 transitions.
[2024-11-18 09:37:29,811 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:29,812 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110
[2024-11-18 09:37:29,812 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:29,816 INFO  L225             Difference]: With dead ends: 1447
[2024-11-18 09:37:29,816 INFO  L226             Difference]: Without dead ends: 921
[2024-11-18 09:37:29,817 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-18 09:37:29,818 INFO  L432           NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:29,819 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 29 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-18 09:37:29,820 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 921 states.
[2024-11-18 09:37:29,841 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921.
[2024-11-18 09:37:29,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 921 states, 920 states have (on average 1.2684782608695653) internal successors, (1167), 920 states have internal predecessors, (1167), 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-18 09:37:29,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1167 transitions.
[2024-11-18 09:37:29,845 INFO  L78                 Accepts]: Start accepts. Automaton has 921 states and 1167 transitions. Word has length 110
[2024-11-18 09:37:29,846 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:29,846 INFO  L471      AbstractCegarLoop]: Abstraction has 921 states and 1167 transitions.
[2024-11-18 09:37:29,846 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 09:37:29,846 INFO  L276                IsEmpty]: Start isEmpty. Operand 921 states and 1167 transitions.
[2024-11-18 09:37:29,850 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2024-11-18 09:37:29,851 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:29,851 INFO  L215           NwaCegarLoop]: trace histogram [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]
[2024-11-18 09:37:29,851 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-18 09:37:29,851 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:29,852 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:29,852 INFO  L85        PathProgramCache]: Analyzing trace with hash 1644450848, now seen corresponding path program 1 times
[2024-11-18 09:37:29,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:29,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510680665]
[2024-11-18 09:37:29,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:29,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:29,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:30,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 09:37:30,013 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:30,014 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510680665]
[2024-11-18 09:37:30,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510680665] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:30,014 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:30,014 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 09:37:30,014 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748032822]
[2024-11-18 09:37:30,014 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:30,015 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:30,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:30,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:30,018 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:30,018 INFO  L87              Difference]: Start difference. First operand 921 states and 1167 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-18 09:37:30,453 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:30,454 INFO  L93              Difference]: Finished difference Result 2495 states and 3150 transitions.
[2024-11-18 09:37:30,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:30,454 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 118
[2024-11-18 09:37:30,454 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:30,460 INFO  L225             Difference]: With dead ends: 2495
[2024-11-18 09:37:30,460 INFO  L226             Difference]: Without dead ends: 1576
[2024-11-18 09:37:30,464 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-18 09:37:30,465 INFO  L432           NwaCegarLoop]: 26 mSDtfsCounter, 135 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:30,467 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 31 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-18 09:37:30,471 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2024-11-18 09:37:30,499 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1183.
[2024-11-18 09:37:30,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1183 states, 1182 states have (on average 1.2597292724196278) internal successors, (1489), 1182 states have internal predecessors, (1489), 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-18 09:37:30,504 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1489 transitions.
[2024-11-18 09:37:30,508 INFO  L78                 Accepts]: Start accepts. Automaton has 1183 states and 1489 transitions. Word has length 118
[2024-11-18 09:37:30,508 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:30,509 INFO  L471      AbstractCegarLoop]: Abstraction has 1183 states and 1489 transitions.
[2024-11-18 09:37:30,509 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-18 09:37:30,509 INFO  L276                IsEmpty]: Start isEmpty. Operand 1183 states and 1489 transitions.
[2024-11-18 09:37:30,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2024-11-18 09:37:30,516 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:30,516 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]
[2024-11-18 09:37:30,516 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-18 09:37:30,516 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:30,517 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:30,517 INFO  L85        PathProgramCache]: Analyzing trace with hash -1047311641, now seen corresponding path program 1 times
[2024-11-18 09:37:30,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:30,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706274481]
[2024-11-18 09:37:30,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:30,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:30,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:30,697 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-18 09:37:30,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:30,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706274481]
[2024-11-18 09:37:30,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706274481] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:30,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:30,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 09:37:30,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860906879]
[2024-11-18 09:37:30,699 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:30,699 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:30,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:30,700 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:30,700 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:30,701 INFO  L87              Difference]: Start difference. First operand 1183 states and 1489 transitions. Second operand  has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 09:37:31,074 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:31,074 INFO  L93              Difference]: Finished difference Result 2364 states and 2976 transitions.
[2024-11-18 09:37:31,075 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:31,075 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121
[2024-11-18 09:37:31,075 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:31,079 INFO  L225             Difference]: With dead ends: 2364
[2024-11-18 09:37:31,080 INFO  L226             Difference]: Without dead ends: 1183
[2024-11-18 09:37:31,081 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-18 09:37:31,083 INFO  L432           NwaCegarLoop]: 57 mSDtfsCounter, 132 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:31,083 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 62 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-18 09:37:31,085 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1183 states.
[2024-11-18 09:37:31,100 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183.
[2024-11-18 09:37:31,102 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1183 states, 1182 states have (on average 1.2495769881556684) internal successors, (1477), 1182 states have internal predecessors, (1477), 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-18 09:37:31,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1477 transitions.
[2024-11-18 09:37:31,105 INFO  L78                 Accepts]: Start accepts. Automaton has 1183 states and 1477 transitions. Word has length 121
[2024-11-18 09:37:31,105 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:31,105 INFO  L471      AbstractCegarLoop]: Abstraction has 1183 states and 1477 transitions.
[2024-11-18 09:37:31,106 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 09:37:31,106 INFO  L276                IsEmpty]: Start isEmpty. Operand 1183 states and 1477 transitions.
[2024-11-18 09:37:31,108 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-18 09:37:31,108 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:31,108 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]
[2024-11-18 09:37:31,108 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-18 09:37:31,109 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:31,109 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:31,109 INFO  L85        PathProgramCache]: Analyzing trace with hash 818316207, now seen corresponding path program 1 times
[2024-11-18 09:37:31,109 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:31,109 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137573932]
[2024-11-18 09:37:31,110 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:31,110 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:31,141 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:31,312 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-18 09:37:31,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:31,313 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137573932]
[2024-11-18 09:37:31,314 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137573932] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:31,314 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:31,315 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 09:37:31,316 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073270345]
[2024-11-18 09:37:31,316 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:31,316 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:31,316 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:31,317 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:31,318 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:31,318 INFO  L87              Difference]: Start difference. First operand 1183 states and 1477 transitions. Second operand  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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-18 09:37:31,711 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:31,712 INFO  L93              Difference]: Finished difference Result 2364 states and 2952 transitions.
[2024-11-18 09:37:31,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:31,713 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125
[2024-11-18 09:37:31,713 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:31,717 INFO  L225             Difference]: With dead ends: 2364
[2024-11-18 09:37:31,717 INFO  L226             Difference]: Without dead ends: 1183
[2024-11-18 09:37:31,718 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-18 09:37:31,719 INFO  L432           NwaCegarLoop]: 56 mSDtfsCounter, 129 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:31,720 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 61 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-18 09:37:31,721 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1183 states.
[2024-11-18 09:37:31,735 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183.
[2024-11-18 09:37:31,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1183 states, 1182 states have (on average 1.239424703891709) internal successors, (1465), 1182 states have internal predecessors, (1465), 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-18 09:37:31,739 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1465 transitions.
[2024-11-18 09:37:31,740 INFO  L78                 Accepts]: Start accepts. Automaton has 1183 states and 1465 transitions. Word has length 125
[2024-11-18 09:37:31,740 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:31,740 INFO  L471      AbstractCegarLoop]: Abstraction has 1183 states and 1465 transitions.
[2024-11-18 09:37:31,740 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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-18 09:37:31,741 INFO  L276                IsEmpty]: Start isEmpty. Operand 1183 states and 1465 transitions.
[2024-11-18 09:37:31,744 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2024-11-18 09:37:31,744 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:31,744 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:37:31,744 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-18 09:37:31,744 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:31,745 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:31,745 INFO  L85        PathProgramCache]: Analyzing trace with hash -1620071477, now seen corresponding path program 1 times
[2024-11-18 09:37:31,745 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:31,745 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938357265]
[2024-11-18 09:37:31,745 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:31,746 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:31,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:31,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2024-11-18 09:37:31,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:31,951 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938357265]
[2024-11-18 09:37:31,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938357265] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:31,952 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:31,952 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 09:37:31,952 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047570284]
[2024-11-18 09:37:31,953 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:31,953 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:31,953 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:31,954 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:31,954 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:31,954 INFO  L87              Difference]: Start difference. First operand 1183 states and 1465 transitions. Second operand  has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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-18 09:37:32,298 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:32,298 INFO  L93              Difference]: Finished difference Result 2364 states and 2928 transitions.
[2024-11-18 09:37:32,298 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:32,298 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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 150
[2024-11-18 09:37:32,298 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:32,302 INFO  L225             Difference]: With dead ends: 2364
[2024-11-18 09:37:32,302 INFO  L226             Difference]: Without dead ends: 1183
[2024-11-18 09:37:32,303 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-18 09:37:32,304 INFO  L432           NwaCegarLoop]: 57 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:32,304 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 62 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-18 09:37:32,306 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1183 states.
[2024-11-18 09:37:32,318 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183.
[2024-11-18 09:37:32,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1183 states, 1182 states have (on average 1.22419627749577) internal successors, (1447), 1182 states have internal predecessors, (1447), 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-18 09:37:32,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1447 transitions.
[2024-11-18 09:37:32,323 INFO  L78                 Accepts]: Start accepts. Automaton has 1183 states and 1447 transitions. Word has length 150
[2024-11-18 09:37:32,323 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:32,323 INFO  L471      AbstractCegarLoop]: Abstraction has 1183 states and 1447 transitions.
[2024-11-18 09:37:32,324 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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-18 09:37:32,324 INFO  L276                IsEmpty]: Start isEmpty. Operand 1183 states and 1447 transitions.
[2024-11-18 09:37:32,326 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2024-11-18 09:37:32,326 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:32,326 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]
[2024-11-18 09:37:32,326 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-18 09:37:32,327 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:32,327 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:32,327 INFO  L85        PathProgramCache]: Analyzing trace with hash 227379203, now seen corresponding path program 1 times
[2024-11-18 09:37:32,328 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:32,328 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692177999]
[2024-11-18 09:37:32,328 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:32,328 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:32,361 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:32,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2024-11-18 09:37:32,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:32,604 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692177999]
[2024-11-18 09:37:32,604 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692177999] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:32,604 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:32,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 09:37:32,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339002375]
[2024-11-18 09:37:32,605 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:32,605 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-18 09:37:32,606 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:32,606 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-18 09:37:32,606 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-18 09:37:32,607 INFO  L87              Difference]: Start difference. First operand 1183 states and 1447 transitions. Second operand  has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 09:37:33,180 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:33,180 INFO  L93              Difference]: Finished difference Result 2757 states and 3333 transitions.
[2024-11-18 09:37:33,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-18 09:37:33,181 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154
[2024-11-18 09:37:33,183 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:33,188 INFO  L225             Difference]: With dead ends: 2757
[2024-11-18 09:37:33,188 INFO  L226             Difference]: Without dead ends: 1576
[2024-11-18 09:37:33,191 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-18 09:37:33,192 INFO  L432           NwaCegarLoop]: 50 mSDtfsCounter, 245 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:33,193 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 60 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-18 09:37:33,195 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2024-11-18 09:37:33,218 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445.
[2024-11-18 09:37:33,220 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1445 states, 1444 states have (on average 1.2001385041551247) internal successors, (1733), 1444 states have internal predecessors, (1733), 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-18 09:37:33,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1733 transitions.
[2024-11-18 09:37:33,223 INFO  L78                 Accepts]: Start accepts. Automaton has 1445 states and 1733 transitions. Word has length 154
[2024-11-18 09:37:33,224 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:33,224 INFO  L471      AbstractCegarLoop]: Abstraction has 1445 states and 1733 transitions.
[2024-11-18 09:37:33,224 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 09:37:33,224 INFO  L276                IsEmpty]: Start isEmpty. Operand 1445 states and 1733 transitions.
[2024-11-18 09:37:33,227 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-18 09:37:33,227 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:33,227 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]
[2024-11-18 09:37:33,227 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-18 09:37:33,228 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:33,228 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:33,228 INFO  L85        PathProgramCache]: Analyzing trace with hash -1261409312, now seen corresponding path program 1 times
[2024-11-18 09:37:33,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:33,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612135453]
[2024-11-18 09:37:33,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:33,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:33,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:33,511 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-18 09:37:33,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:33,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612135453]
[2024-11-18 09:37:33,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612135453] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:33,512 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:33,512 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-18 09:37:33,512 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343447312]
[2024-11-18 09:37:33,512 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:33,512 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-18 09:37:33,513 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:33,513 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-18 09:37:33,513 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-18 09:37:33,513 INFO  L87              Difference]: Start difference. First operand 1445 states and 1733 transitions. Second operand  has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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-18 09:37:34,169 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:34,170 INFO  L93              Difference]: Finished difference Result 3281 states and 3923 transitions.
[2024-11-18 09:37:34,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-18 09:37:34,170 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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 171
[2024-11-18 09:37:34,171 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:34,176 INFO  L225             Difference]: With dead ends: 3281
[2024-11-18 09:37:34,177 INFO  L226             Difference]: Without dead ends: 1838
[2024-11-18 09:37:34,178 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-18 09:37:34,179 INFO  L432           NwaCegarLoop]: 35 mSDtfsCounter, 224 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:34,180 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 45 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-18 09:37:34,182 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-18 09:37:34,199 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1445.
[2024-11-18 09:37:34,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1445 states, 1444 states have (on average 1.1627423822714682) internal successors, (1679), 1444 states have internal predecessors, (1679), 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-18 09:37:34,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1679 transitions.
[2024-11-18 09:37:34,205 INFO  L78                 Accepts]: Start accepts. Automaton has 1445 states and 1679 transitions. Word has length 171
[2024-11-18 09:37:34,206 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:34,206 INFO  L471      AbstractCegarLoop]: Abstraction has 1445 states and 1679 transitions.
[2024-11-18 09:37:34,207 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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-18 09:37:34,207 INFO  L276                IsEmpty]: Start isEmpty. Operand 1445 states and 1679 transitions.
[2024-11-18 09:37:34,209 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2024-11-18 09:37:34,210 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:34,210 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-18 09:37:34,210 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-18 09:37:34,210 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:34,211 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:34,211 INFO  L85        PathProgramCache]: Analyzing trace with hash -254197553, now seen corresponding path program 1 times
[2024-11-18 09:37:34,211 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:34,211 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846516094]
[2024-11-18 09:37:34,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:34,211 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:34,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:34,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-11-18 09:37:34,418 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:34,418 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846516094]
[2024-11-18 09:37:34,419 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846516094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:34,419 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:34,420 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 09:37:34,420 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628998639]
[2024-11-18 09:37:34,420 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:34,420 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:34,421 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:34,421 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:34,421 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:34,422 INFO  L87              Difference]: Start difference. First operand 1445 states and 1679 transitions. Second operand  has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-18 09:37:34,822 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:34,822 INFO  L93              Difference]: Finished difference Result 3281 states and 3815 transitions.
[2024-11-18 09:37:34,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:34,823 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 198
[2024-11-18 09:37:34,823 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:34,830 INFO  L225             Difference]: With dead ends: 3281
[2024-11-18 09:37:34,830 INFO  L226             Difference]: Without dead ends: 1838
[2024-11-18 09:37:34,832 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-18 09:37:34,833 INFO  L432           NwaCegarLoop]: 186 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:34,834 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 191 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-18 09:37:34,836 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-18 09:37:34,859 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707.
[2024-11-18 09:37:34,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.1447831184056272) internal successors, (1953), 1706 states have internal predecessors, (1953), 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-18 09:37:34,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1953 transitions.
[2024-11-18 09:37:34,866 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 1953 transitions. Word has length 198
[2024-11-18 09:37:34,867 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:34,867 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 1953 transitions.
[2024-11-18 09:37:34,867 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-18 09:37:34,867 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 1953 transitions.
[2024-11-18 09:37:34,870 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 221
[2024-11-18 09:37:34,870 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:34,870 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-18 09:37:34,870 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-18 09:37:34,871 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:34,871 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:34,871 INFO  L85        PathProgramCache]: Analyzing trace with hash -2048283674, now seen corresponding path program 1 times
[2024-11-18 09:37:34,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:34,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554725467]
[2024-11-18 09:37:34,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:34,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:34,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:35,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 177 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2024-11-18 09:37:35,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:35,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554725467]
[2024-11-18 09:37:35,035 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554725467] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:35,035 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:35,035 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 09:37:35,035 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064683904]
[2024-11-18 09:37:35,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:35,036 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:35,036 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:35,037 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:35,037 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:35,037 INFO  L87              Difference]: Start difference. First operand 1707 states and 1953 transitions. Second operand  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-18 09:37:35,403 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:35,403 INFO  L93              Difference]: Finished difference Result 2100 states and 2394 transitions.
[2024-11-18 09:37:35,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:35,405 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 220
[2024-11-18 09:37:35,405 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:35,405 INFO  L225             Difference]: With dead ends: 2100
[2024-11-18 09:37:35,405 INFO  L226             Difference]: Without dead ends: 0
[2024-11-18 09:37:35,407 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-18 09:37:35,408 INFO  L432           NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:35,409 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 28 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-18 09:37:35,409 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-18 09:37:35,409 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-18 09:37:35,409 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-18 09:37:35,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-18 09:37:35,410 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220
[2024-11-18 09:37:35,410 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:35,410 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-18 09:37:35,410 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-18 09:37:35,410 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-18 09:37:35,410 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-18 09:37:35,413 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-18 09:37:35,414 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-18 09:37:35,419 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 09:37:35,422 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-18 09:37:35,510 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-18 09:37:35,528 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:37:35 BoogieIcfgContainer
[2024-11-18 09:37:35,528 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-18 09:37:35,529 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-18 09:37:35,529 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-18 09:37:35,529 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-18 09:37:35,530 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:37:26" (3/4) ...
[2024-11-18 09:37:35,532 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-18 09:37:35,554 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-18 09:37:35,554 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-18 09:37:35,555 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-18 09:37:35,558 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-18 09:37:35,715 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-18 09:37:35,716 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-18 09:37:35,716 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-18 09:37:35,716 INFO  L158              Benchmark]: Toolchain (without parser) took 10682.51ms. Allocated memory was 155.2MB in the beginning and 264.2MB in the end (delta: 109.1MB). Free memory was 100.4MB in the beginning and 122.6MB in the end (delta: -22.2MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB.
[2024-11-18 09:37:35,717 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-18 09:37:35,717 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 550.49ms. Allocated memory is still 155.2MB. Free memory was 100.4MB in the beginning and 70.6MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
[2024-11-18 09:37:35,717 INFO  L158              Benchmark]: Boogie Procedure Inliner took 87.46ms. Allocated memory is still 155.2MB. Free memory was 70.6MB in the beginning and 64.4MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-18 09:37:35,717 INFO  L158              Benchmark]: Boogie Preprocessor took 114.32ms. Allocated memory is still 155.2MB. Free memory was 64.4MB in the beginning and 59.3MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-18 09:37:35,717 INFO  L158              Benchmark]: RCFGBuilder took 1162.64ms. Allocated memory is still 155.2MB. Free memory was 59.3MB in the beginning and 50.5MB in the end (delta: 8.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB.
[2024-11-18 09:37:35,718 INFO  L158              Benchmark]: TraceAbstraction took 8571.39ms. Allocated memory was 155.2MB in the beginning and 264.2MB in the end (delta: 109.1MB). Free memory was 50.0MB in the beginning and 135.2MB in the end (delta: -85.2MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB.
[2024-11-18 09:37:35,718 INFO  L158              Benchmark]: Witness Printer took 186.94ms. Allocated memory is still 264.2MB. Free memory was 134.2MB in the beginning and 122.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-18 09:37:35,719 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 550.49ms. Allocated memory is still 155.2MB. Free memory was 100.4MB in the beginning and 70.6MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 87.46ms. Allocated memory is still 155.2MB. Free memory was 70.6MB in the beginning and 64.4MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 114.32ms. Allocated memory is still 155.2MB. Free memory was 64.4MB in the beginning and 59.3MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1162.64ms. Allocated memory is still 155.2MB. Free memory was 59.3MB in the beginning and 50.5MB in the end (delta: 8.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8571.39ms. Allocated memory was 155.2MB in the beginning and 264.2MB in the end (delta: 109.1MB). Free memory was 50.0MB in the beginning and 135.2MB in the end (delta: -85.2MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB.
 * Witness Printer took 186.94ms. Allocated memory is still 264.2MB. Free memory was 134.2MB in the beginning and 122.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 501]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1403 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1403 mSDsluCounter, 673 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 749 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4166 IncrementalHoareTripleChecker+Invalid, 4915 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 749 mSolverCounterUnsat, 607 mSDtfsCounter, 4166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=10, InterpolantAutomatonStates: 35, 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, 1048 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1581 NumberOfCodeBlocks, 1581 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1570 ConstructedInterpolants, 0 QuantifiedInterpolants, 3270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 629/629 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)) || (a20 == 1)) || (((a16 == 6) && (a7 != 1)) && (a21 == 1))) || ((a17 == 1) && (a16 <= 5)))
RESULT: Ultimate proved your program to be correct!
[2024-11-18 09:37:35,754 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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