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


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


Checking for ERROR reachability
Using default analysis
Version c7c6ca5d
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label52.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 58258448060d1dd7e4bb5d8ae4d59fa53c9505b7e75cc42e4b9e13d20eabdbf0
--- Real Ultimate output ---
This is Ultimate 0.2.5-?-c7c6ca5-m
[2024-11-08 11:12:40,068 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-08 11:12:40,153 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 11:12:40,161 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 11:12:40,162 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 11:12:40,196 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 11:12:40,197 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 11:12:40,197 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 11:12:40,198 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 11:12:40,201 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-08 11:12:40,201 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 11:12:40,202 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 11:12:40,202 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 11:12:40,202 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-08 11:12:40,203 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-08 11:12:40,203 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 11:12:40,203 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-08 11:12:40,203 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-08 11:12:40,204 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-08 11:12:40,204 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-08 11:12:40,204 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-08 11:12:40,207 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 11:12:40,207 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 11:12:40,207 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 11:12:40,208 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-08 11:12:40,208 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-08 11:12:40,208 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-08 11:12:40,208 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-08 11:12:40,209 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 11:12:40,209 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-08 11:12:40,209 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 11:12:40,209 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-08 11:12:40,210 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 11:12:40,210 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 11:12:40,211 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 11:12:40,211 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 11:12:40,211 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-08 11:12:40,212 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 11:12:40,212 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 11:12:40,213 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 11:12:40,213 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 11:12:40,213 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 11:12:40,214 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 -> 58258448060d1dd7e4bb5d8ae4d59fa53c9505b7e75cc42e4b9e13d20eabdbf0
[2024-11-08 11:12:40,482 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 11:12:40,504 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 11:12:40,507 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 11:12:40,509 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-08 11:12:40,510 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-08 11:12:40,511 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label52.c
[2024-11-08 11:12:41,940 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-08 11:12:42,250 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-08 11:12:42,250 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label52.c
[2024-11-08 11:12:42,272 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d3e8670/85f4956abbab40cb8a97fc18983c2d87/FLAG9da8284d0
[2024-11-08 11:12:42,291 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d3e8670/85f4956abbab40cb8a97fc18983c2d87
[2024-11-08 11:12:42,294 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 11:12:42,295 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 11:12:42,297 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 11:12:42,298 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 11:12:42,303 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 11:12:42,304 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:42,305 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202dbe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42, skipping insertion in model container
[2024-11-08 11:12:42,305 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:42,362 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-08 11:12:42,611 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/Problem11_label52.c[7609,7622]
[2024-11-08 11:12:42,815 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 11:12:42,830 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-08 11:12:42,873 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/Problem11_label52.c[7609,7622]
[2024-11-08 11:12:42,976 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 11:12:42,997 INFO  L204         MainTranslator]: Completed translation
[2024-11-08 11:12:42,998 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42 WrapperNode
[2024-11-08 11:12:42,998 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 11:12:42,999 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 11:12:42,999 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 11:12:43,000 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 11:12:43,006 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:43,041 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:43,148 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000
[2024-11-08 11:12:43,148 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 11:12:43,149 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 11:12:43,149 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 11:12:43,149 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 11:12:43,195 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:43,196 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:43,251 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:43,318 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 11:12:43,318 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:43,318 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:43,370 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:43,380 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:43,389 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:43,400 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:43,414 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 11:12:43,415 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 11:12:43,416 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 11:12:43,416 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-08 11:12:43,417 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (1/1) ...
[2024-11-08 11:12:43,423 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 11:12:43,435 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 11:12:43,451 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 11:12:43,455 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 11:12:43,504 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 11:12:43,504 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 11:12:43,504 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 11:12:43,505 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 11:12:43,580 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-08 11:12:43,582 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 11:12:45,054 INFO  L?                        ?]: Removed 129 outVars from TransFormulas that were not future-live.
[2024-11-08 11:12:45,054 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-08 11:12:45,080 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 11:12:45,080 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 11:12:45,080 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:45 BoogieIcfgContainer
[2024-11-08 11:12:45,081 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 11:12:45,083 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 11:12:45,083 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 11:12:45,086 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-08 11:12:45,087 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:12:42" (1/3) ...
[2024-11-08 11:12:45,087 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e328c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:12:45, skipping insertion in model container
[2024-11-08 11:12:45,088 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:42" (2/3) ...
[2024-11-08 11:12:45,088 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e328c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:12:45, skipping insertion in model container
[2024-11-08 11:12:45,089 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:45" (3/3) ...
[2024-11-08 11:12:45,090 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem11_label52.c
[2024-11-08 11:12:45,109 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 11:12:45,109 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 11:12:45,189 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 11:12:45,197 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;@2c1db98b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 11:12:45,198 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 11:12:45,203 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:45,211 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2024-11-08 11:12:45,211 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:12:45,212 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]
[2024-11-08 11:12:45,212 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:12:45,217 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:12:45,218 INFO  L85        PathProgramCache]: Analyzing trace with hash 1382487458, now seen corresponding path program 1 times
[2024-11-08 11:12:45,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:12:45,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526903394]
[2024-11-08 11:12:45,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:12:45,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:12:45,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:12:45,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:12:45,693 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:12:45,693 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526903394]
[2024-11-08 11:12:45,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526903394] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:12:45,694 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:12:45,694 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 11:12:45,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96090361]
[2024-11-08 11:12:45,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:12:45,701 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:12:45,702 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:12:45,726 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:12:45,727 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:45,731 INFO  L87              Difference]: Start difference. First operand  has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:46,795 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:12:46,796 INFO  L93              Difference]: Finished difference Result 761 states and 1345 transitions.
[2024-11-08 11:12:46,798 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:12:46,799 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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 52
[2024-11-08 11:12:46,800 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:12:46,812 INFO  L225             Difference]: With dead ends: 761
[2024-11-08 11:12:46,812 INFO  L226             Difference]: Without dead ends: 413
[2024-11-08 11:12:46,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-08 11:12:46,820 INFO  L432           NwaCegarLoop]: 190 mSDtfsCounter, 176 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-08 11:12:46,821 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-08 11:12:46,841 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 413 states.
[2024-11-08 11:12:46,877 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413.
[2024-11-08 11:12:46,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:46,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions.
[2024-11-08 11:12:46,883 INFO  L78                 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 52
[2024-11-08 11:12:46,883 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:12:46,884 INFO  L471      AbstractCegarLoop]: Abstraction has 413 states and 599 transitions.
[2024-11-08 11:12:46,884 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:46,884 INFO  L276                IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions.
[2024-11-08 11:12:46,887 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2024-11-08 11:12:46,888 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:12:46,888 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-08 11:12:46,888 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 11:12:46,889 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:12:46,889 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:12:46,889 INFO  L85        PathProgramCache]: Analyzing trace with hash 1697477018, now seen corresponding path program 1 times
[2024-11-08 11:12:46,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:12:46,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567760568]
[2024-11-08 11:12:46,890 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:12:46,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:12:46,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:12:47,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:12:47,120 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:12:47,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567760568]
[2024-11-08 11:12:47,120 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567760568] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:12:47,120 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:12:47,121 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 11:12:47,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31535464]
[2024-11-08 11:12:47,121 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:12:47,122 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:12:47,123 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:12:47,124 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:12:47,124 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:47,125 INFO  L87              Difference]: Start difference. First operand 413 states and 599 transitions. Second operand  has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:47,835 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:12:47,835 INFO  L93              Difference]: Finished difference Result 1211 states and 1763 transitions.
[2024-11-08 11:12:47,836 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:12:47,836 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 120
[2024-11-08 11:12:47,836 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:12:47,839 INFO  L225             Difference]: With dead ends: 1211
[2024-11-08 11:12:47,839 INFO  L226             Difference]: Without dead ends: 800
[2024-11-08 11:12:47,841 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:47,842 INFO  L432           NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 11:12:47,843 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 11:12:47,844 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 800 states.
[2024-11-08 11:12:47,874 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789.
[2024-11-08 11:12:47,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:47,896 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions.
[2024-11-08 11:12:47,896 INFO  L78                 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 120
[2024-11-08 11:12:47,897 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:12:47,897 INFO  L471      AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions.
[2024-11-08 11:12:47,897 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:47,897 INFO  L276                IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions.
[2024-11-08 11:12:47,902 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2024-11-08 11:12:47,902 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:12:47,903 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-08 11:12:47,904 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 11:12:47,904 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:12:47,905 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:12:47,905 INFO  L85        PathProgramCache]: Analyzing trace with hash 690386357, now seen corresponding path program 1 times
[2024-11-08 11:12:47,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:12:47,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445790345]
[2024-11-08 11:12:47,906 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:12:47,906 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:12:47,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:12:48,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:12:48,344 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:12:48,345 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445790345]
[2024-11-08 11:12:48,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445790345] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:12:48,345 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:12:48,345 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 11:12:48,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300330156]
[2024-11-08 11:12:48,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:12:48,346 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:12:48,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:12:48,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:12:48,348 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:48,348 INFO  L87              Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:49,056 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:12:49,057 INFO  L93              Difference]: Finished difference Result 1945 states and 2612 transitions.
[2024-11-08 11:12:49,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:12:49,057 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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 122
[2024-11-08 11:12:49,058 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:12:49,062 INFO  L225             Difference]: With dead ends: 1945
[2024-11-08 11:12:49,062 INFO  L226             Difference]: Without dead ends: 1158
[2024-11-08 11:12:49,063 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:49,064 INFO  L432           NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 11:12:49,065 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 11:12:49,067 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1158 states.
[2024-11-08 11:12:49,086 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157.
[2024-11-08 11:12:49,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:49,091 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions.
[2024-11-08 11:12:49,091 INFO  L78                 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 122
[2024-11-08 11:12:49,092 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:12:49,092 INFO  L471      AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions.
[2024-11-08 11:12:49,092 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:49,093 INFO  L276                IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions.
[2024-11-08 11:12:49,095 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 180
[2024-11-08 11:12:49,096 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:12:49,096 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 11:12:49,096 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 11:12:49,096 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:12:49,097 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:12:49,097 INFO  L85        PathProgramCache]: Analyzing trace with hash -1804040649, now seen corresponding path program 1 times
[2024-11-08 11:12:49,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:12:49,098 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43138963]
[2024-11-08 11:12:49,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:12:49,098 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:12:49,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:12:49,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:12:49,348 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:12:49,348 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43138963]
[2024-11-08 11:12:49,348 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43138963] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:12:49,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:12:49,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:12:49,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922606689]
[2024-11-08 11:12:49,349 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:12:49,350 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:12:49,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:12:49,350 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:12:49,351 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:49,351 INFO  L87              Difference]: Start difference. First operand 1157 states and 1469 transitions. Second operand  has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:50,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:12:50,097 INFO  L93              Difference]: Finished difference Result 2519 states and 3349 transitions.
[2024-11-08 11:12:50,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:12:50,098 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 179
[2024-11-08 11:12:50,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:12:50,104 INFO  L225             Difference]: With dead ends: 2519
[2024-11-08 11:12:50,105 INFO  L226             Difference]: Without dead ends: 1548
[2024-11-08 11:12:50,108 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:50,110 INFO  L432           NwaCegarLoop]: 290 mSDtfsCounter, 183 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 11:12:50,112 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 11:12:50,114 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1548 states.
[2024-11-08 11:12:50,138 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545.
[2024-11-08 11:12:50,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1545 states, 1544 states have (on average 1.2933937823834196) internal successors, (1997), 1544 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:50,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1997 transitions.
[2024-11-08 11:12:50,144 INFO  L78                 Accepts]: Start accepts. Automaton has 1545 states and 1997 transitions. Word has length 179
[2024-11-08 11:12:50,145 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:12:50,146 INFO  L471      AbstractCegarLoop]: Abstraction has 1545 states and 1997 transitions.
[2024-11-08 11:12:50,146 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:50,146 INFO  L276                IsEmpty]: Start isEmpty. Operand 1545 states and 1997 transitions.
[2024-11-08 11:12:50,153 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 235
[2024-11-08 11:12:50,154 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:12:50,154 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 11:12:50,154 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 11:12:50,155 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:12:50,155 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:12:50,155 INFO  L85        PathProgramCache]: Analyzing trace with hash -1655174799, now seen corresponding path program 1 times
[2024-11-08 11:12:50,155 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:12:50,156 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202916267]
[2024-11-08 11:12:50,156 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:12:50,156 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:12:50,246 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:12:50,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 168 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked.
[2024-11-08 11:12:50,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:12:50,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202916267]
[2024-11-08 11:12:50,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202916267] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:12:50,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:12:50,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:12:50,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693432903]
[2024-11-08 11:12:50,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:12:50,445 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:12:50,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:12:50,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:12:50,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:50,446 INFO  L87              Difference]: Start difference. First operand 1545 states and 1997 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-08 11:12:51,287 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:12:51,287 INFO  L93              Difference]: Finished difference Result 3650 states and 4815 transitions.
[2024-11-08 11:12:51,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:12:51,288 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 234
[2024-11-08 11:12:51,289 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:12:51,296 INFO  L225             Difference]: With dead ends: 3650
[2024-11-08 11:12:51,296 INFO  L226             Difference]: Without dead ends: 2291
[2024-11-08 11:12:51,298 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:51,301 INFO  L432           NwaCegarLoop]: 371 mSDtfsCounter, 145 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-08 11:12:51,302 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-08 11:12:51,305 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2291 states.
[2024-11-08 11:12:51,329 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2098.
[2024-11-08 11:12:51,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2098 states, 2097 states have (on average 1.2675250357653791) internal successors, (2658), 2097 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:51,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2658 transitions.
[2024-11-08 11:12:51,337 INFO  L78                 Accepts]: Start accepts. Automaton has 2098 states and 2658 transitions. Word has length 234
[2024-11-08 11:12:51,337 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:12:51,337 INFO  L471      AbstractCegarLoop]: Abstraction has 2098 states and 2658 transitions.
[2024-11-08 11:12:51,338 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-08 11:12:51,338 INFO  L276                IsEmpty]: Start isEmpty. Operand 2098 states and 2658 transitions.
[2024-11-08 11:12:51,341 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 241
[2024-11-08 11:12:51,341 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:12:51,341 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 11:12:51,342 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 11:12:51,342 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:12:51,342 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:12:51,342 INFO  L85        PathProgramCache]: Analyzing trace with hash 203587778, now seen corresponding path program 1 times
[2024-11-08 11:12:51,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:12:51,343 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244637991]
[2024-11-08 11:12:51,343 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:12:51,343 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:12:51,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:12:52,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 174 backedges. 95 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2024-11-08 11:12:52,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:12:52,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244637991]
[2024-11-08 11:12:52,069 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244637991] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 11:12:52,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577671880]
[2024-11-08 11:12:52,069 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:12:52,069 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:12:52,069 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 11:12:52,072 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 11:12:52,074 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 11:12:52,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:12:52,212 INFO  L255         TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 11:12:52,222 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 11:12:52,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 174 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2024-11-08 11:12:52,367 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 11:12:52,367 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577671880] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:12:52,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 11:12:52,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8
[2024-11-08 11:12:52,368 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006523588]
[2024-11-08 11:12:52,368 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:12:52,371 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:12:52,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:12:52,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:12:52,372 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-08 11:12:52,372 INFO  L87              Difference]: Start difference. First operand 2098 states and 2658 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-08 11:12:53,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:12:53,171 INFO  L93              Difference]: Finished difference Result 5851 states and 7488 transitions.
[2024-11-08 11:12:53,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:12:53,176 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 240
[2024-11-08 11:12:53,176 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:12:53,190 INFO  L225             Difference]: With dead ends: 5851
[2024-11-08 11:12:53,190 INFO  L226             Difference]: Without dead ends: 3755
[2024-11-08 11:12:53,194 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-08 11:12:53,196 INFO  L432           NwaCegarLoop]: 128 mSDtfsCounter, 159 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-08 11:12:53,197 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 144 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-08 11:12:53,202 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3755 states.
[2024-11-08 11:12:53,245 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 3755.
[2024-11-08 11:12:53,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3755 states, 3754 states have (on average 1.245338305807139) internal successors, (4675), 3754 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:53,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 4675 transitions.
[2024-11-08 11:12:53,258 INFO  L78                 Accepts]: Start accepts. Automaton has 3755 states and 4675 transitions. Word has length 240
[2024-11-08 11:12:53,259 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:12:53,259 INFO  L471      AbstractCegarLoop]: Abstraction has 3755 states and 4675 transitions.
[2024-11-08 11:12:53,259 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-08 11:12:53,259 INFO  L276                IsEmpty]: Start isEmpty. Operand 3755 states and 4675 transitions.
[2024-11-08 11:12:53,264 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 272
[2024-11-08 11:12:53,264 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:12:53,264 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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]
[2024-11-08 11:12:53,286 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-08 11:12:53,468 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2024-11-08 11:12:53,469 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:12:53,469 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:12:53,469 INFO  L85        PathProgramCache]: Analyzing trace with hash -1866944109, now seen corresponding path program 1 times
[2024-11-08 11:12:53,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:12:53,470 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692040283]
[2024-11-08 11:12:53,470 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:12:53,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:12:53,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:12:53,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2024-11-08 11:12:53,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:12:53,793 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692040283]
[2024-11-08 11:12:53,793 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692040283] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:12:53,793 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:12:53,793 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:12:53,793 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254722241]
[2024-11-08 11:12:53,793 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:12:53,794 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:12:53,794 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:12:53,794 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:12:53,795 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:53,795 INFO  L87              Difference]: Start difference. First operand 3755 states and 4675 transitions. Second operand  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:54,632 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:12:54,632 INFO  L93              Difference]: Finished difference Result 8622 states and 10849 transitions.
[2024-11-08 11:12:54,633 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:12:54,633 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271
[2024-11-08 11:12:54,634 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:12:54,651 INFO  L225             Difference]: With dead ends: 8622
[2024-11-08 11:12:54,651 INFO  L226             Difference]: Without dead ends: 4869
[2024-11-08 11:12:54,656 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:54,657 INFO  L432           NwaCegarLoop]: 369 mSDtfsCounter, 144 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-08 11:12:54,658 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 391 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-08 11:12:54,663 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4869 states.
[2024-11-08 11:12:54,725 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4860.
[2024-11-08 11:12:54,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4860 states, 4859 states have (on average 1.2251492076558963) internal successors, (5953), 4859 states have internal predecessors, (5953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:54,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 5953 transitions.
[2024-11-08 11:12:54,779 INFO  L78                 Accepts]: Start accepts. Automaton has 4860 states and 5953 transitions. Word has length 271
[2024-11-08 11:12:54,779 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:12:54,779 INFO  L471      AbstractCegarLoop]: Abstraction has 4860 states and 5953 transitions.
[2024-11-08 11:12:54,780 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:54,780 INFO  L276                IsEmpty]: Start isEmpty. Operand 4860 states and 5953 transitions.
[2024-11-08 11:12:54,787 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 318
[2024-11-08 11:12:54,787 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:12:54,787 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2024-11-08 11:12:54,788 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 11:12:54,789 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:12:54,790 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:12:54,790 INFO  L85        PathProgramCache]: Analyzing trace with hash -1398635958, now seen corresponding path program 1 times
[2024-11-08 11:12:54,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:12:54,791 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578015578]
[2024-11-08 11:12:54,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:12:54,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:12:54,855 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:12:54,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 370 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked.
[2024-11-08 11:12:54,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:12:54,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578015578]
[2024-11-08 11:12:54,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578015578] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:12:54,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:12:54,985 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:12:54,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119492167]
[2024-11-08 11:12:54,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:12:54,985 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:12:54,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:12:54,986 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:12:54,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:54,986 INFO  L87              Difference]: Start difference. First operand 4860 states and 5953 transitions. Second operand  has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 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-08 11:12:55,757 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:12:55,757 INFO  L93              Difference]: Finished difference Result 11005 states and 13678 transitions.
[2024-11-08 11:12:55,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:12:55,758 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 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 317
[2024-11-08 11:12:55,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:12:55,777 INFO  L225             Difference]: With dead ends: 11005
[2024-11-08 11:12:55,778 INFO  L226             Difference]: Without dead ends: 6147
[2024-11-08 11:12:55,784 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:12:55,786 INFO  L432           NwaCegarLoop]: 125 mSDtfsCounter, 172 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 11:12:55,786 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 151 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 11:12:55,792 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6147 states.
[2024-11-08 11:12:55,850 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 4853.
[2024-11-08 11:12:55,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4853 states, 4852 states have (on average 1.224855729596043) internal successors, (5943), 4852 states have internal predecessors, (5943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:12:55,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 5943 transitions.
[2024-11-08 11:12:55,868 INFO  L78                 Accepts]: Start accepts. Automaton has 4853 states and 5943 transitions. Word has length 317
[2024-11-08 11:12:55,868 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:12:55,868 INFO  L471      AbstractCegarLoop]: Abstraction has 4853 states and 5943 transitions.
[2024-11-08 11:12:55,869 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 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-08 11:12:55,869 INFO  L276                IsEmpty]: Start isEmpty. Operand 4853 states and 5943 transitions.
[2024-11-08 11:12:55,898 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 337
[2024-11-08 11:12:55,900 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:12:55,900 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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]
[2024-11-08 11:12:55,901 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 11:12:55,901 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:12:55,901 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:12:55,902 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108175850, now seen corresponding path program 1 times
[2024-11-08 11:12:55,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:12:55,902 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360850445]
[2024-11-08 11:12:55,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:12:55,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:12:55,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:12:56,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 167 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:12:56,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:12:56,572 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360850445]
[2024-11-08 11:12:56,573 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360850445] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 11:12:56,573 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426118562]
[2024-11-08 11:12:56,573 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:12:56,573 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:12:56,573 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 11:12:56,575 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 11:12:56,578 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 11:12:56,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:12:56,730 INFO  L255         TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 11:12:56,743 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 11:12:58,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 167 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:12:58,435 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 11:13:00,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 167 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:13:00,404 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426118562] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 11:13:00,404 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 11:13:00,404 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7
[2024-11-08 11:13:00,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624056133]
[2024-11-08 11:13:00,405 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 11:13:00,406 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 11:13:00,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:13:00,407 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 11:13:00,407 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2024-11-08 11:13:00,407 INFO  L87              Difference]: Start difference. First operand 4853 states and 5943 transitions. Second operand  has 8 states, 8 states have (on average 74.75) internal successors, (598), 7 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:03,011 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:13:03,011 INFO  L93              Difference]: Finished difference Result 13800 states and 16837 transitions.
[2024-11-08 11:13:03,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-11-08 11:13:03,012 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 74.75) internal successors, (598), 7 states have internal predecessors, (598), 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 336
[2024-11-08 11:13:03,013 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:13:03,052 INFO  L225             Difference]: With dead ends: 13800
[2024-11-08 11:13:03,056 INFO  L226             Difference]: Without dead ends: 8949
[2024-11-08 11:13:03,066 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210
[2024-11-08 11:13:03,067 INFO  L432           NwaCegarLoop]: 111 mSDtfsCounter, 864 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 3481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2024-11-08 11:13:03,067 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 192 Invalid, 3481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2024-11-08 11:13:03,077 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8949 states.
[2024-11-08 11:13:03,149 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8949 to 5035.
[2024-11-08 11:13:03,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5035 states, 5034 states have (on average 1.22248708780294) internal successors, (6154), 5034 states have internal predecessors, (6154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:03,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6154 transitions.
[2024-11-08 11:13:03,167 INFO  L78                 Accepts]: Start accepts. Automaton has 5035 states and 6154 transitions. Word has length 336
[2024-11-08 11:13:03,167 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:13:03,167 INFO  L471      AbstractCegarLoop]: Abstraction has 5035 states and 6154 transitions.
[2024-11-08 11:13:03,168 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 74.75) internal successors, (598), 7 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:03,168 INFO  L276                IsEmpty]: Start isEmpty. Operand 5035 states and 6154 transitions.
[2024-11-08 11:13:03,177 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 358
[2024-11-08 11:13:03,177 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:13:03,178 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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]
[2024-11-08 11:13:03,197 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-08 11:13:03,379 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2024-11-08 11:13:03,380 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:13:03,380 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:13:03,380 INFO  L85        PathProgramCache]: Analyzing trace with hash -1398734134, now seen corresponding path program 1 times
[2024-11-08 11:13:03,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:13:03,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561079705]
[2024-11-08 11:13:03,380 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:13:03,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:13:03,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:13:03,955 INFO  L134       CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:13:03,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:13:03,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561079705]
[2024-11-08 11:13:03,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561079705] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:13:03,956 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:13:03,956 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 11:13:03,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63215800]
[2024-11-08 11:13:03,956 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:13:03,957 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 11:13:03,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:13:03,957 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 11:13:03,957 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 11:13:03,958 INFO  L87              Difference]: Start difference. First operand 5035 states and 6154 transitions. Second operand  has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:05,004 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:13:05,005 INFO  L93              Difference]: Finished difference Result 13948 states and 17066 transitions.
[2024-11-08 11:13:05,005 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 11:13:05,005 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 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 357
[2024-11-08 11:13:05,006 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:13:05,020 INFO  L225             Difference]: With dead ends: 13948
[2024-11-08 11:13:05,020 INFO  L226             Difference]: Without dead ends: 8915
[2024-11-08 11:13:05,027 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 11:13:05,028 INFO  L432           NwaCegarLoop]: 36 mSDtfsCounter, 238 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-08 11:13:05,028 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 65 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-08 11:13:05,035 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8915 states.
[2024-11-08 11:13:05,131 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8915 to 7441.
[2024-11-08 11:13:05,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7441 states, 7440 states have (on average 1.1923387096774194) internal successors, (8871), 7440 states have internal predecessors, (8871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:05,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 8871 transitions.
[2024-11-08 11:13:05,157 INFO  L78                 Accepts]: Start accepts. Automaton has 7441 states and 8871 transitions. Word has length 357
[2024-11-08 11:13:05,157 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:13:05,157 INFO  L471      AbstractCegarLoop]: Abstraction has 7441 states and 8871 transitions.
[2024-11-08 11:13:05,158 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:05,158 INFO  L276                IsEmpty]: Start isEmpty. Operand 7441 states and 8871 transitions.
[2024-11-08 11:13:05,175 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2024-11-08 11:13:05,175 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:13:05,177 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 11:13:05,177 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-08 11:13:05,177 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:13:05,178 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:13:05,178 INFO  L85        PathProgramCache]: Analyzing trace with hash 1218780311, now seen corresponding path program 1 times
[2024-11-08 11:13:05,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:13:05,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232119895]
[2024-11-08 11:13:05,178 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:13:05,179 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:13:05,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:13:05,631 INFO  L134       CoverageAnalysis]: Checked inductivity of 469 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked.
[2024-11-08 11:13:05,631 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:13:05,632 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232119895]
[2024-11-08 11:13:05,632 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232119895] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:13:05,632 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:13:05,632 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 11:13:05,632 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089267487]
[2024-11-08 11:13:05,632 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:13:05,633 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 11:13:05,633 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:13:05,633 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 11:13:05,633 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 11:13:05,634 INFO  L87              Difference]: Start difference. First operand 7441 states and 8871 transitions. Second operand  has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:06,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:13:06,657 INFO  L93              Difference]: Finished difference Result 16170 states and 19194 transitions.
[2024-11-08 11:13:06,658 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 11:13:06,662 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 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 431
[2024-11-08 11:13:06,663 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:13:06,680 INFO  L225             Difference]: With dead ends: 16170
[2024-11-08 11:13:06,681 INFO  L226             Difference]: Without dead ends: 8731
[2024-11-08 11:13:06,689 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 11:13:06,689 INFO  L432           NwaCegarLoop]: 35 mSDtfsCounter, 239 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-08 11:13:06,690 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 64 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-08 11:13:06,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8731 states.
[2024-11-08 11:13:06,766 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8731 to 7441.
[2024-11-08 11:13:06,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7441 states, 7440 states have (on average 1.1923387096774194) internal successors, (8871), 7440 states have internal predecessors, (8871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:06,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 8871 transitions.
[2024-11-08 11:13:06,791 INFO  L78                 Accepts]: Start accepts. Automaton has 7441 states and 8871 transitions. Word has length 431
[2024-11-08 11:13:06,792 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:13:06,792 INFO  L471      AbstractCegarLoop]: Abstraction has 7441 states and 8871 transitions.
[2024-11-08 11:13:06,793 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:06,793 INFO  L276                IsEmpty]: Start isEmpty. Operand 7441 states and 8871 transitions.
[2024-11-08 11:13:06,806 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2024-11-08 11:13:06,807 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:13:06,807 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 11:13:06,807 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-08 11:13:06,807 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:13:06,809 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:13:06,809 INFO  L85        PathProgramCache]: Analyzing trace with hash -287893398, now seen corresponding path program 1 times
[2024-11-08 11:13:06,809 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:13:06,809 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968976137]
[2024-11-08 11:13:06,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:13:06,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:13:06,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:13:07,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 464 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked.
[2024-11-08 11:13:07,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:13:07,201 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968976137]
[2024-11-08 11:13:07,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968976137] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:13:07,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:13:07,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:13:07,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192514838]
[2024-11-08 11:13:07,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:13:07,202 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:13:07,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:13:07,203 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:13:07,203 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:13:07,203 INFO  L87              Difference]: Start difference. First operand 7441 states and 8871 transitions. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:07,903 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:13:07,904 INFO  L93              Difference]: Finished difference Result 15080 states and 17958 transitions.
[2024-11-08 11:13:07,904 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:13:07,904 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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 431
[2024-11-08 11:13:07,905 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:13:07,917 INFO  L225             Difference]: With dead ends: 15080
[2024-11-08 11:13:07,917 INFO  L226             Difference]: Without dead ends: 7641
[2024-11-08 11:13:07,925 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:13:07,926 INFO  L432           NwaCegarLoop]: 311 mSDtfsCounter, 107 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 11:13:07,926 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 329 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 11:13:07,932 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7641 states.
[2024-11-08 11:13:08,002 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 7257.
[2024-11-08 11:13:08,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7257 states, 7256 states have (on average 1.160005512679162) internal successors, (8417), 7256 states have internal predecessors, (8417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:08,019 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 8417 transitions.
[2024-11-08 11:13:08,020 INFO  L78                 Accepts]: Start accepts. Automaton has 7257 states and 8417 transitions. Word has length 431
[2024-11-08 11:13:08,020 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:13:08,021 INFO  L471      AbstractCegarLoop]: Abstraction has 7257 states and 8417 transitions.
[2024-11-08 11:13:08,021 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:08,021 INFO  L276                IsEmpty]: Start isEmpty. Operand 7257 states and 8417 transitions.
[2024-11-08 11:13:08,033 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 489
[2024-11-08 11:13:08,034 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:13:08,034 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-08 11:13:08,034 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-08 11:13:08,035 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:13:08,035 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:13:08,036 INFO  L85        PathProgramCache]: Analyzing trace with hash 2057046030, now seen corresponding path program 1 times
[2024-11-08 11:13:08,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:13:08,036 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317362818]
[2024-11-08 11:13:08,036 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:13:08,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:13:08,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:13:08,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 550 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked.
[2024-11-08 11:13:08,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:13:08,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317362818]
[2024-11-08 11:13:08,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317362818] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:13:08,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:13:08,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 11:13:08,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208938366]
[2024-11-08 11:13:08,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:13:08,332 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:13:08,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:13:08,333 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:13:08,333 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:13:08,333 INFO  L87              Difference]: Start difference. First operand 7257 states and 8417 transitions. Second operand  has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:08,753 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:13:08,753 INFO  L93              Difference]: Finished difference Result 14132 states and 16360 transitions.
[2024-11-08 11:13:08,754 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:13:08,754 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 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 488
[2024-11-08 11:13:08,754 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:13:08,765 INFO  L225             Difference]: With dead ends: 14132
[2024-11-08 11:13:08,766 INFO  L226             Difference]: Without dead ends: 6877
[2024-11-08 11:13:08,773 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:13:08,774 INFO  L432           NwaCegarLoop]: 37 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 11:13:08,774 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 37 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 11:13:08,782 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6877 states.
[2024-11-08 11:13:08,841 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6877 to 6875.
[2024-11-08 11:13:08,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6875 states, 6874 states have (on average 1.1544951993017165) internal successors, (7936), 6874 states have internal predecessors, (7936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:08,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 7936 transitions.
[2024-11-08 11:13:08,864 INFO  L78                 Accepts]: Start accepts. Automaton has 6875 states and 7936 transitions. Word has length 488
[2024-11-08 11:13:08,864 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:13:08,864 INFO  L471      AbstractCegarLoop]: Abstraction has 6875 states and 7936 transitions.
[2024-11-08 11:13:08,864 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:08,865 INFO  L276                IsEmpty]: Start isEmpty. Operand 6875 states and 7936 transitions.
[2024-11-08 11:13:08,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 505
[2024-11-08 11:13:08,874 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:13:08,875 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-08 11:13:08,875 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-08 11:13:08,875 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:13:08,876 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:13:08,876 INFO  L85        PathProgramCache]: Analyzing trace with hash -1680894984, now seen corresponding path program 1 times
[2024-11-08 11:13:08,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:13:08,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993684537]
[2024-11-08 11:13:08,876 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:13:08,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:13:08,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:13:09,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 551 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2024-11-08 11:13:09,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:13:09,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993684537]
[2024-11-08 11:13:09,176 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993684537] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:13:09,176 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:13:09,176 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:13:09,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088653550]
[2024-11-08 11:13:09,176 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:13:09,177 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:13:09,177 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:13:09,177 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:13:09,177 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:13:09,178 INFO  L87              Difference]: Start difference. First operand 6875 states and 7936 transitions. Second operand  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:09,752 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:13:09,753 INFO  L93              Difference]: Finished difference Result 12621 states and 14535 transitions.
[2024-11-08 11:13:09,753 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:13:09,753 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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 504
[2024-11-08 11:13:09,754 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:13:09,763 INFO  L225             Difference]: With dead ends: 12621
[2024-11-08 11:13:09,764 INFO  L226             Difference]: Without dead ends: 5748
[2024-11-08 11:13:09,770 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:13:09,771 INFO  L432           NwaCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 11:13:09,771 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 123 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 11:13:09,775 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5748 states.
[2024-11-08 11:13:09,866 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5748 to 4828.
[2024-11-08 11:13:09,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4828 states, 4827 states have (on average 1.1247151439817693) internal successors, (5429), 4827 states have internal predecessors, (5429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:09,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 5429 transitions.
[2024-11-08 11:13:09,879 INFO  L78                 Accepts]: Start accepts. Automaton has 4828 states and 5429 transitions. Word has length 504
[2024-11-08 11:13:09,881 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:13:09,881 INFO  L471      AbstractCegarLoop]: Abstraction has 4828 states and 5429 transitions.
[2024-11-08 11:13:09,881 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:09,881 INFO  L276                IsEmpty]: Start isEmpty. Operand 4828 states and 5429 transitions.
[2024-11-08 11:13:09,895 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 683
[2024-11-08 11:13:09,895 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:13:09,896 INFO  L215           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 11:13:09,896 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-08 11:13:09,896 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:13:09,897 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:13:09,897 INFO  L85        PathProgramCache]: Analyzing trace with hash -1417577515, now seen corresponding path program 1 times
[2024-11-08 11:13:09,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:13:09,897 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112382272]
[2024-11-08 11:13:09,898 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:13:09,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:13:10,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:13:10,459 INFO  L134       CoverageAnalysis]: Checked inductivity of 1298 backedges. 872 proven. 0 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked.
[2024-11-08 11:13:10,459 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:13:10,459 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112382272]
[2024-11-08 11:13:10,459 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112382272] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:13:10,459 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:13:10,459 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:13:10,460 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066971532]
[2024-11-08 11:13:10,460 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:13:10,460 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 11:13:10,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:13:10,461 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 11:13:10,461 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 11:13:10,462 INFO  L87              Difference]: Start difference. First operand 4828 states and 5429 transitions. Second operand  has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:11,478 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:13:11,478 INFO  L93              Difference]: Finished difference Result 14635 states and 16469 transitions.
[2024-11-08 11:13:11,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 11:13:11,478 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 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 682
[2024-11-08 11:13:11,479 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:13:11,493 INFO  L225             Difference]: With dead ends: 14635
[2024-11-08 11:13:11,493 INFO  L226             Difference]: Without dead ends: 9809
[2024-11-08 11:13:11,500 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 11:13:11,502 INFO  L432           NwaCegarLoop]: 26 mSDtfsCounter, 215 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-08 11:13:11,502 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 54 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-08 11:13:11,508 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9809 states.
[2024-11-08 11:13:11,596 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9809 to 9620.
[2024-11-08 11:13:11,605 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9620 states, 9619 states have (on average 1.1143570017673354) internal successors, (10719), 9619 states have internal predecessors, (10719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:11,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9620 states to 9620 states and 10719 transitions.
[2024-11-08 11:13:11,616 INFO  L78                 Accepts]: Start accepts. Automaton has 9620 states and 10719 transitions. Word has length 682
[2024-11-08 11:13:11,617 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:13:11,617 INFO  L471      AbstractCegarLoop]: Abstraction has 9620 states and 10719 transitions.
[2024-11-08 11:13:11,617 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:11,617 INFO  L276                IsEmpty]: Start isEmpty. Operand 9620 states and 10719 transitions.
[2024-11-08 11:13:11,632 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 761
[2024-11-08 11:13:11,632 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:13:11,633 INFO  L215           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 11:13:11,633 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-08 11:13:11,633 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:13:11,637 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:13:11,637 INFO  L85        PathProgramCache]: Analyzing trace with hash -1921349717, now seen corresponding path program 1 times
[2024-11-08 11:13:11,637 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:13:11,637 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578000675]
[2024-11-08 11:13:11,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:13:11,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:13:11,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:13:12,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 1733 backedges. 1023 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked.
[2024-11-08 11:13:12,057 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:13:12,057 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578000675]
[2024-11-08 11:13:12,057 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578000675] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:13:12,057 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:13:12,057 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:13:12,057 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594091045]
[2024-11-08 11:13:12,058 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:13:12,058 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:13:12,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:13:12,059 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:13:12,059 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:13:12,059 INFO  L87              Difference]: Start difference. First operand 9620 states and 10719 transitions. Second operand  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:12,655 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:13:12,656 INFO  L93              Difference]: Finished difference Result 20341 states and 22719 transitions.
[2024-11-08 11:13:12,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:13:12,656 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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 760
[2024-11-08 11:13:12,656 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:13:12,671 INFO  L225             Difference]: With dead ends: 20341
[2024-11-08 11:13:12,672 INFO  L226             Difference]: Without dead ends: 10170
[2024-11-08 11:13:12,680 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:13:12,681 INFO  L432           NwaCegarLoop]: 321 mSDtfsCounter, 194 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 11:13:12,681 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 340 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 11:13:12,688 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10170 states.
[2024-11-08 11:13:12,773 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10170 to 10170.
[2024-11-08 11:13:12,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10170 states, 10169 states have (on average 1.0946995771462287) internal successors, (11132), 10169 states have internal predecessors, (11132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:12,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 11132 transitions.
[2024-11-08 11:13:12,794 INFO  L78                 Accepts]: Start accepts. Automaton has 10170 states and 11132 transitions. Word has length 760
[2024-11-08 11:13:12,795 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:13:12,795 INFO  L471      AbstractCegarLoop]: Abstraction has 10170 states and 11132 transitions.
[2024-11-08 11:13:12,795 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:12,795 INFO  L276                IsEmpty]: Start isEmpty. Operand 10170 states and 11132 transitions.
[2024-11-08 11:13:12,812 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 851
[2024-11-08 11:13:12,812 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:13:12,813 INFO  L215           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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]
[2024-11-08 11:13:12,813 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-08 11:13:12,813 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:13:12,814 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:13:12,814 INFO  L85        PathProgramCache]: Analyzing trace with hash -43670685, now seen corresponding path program 1 times
[2024-11-08 11:13:12,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:13:12,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675730288]
[2024-11-08 11:13:12,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:13:12,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:13:12,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:13:13,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 2081 backedges. 1501 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked.
[2024-11-08 11:13:13,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:13:13,310 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675730288]
[2024-11-08 11:13:13,310 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675730288] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:13:13,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:13:13,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:13:13,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220668753]
[2024-11-08 11:13:13,311 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:13:13,312 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:13:13,313 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:13:13,313 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:13:13,313 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:13:13,314 INFO  L87              Difference]: Start difference. First operand 10170 states and 11132 transitions. Second operand  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:13,868 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:13:13,868 INFO  L93              Difference]: Finished difference Result 20887 states and 22855 transitions.
[2024-11-08 11:13:13,868 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:13:13,869 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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 850
[2024-11-08 11:13:13,869 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:13:13,870 INFO  L225             Difference]: With dead ends: 20887
[2024-11-08 11:13:13,870 INFO  L226             Difference]: Without dead ends: 0
[2024-11-08 11:13:13,880 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:13:13,881 INFO  L432           NwaCegarLoop]: 303 mSDtfsCounter, 53 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 11:13:13,881 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 320 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 11:13:13,882 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-08 11:13:13,882 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-08 11:13:13,882 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:13,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-08 11:13:13,882 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 850
[2024-11-08 11:13:13,883 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:13:13,883 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-08 11:13:13,883 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:13:13,883 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-08 11:13:13,883 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-08 11:13:13,886 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 11:13:13,887 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-08 11:13:13,890 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 11:13:13,892 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-08 11:13:16,246 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 11:13:16,278 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:13:16 BoogieIcfgContainer
[2024-11-08 11:13:16,278 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 11:13:16,278 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 11:13:16,278 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-08 11:13:16,279 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-08 11:13:16,279 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:45" (3/4) ...
[2024-11-08 11:13:16,281 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-08 11:13:16,304 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-08 11:13:16,305 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-08 11:13:16,306 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-08 11:13:16,307 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-08 11:13:16,487 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-08 11:13:16,488 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-08 11:13:16,488 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 11:13:16,488 INFO  L158              Benchmark]: Toolchain (without parser) took 34193.19ms. Allocated memory was 161.5MB in the beginning and 872.4MB in the end (delta: 710.9MB). Free memory was 110.5MB in the beginning and 328.8MB in the end (delta: -218.2MB). Peak memory consumption was 495.1MB. Max. memory is 16.1GB.
[2024-11-08 11:13:16,489 INFO  L158              Benchmark]: CDTParser took 0.22ms. Allocated memory is still 161.5MB. Free memory was 126.0MB in the beginning and 125.8MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 11:13:16,489 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 701.58ms. Allocated memory is still 161.5MB. Free memory was 110.5MB in the beginning and 62.2MB in the end (delta: 48.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB.
[2024-11-08 11:13:16,491 INFO  L158              Benchmark]: Boogie Procedure Inliner took 149.28ms. Allocated memory is still 161.5MB. Free memory was 62.2MB in the beginning and 44.8MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-08 11:13:16,491 INFO  L158              Benchmark]: Boogie Preprocessor took 265.65ms. Allocated memory was 161.5MB in the beginning and 232.8MB in the end (delta: 71.3MB). Free memory was 44.8MB in the beginning and 170.3MB in the end (delta: -125.5MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB.
[2024-11-08 11:13:16,492 INFO  L158              Benchmark]: RCFGBuilder took 1665.28ms. Allocated memory is still 232.8MB. Free memory was 169.3MB in the beginning and 92.6MB in the end (delta: 76.7MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB.
[2024-11-08 11:13:16,492 INFO  L158              Benchmark]: TraceAbstraction took 31195.26ms. Allocated memory was 232.8MB in the beginning and 872.4MB in the end (delta: 639.6MB). Free memory was 92.6MB in the beginning and 345.5MB in the end (delta: -252.9MB). Peak memory consumption was 467.9MB. Max. memory is 16.1GB.
[2024-11-08 11:13:16,492 INFO  L158              Benchmark]: Witness Printer took 209.39ms. Allocated memory is still 872.4MB. Free memory was 345.5MB in the beginning and 328.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-08 11:13:16,494 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.22ms. Allocated memory is still 161.5MB. Free memory was 126.0MB in the beginning and 125.8MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 701.58ms. Allocated memory is still 161.5MB. Free memory was 110.5MB in the beginning and 62.2MB in the end (delta: 48.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 149.28ms. Allocated memory is still 161.5MB. Free memory was 62.2MB in the beginning and 44.8MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 265.65ms. Allocated memory was 161.5MB in the beginning and 232.8MB in the end (delta: 71.3MB). Free memory was 44.8MB in the beginning and 170.3MB in the end (delta: -125.5MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1665.28ms. Allocated memory is still 232.8MB. Free memory was 169.3MB in the beginning and 92.6MB in the end (delta: 76.7MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB.
 * TraceAbstraction took 31195.26ms. Allocated memory was 232.8MB in the beginning and 872.4MB in the end (delta: 639.6MB). Free memory was 92.6MB in the beginning and 345.5MB in the end (delta: -252.9MB). Peak memory consumption was 467.9MB. Max. memory is 16.1GB.
 * Witness Printer took 209.39ms. Allocated memory is still 872.4MB. Free memory was 345.5MB in the beginning and 328.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 172]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.7s, OverallIterations: 17, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3409 SdHoareTripleChecker+Valid, 14.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3409 mSDsluCounter, 3456 SdHoareTripleChecker+Invalid, 11.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 428 mSDsCounter, 2176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13085 IncrementalHoareTripleChecker+Invalid, 15261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2176 mSolverCounterUnsat, 3028 mSDtfsCounter, 13085 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 969 GetRequests, 932 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10170occurred in iteration=16, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 9684 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 6950 NumberOfCodeBlocks, 6950 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 7266 ConstructedInterpolants, 0 QuantifiedInterpolants, 24163 SizeOfPredicates, 8 NumberOfNonLiveVariables, 797 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 9112/9275 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: 1044]: Loop Invariant
    Derived loop invariant: ((((((((((((((((((((a25 <= 10) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || ((((a25 == 11) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599998)) && (a8 == 15))) || ((((a25 == 13) && (a29 <= 245)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 == 13) && (307 <= a23)) || ((a25 == 13) && (a3 == 1))) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 11) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 <= 10) && (a3 == 1)) && (a23 <= 138)) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((a25 <= 10) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 == 11)) && (a29 <= 599998)) && (a23 <= 312)) && (a8 == 15))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10)) && (a8 == 15))) || (((((((long long) a29 + 21) <= 0) && (a25 == 12)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 <= 10)) && (a29 <= 245)) && (a23 <= 138)) && (a8 == 15))) || ((((((a25 == 12) && (307 <= a23)) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998)) && (a8 == 15)))
RESULT: Ultimate proved your program to be correct!
[2024-11-08 11:13:16,527 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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