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


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


Checking for ERROR reachability
Using default analysis
Version fca748b1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label50.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 56e7a4db9e890bad4c6ba22e9e20439c94d0afdecfe3e8cad4ffb71abf5e0a33
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m
[2024-11-19 18:03:59,304 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-19 18:03:59,345 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-19 18:03:59,348 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-19 18:03:59,348 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-19 18:03:59,364 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-19 18:03:59,364 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-19 18:03:59,364 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-19 18:03:59,365 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-19 18:03:59,365 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-19 18:03:59,365 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-19 18:03:59,365 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-19 18:03:59,366 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-19 18:03:59,366 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-19 18:03:59,366 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-19 18:03:59,367 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-19 18:03:59,367 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-19 18:03:59,367 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-19 18:03:59,367 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-19 18:03:59,368 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-19 18:03:59,368 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-19 18:03:59,368 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-19 18:03:59,368 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-19 18:03:59,369 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-19 18:03:59,369 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-19 18:03:59,369 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-19 18:03:59,369 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-19 18:03:59,369 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-19 18:03:59,370 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-19 18:03:59,370 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-19 18:03:59,370 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-19 18:03:59,370 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-19 18:03:59,370 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 18:03:59,370 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-19 18:03:59,371 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-19 18:03:59,371 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-19 18:03:59,371 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-19 18:03:59,371 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-19 18:03:59,371 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-19 18:03:59,372 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-19 18:03:59,372 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-19 18:03:59,372 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-19 18:03:59,372 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 -> 56e7a4db9e890bad4c6ba22e9e20439c94d0afdecfe3e8cad4ffb71abf5e0a33
[2024-11-19 18:03:59,544 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-19 18:03:59,566 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-19 18:03:59,568 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-19 18:03:59,569 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-19 18:03:59,569 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-19 18:03:59,570 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label50.c
[2024-11-19 18:04:00,836 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-19 18:04:01,072 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-19 18:04:01,072 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label50.c
[2024-11-19 18:04:01,084 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/468357d00/7e61405911d8411795ba0813459f10f8/FLAG21b950589
[2024-11-19 18:04:01,097 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/468357d00/7e61405911d8411795ba0813459f10f8
[2024-11-19 18:04:01,100 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-19 18:04:01,101 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-19 18:04:01,102 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-19 18:04:01,102 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-19 18:04:01,107 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-19 18:04:01,107 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:04:01" (1/1) ...
[2024-11-19 18:04:01,108 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3a89f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:01, skipping insertion in model container
[2024-11-19 18:04:01,110 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:04:01" (1/1) ...
[2024-11-19 18:04:01,159 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-19 18:04:01,543 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_label50.c[5287,5300]
[2024-11-19 18:04:01,963 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 18:04:01,981 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-19 18:04:02,029 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_label50.c[5287,5300]
[2024-11-19 18:04:02,212 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 18:04:02,230 INFO  L204         MainTranslator]: Completed translation
[2024-11-19 18:04:02,233 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02 WrapperNode
[2024-11-19 18:04:02,233 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-19 18:04:02,234 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-19 18:04:02,234 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-19 18:04:02,234 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-19 18:04:02,240 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (1/1) ...
[2024-11-19 18:04:02,267 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (1/1) ...
[2024-11-19 18:04:02,369 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000
[2024-11-19 18:04:02,369 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-19 18:04:02,370 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-19 18:04:02,370 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-19 18:04:02,371 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-19 18:04:02,379 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (1/1) ...
[2024-11-19 18:04:02,380 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (1/1) ...
[2024-11-19 18:04:02,397 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (1/1) ...
[2024-11-19 18:04:02,446 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-19 18:04:02,446 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (1/1) ...
[2024-11-19 18:04:02,446 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (1/1) ...
[2024-11-19 18:04:02,483 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (1/1) ...
[2024-11-19 18:04:02,495 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (1/1) ...
[2024-11-19 18:04:02,510 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (1/1) ...
[2024-11-19 18:04:02,527 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (1/1) ...
[2024-11-19 18:04:02,543 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-19 18:04:02,544 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-19 18:04:02,544 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-19 18:04:02,544 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-19 18:04:02,545 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (1/1) ...
[2024-11-19 18:04:02,549 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 18:04:02,558 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 18:04:02,573 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-19 18:04:02,577 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-19 18:04:02,614 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-19 18:04:02,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-19 18:04:02,615 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-19 18:04:02,615 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-19 18:04:02,680 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-19 18:04:02,682 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-19 18:04:03,814 INFO  L?                        ?]: Removed 129 outVars from TransFormulas that were not future-live.
[2024-11-19 18:04:03,815 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-19 18:04:03,828 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-19 18:04:03,828 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-19 18:04:03,828 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:04:03 BoogieIcfgContainer
[2024-11-19 18:04:03,829 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-19 18:04:03,830 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-19 18:04:03,830 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-19 18:04:03,833 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-19 18:04:03,833 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:04:01" (1/3) ...
[2024-11-19 18:04:03,833 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd71125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:04:03, skipping insertion in model container
[2024-11-19 18:04:03,833 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:02" (2/3) ...
[2024-11-19 18:04:03,834 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd71125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:04:03, skipping insertion in model container
[2024-11-19 18:04:03,834 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:04:03" (3/3) ...
[2024-11-19 18:04:03,834 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem11_label50.c
[2024-11-19 18:04:03,847 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-19 18:04:03,848 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-19 18:04:03,896 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-19 18:04:03,901 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;@1add317f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-19 18:04:03,901 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-19 18:04:03,905 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-19 18:04:03,910 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2024-11-19 18:04:03,910 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:03,911 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]
[2024-11-19 18:04:03,911 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:03,915 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:03,915 INFO  L85        PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times
[2024-11-19 18:04:03,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:03,922 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123895511]
[2024-11-19 18:04:03,922 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:03,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:04,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:04,177 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-19 18:04:04,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:04,178 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123895511]
[2024-11-19 18:04:04,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123895511] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:04,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:04,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 18:04:04,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525190193]
[2024-11-19 18:04:04,181 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:04,184 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:04,185 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:04,201 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:04,202 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:04,204 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 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-19 18:04:05,025 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:05,026 INFO  L93              Difference]: Finished difference Result 776 states and 1363 transitions.
[2024-11-19 18:04:05,027 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:05,028 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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 36
[2024-11-19 18:04:05,029 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:05,037 INFO  L225             Difference]: With dead ends: 776
[2024-11-19 18:04:05,038 INFO  L226             Difference]: Without dead ends: 413
[2024-11-19 18:04:05,041 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-19 18:04:05,044 INFO  L432           NwaCegarLoop]: 168 mSDtfsCounter, 191 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:05,045 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-19 18:04:05,060 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 413 states.
[2024-11-19 18:04:05,087 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411.
[2024-11-19 18:04:05,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 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-19 18:04:05,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions.
[2024-11-19 18:04:05,091 INFO  L78                 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 36
[2024-11-19 18:04:05,092 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:05,092 INFO  L471      AbstractCegarLoop]: Abstraction has 411 states and 598 transitions.
[2024-11-19 18:04:05,092 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-19 18:04:05,092 INFO  L276                IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions.
[2024-11-19 18:04:05,095 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2024-11-19 18:04:05,095 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:05,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:04:05,095 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-19 18:04:05,096 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:05,096 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:05,096 INFO  L85        PathProgramCache]: Analyzing trace with hash -464053414, now seen corresponding path program 1 times
[2024-11-19 18:04:05,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:05,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010908245]
[2024-11-19 18:04:05,097 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:05,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:05,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:05,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 18:04:05,268 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:05,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010908245]
[2024-11-19 18:04:05,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010908245] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:05,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:05,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 18:04:05,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959902314]
[2024-11-19 18:04:05,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:05,270 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:05,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:05,272 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:05,273 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:05,273 INFO  L87              Difference]: Start difference. First operand 411 states and 598 transitions. Second operand  has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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-19 18:04:05,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:05,882 INFO  L93              Difference]: Finished difference Result 1209 states and 1765 transitions.
[2024-11-19 18:04:05,882 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:05,882 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 104
[2024-11-19 18:04:05,883 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:05,885 INFO  L225             Difference]: With dead ends: 1209
[2024-11-19 18:04:05,885 INFO  L226             Difference]: Without dead ends: 800
[2024-11-19 18:04:05,886 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-19 18:04:05,887 INFO  L432           NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 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.6s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:05,888 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-19 18:04:05,889 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 800 states.
[2024-11-19 18:04:05,905 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787.
[2024-11-19 18:04:05,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 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-19 18:04:05,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions.
[2024-11-19 18:04:05,909 INFO  L78                 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 104
[2024-11-19 18:04:05,909 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:05,909 INFO  L471      AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions.
[2024-11-19 18:04:05,909 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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-19 18:04:05,910 INFO  L276                IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions.
[2024-11-19 18:04:05,912 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2024-11-19 18:04:05,912 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:05,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:04:05,913 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-19 18:04:05,913 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:05,914 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:05,914 INFO  L85        PathProgramCache]: Analyzing trace with hash 1589161308, now seen corresponding path program 1 times
[2024-11-19 18:04:05,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:05,914 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905243109]
[2024-11-19 18:04:05,915 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:05,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:05,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:06,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 18:04:06,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:06,107 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905243109]
[2024-11-19 18:04:06,107 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905243109] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:06,108 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:06,108 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 18:04:06,108 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291566016]
[2024-11-19 18:04:06,108 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:06,108 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:06,108 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:06,109 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:06,109 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:06,109 INFO  L87              Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 18:04:06,704 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:06,704 INFO  L93              Difference]: Finished difference Result 1942 states and 2631 transitions.
[2024-11-19 18:04:06,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:06,705 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105
[2024-11-19 18:04:06,705 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:06,709 INFO  L225             Difference]: With dead ends: 1942
[2024-11-19 18:04:06,709 INFO  L226             Difference]: Without dead ends: 1157
[2024-11-19 18:04:06,710 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-19 18:04:06,711 INFO  L432           NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 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.6s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:06,711 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-19 18:04:06,712 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1157 states.
[2024-11-19 18:04:06,731 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156.
[2024-11-19 18:04:06,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1156 states, 1155 states have (on average 1.277922077922078) internal successors, (1476), 1155 states have internal predecessors, (1476), 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-19 18:04:06,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1476 transitions.
[2024-11-19 18:04:06,735 INFO  L78                 Accepts]: Start accepts. Automaton has 1156 states and 1476 transitions. Word has length 105
[2024-11-19 18:04:06,736 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:06,736 INFO  L471      AbstractCegarLoop]: Abstraction has 1156 states and 1476 transitions.
[2024-11-19 18:04:06,736 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 18:04:06,736 INFO  L276                IsEmpty]: Start isEmpty. Operand 1156 states and 1476 transitions.
[2024-11-19 18:04:06,739 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2024-11-19 18:04:06,739 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:06,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:04:06,739 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-19 18:04:06,739 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:06,740 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:06,740 INFO  L85        PathProgramCache]: Analyzing trace with hash 649803806, now seen corresponding path program 1 times
[2024-11-19 18:04:06,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:06,740 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877204336]
[2024-11-19 18:04:06,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:06,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:06,787 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:06,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 18:04:06,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:06,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877204336]
[2024-11-19 18:04:06,955 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877204336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:06,955 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:06,955 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 18:04:06,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307283085]
[2024-11-19 18:04:06,956 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:06,956 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:06,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:06,957 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:06,957 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:06,957 INFO  L87              Difference]: Start difference. First operand 1156 states and 1476 transitions. Second operand  has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-19 18:04:07,580 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:07,581 INFO  L93              Difference]: Finished difference Result 2691 states and 3515 transitions.
[2024-11-19 18:04:07,581 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:07,581 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 148
[2024-11-19 18:04:07,582 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:07,586 INFO  L225             Difference]: With dead ends: 2691
[2024-11-19 18:04:07,586 INFO  L226             Difference]: Without dead ends: 1721
[2024-11-19 18:04:07,587 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-19 18:04:07,588 INFO  L432           NwaCegarLoop]: 315 mSDtfsCounter, 170 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:07,589 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 336 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-19 18:04:07,590 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1721 states.
[2024-11-19 18:04:07,606 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1528.
[2024-11-19 18:04:07,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1528 states, 1527 states have (on average 1.261296660117878) internal successors, (1926), 1527 states have internal predecessors, (1926), 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-19 18:04:07,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1926 transitions.
[2024-11-19 18:04:07,611 INFO  L78                 Accepts]: Start accepts. Automaton has 1528 states and 1926 transitions. Word has length 148
[2024-11-19 18:04:07,611 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:07,612 INFO  L471      AbstractCegarLoop]: Abstraction has 1528 states and 1926 transitions.
[2024-11-19 18:04:07,612 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-19 18:04:07,612 INFO  L276                IsEmpty]: Start isEmpty. Operand 1528 states and 1926 transitions.
[2024-11-19 18:04:07,613 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2024-11-19 18:04:07,613 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:07,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:04:07,614 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-19 18:04:07,614 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:07,614 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:07,615 INFO  L85        PathProgramCache]: Analyzing trace with hash -1095020807, now seen corresponding path program 1 times
[2024-11-19 18:04:07,615 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:07,615 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651453207]
[2024-11-19 18:04:07,615 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:07,615 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:07,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:07,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 18:04:07,729 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:07,729 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651453207]
[2024-11-19 18:04:07,729 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651453207] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:07,729 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:07,729 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 18:04:07,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770112408]
[2024-11-19 18:04:07,730 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:07,730 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:07,730 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:07,730 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:07,731 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:07,731 INFO  L87              Difference]: Start difference. First operand 1528 states and 1926 transitions. Second operand  has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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-19 18:04:08,297 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:08,298 INFO  L93              Difference]: Finished difference Result 4158 states and 5316 transitions.
[2024-11-19 18:04:08,298 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:08,298 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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 163
[2024-11-19 18:04:08,299 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:08,305 INFO  L225             Difference]: With dead ends: 4158
[2024-11-19 18:04:08,305 INFO  L226             Difference]: Without dead ends: 2632
[2024-11-19 18:04:08,307 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-19 18:04:08,307 INFO  L432           NwaCegarLoop]: 131 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:08,308 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 155 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-19 18:04:08,310 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2632 states.
[2024-11-19 18:04:08,331 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 2448.
[2024-11-19 18:04:08,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2448 states, 2447 states have (on average 1.2174090723334696) internal successors, (2979), 2447 states have internal predecessors, (2979), 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-19 18:04:08,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 2979 transitions.
[2024-11-19 18:04:08,338 INFO  L78                 Accepts]: Start accepts. Automaton has 2448 states and 2979 transitions. Word has length 163
[2024-11-19 18:04:08,338 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:08,338 INFO  L471      AbstractCegarLoop]: Abstraction has 2448 states and 2979 transitions.
[2024-11-19 18:04:08,339 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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-19 18:04:08,339 INFO  L276                IsEmpty]: Start isEmpty. Operand 2448 states and 2979 transitions.
[2024-11-19 18:04:08,340 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 180
[2024-11-19 18:04:08,340 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:08,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:04:08,340 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-19 18:04:08,341 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:08,341 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:08,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 653368921, now seen corresponding path program 1 times
[2024-11-19 18:04:08,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:08,341 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277862459]
[2024-11-19 18:04:08,342 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:08,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:08,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:08,459 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 18:04:08,459 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:08,459 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277862459]
[2024-11-19 18:04:08,460 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277862459] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:08,460 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:08,460 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 18:04:08,460 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105168508]
[2024-11-19 18:04:08,460 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:08,460 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:08,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:08,461 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:08,461 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:08,461 INFO  L87              Difference]: Start difference. First operand 2448 states and 2979 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-19 18:04:09,047 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:09,048 INFO  L93              Difference]: Finished difference Result 5639 states and 6868 transitions.
[2024-11-19 18:04:09,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:09,049 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-19 18:04:09,049 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:09,058 INFO  L225             Difference]: With dead ends: 5639
[2024-11-19 18:04:09,058 INFO  L226             Difference]: Without dead ends: 3193
[2024-11-19 18:04:09,060 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-19 18:04:09,062 INFO  L432           NwaCegarLoop]: 338 mSDtfsCounter, 165 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:09,063 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 359 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-19 18:04:09,065 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3193 states.
[2024-11-19 18:04:09,090 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3184.
[2024-11-19 18:04:09,093 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3184 states, 3183 states have (on average 1.1991831605403707) internal successors, (3817), 3183 states have internal predecessors, (3817), 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-19 18:04:09,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 3817 transitions.
[2024-11-19 18:04:09,100 INFO  L78                 Accepts]: Start accepts. Automaton has 3184 states and 3817 transitions. Word has length 179
[2024-11-19 18:04:09,100 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:09,101 INFO  L471      AbstractCegarLoop]: Abstraction has 3184 states and 3817 transitions.
[2024-11-19 18:04:09,101 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-19 18:04:09,101 INFO  L276                IsEmpty]: Start isEmpty. Operand 3184 states and 3817 transitions.
[2024-11-19 18:04:09,103 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 218
[2024-11-19 18:04:09,103 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:09,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:04:09,103 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-19 18:04:09,103 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:09,104 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:09,104 INFO  L85        PathProgramCache]: Analyzing trace with hash 1472633207, now seen corresponding path program 1 times
[2024-11-19 18:04:09,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:09,104 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292213635]
[2024-11-19 18:04:09,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:09,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:09,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:09,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2024-11-19 18:04:09,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:09,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292213635]
[2024-11-19 18:04:09,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292213635] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:09,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:09,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 18:04:09,340 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284960491]
[2024-11-19 18:04:09,340 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:09,340 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:09,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:09,340 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:09,341 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:09,341 INFO  L87              Difference]: Start difference. First operand 3184 states and 3817 transitions. Second operand  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 18:04:09,916 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:09,917 INFO  L93              Difference]: Finished difference Result 7108 states and 8504 transitions.
[2024-11-19 18:04:09,917 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:09,917 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217
[2024-11-19 18:04:09,918 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:09,927 INFO  L225             Difference]: With dead ends: 7108
[2024-11-19 18:04:09,927 INFO  L226             Difference]: Without dead ends: 3926
[2024-11-19 18:04:09,931 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-19 18:04:09,931 INFO  L432           NwaCegarLoop]: 126 mSDtfsCounter, 37 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:09,931 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 154 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-19 18:04:09,934 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3926 states.
[2024-11-19 18:04:09,966 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3925.
[2024-11-19 18:04:09,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3925 states, 3924 states have (on average 1.193934760448522) internal successors, (4685), 3924 states have internal predecessors, (4685), 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-19 18:04:09,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 4685 transitions.
[2024-11-19 18:04:09,977 INFO  L78                 Accepts]: Start accepts. Automaton has 3925 states and 4685 transitions. Word has length 217
[2024-11-19 18:04:09,977 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:09,977 INFO  L471      AbstractCegarLoop]: Abstraction has 3925 states and 4685 transitions.
[2024-11-19 18:04:09,977 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 18:04:09,977 INFO  L276                IsEmpty]: Start isEmpty. Operand 3925 states and 4685 transitions.
[2024-11-19 18:04:09,979 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 219
[2024-11-19 18:04:09,979 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:09,979 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-19 18:04:09,979 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-19 18:04:09,979 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:09,980 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:09,980 INFO  L85        PathProgramCache]: Analyzing trace with hash -760864207, now seen corresponding path program 1 times
[2024-11-19 18:04:09,980 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:09,980 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13199628]
[2024-11-19 18:04:09,980 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:09,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:10,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:10,151 INFO  L134       CoverageAnalysis]: Checked inductivity of 136 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked.
[2024-11-19 18:04:10,152 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:10,152 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13199628]
[2024-11-19 18:04:10,153 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13199628] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:10,153 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:10,153 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 18:04:10,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266761272]
[2024-11-19 18:04:10,154 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:10,154 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:10,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:10,155 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:10,155 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:10,155 INFO  L87              Difference]: Start difference. First operand 3925 states and 4685 transitions. Second operand  has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-19 18:04:11,173 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:11,173 INFO  L93              Difference]: Finished difference Result 8591 states and 10347 transitions.
[2024-11-19 18:04:11,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:11,174 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 218
[2024-11-19 18:04:11,174 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:11,186 INFO  L225             Difference]: With dead ends: 8591
[2024-11-19 18:04:11,187 INFO  L226             Difference]: Without dead ends: 4668
[2024-11-19 18:04:11,191 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-19 18:04:11,192 INFO  L432           NwaCegarLoop]: 369 mSDtfsCounter, 161 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:11,193 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 390 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-19 18:04:11,198 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4668 states.
[2024-11-19 18:04:11,239 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4477.
[2024-11-19 18:04:11,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4477 states, 4476 states have (on average 1.1861036639857014) internal successors, (5309), 4476 states have internal predecessors, (5309), 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-19 18:04:11,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 5309 transitions.
[2024-11-19 18:04:11,252 INFO  L78                 Accepts]: Start accepts. Automaton has 4477 states and 5309 transitions. Word has length 218
[2024-11-19 18:04:11,252 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:11,253 INFO  L471      AbstractCegarLoop]: Abstraction has 4477 states and 5309 transitions.
[2024-11-19 18:04:11,253 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-19 18:04:11,253 INFO  L276                IsEmpty]: Start isEmpty. Operand 4477 states and 5309 transitions.
[2024-11-19 18:04:11,255 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 239
[2024-11-19 18:04:11,255 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:11,255 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-19 18:04:11,255 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-19 18:04:11,256 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:11,256 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:11,256 INFO  L85        PathProgramCache]: Analyzing trace with hash 43300159, now seen corresponding path program 1 times
[2024-11-19 18:04:11,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:11,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049763543]
[2024-11-19 18:04:11,256 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:11,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:11,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:11,613 INFO  L134       CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 18:04:11,613 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:11,613 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049763543]
[2024-11-19 18:04:11,613 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049763543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:11,613 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:11,614 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 18:04:11,614 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547801745]
[2024-11-19 18:04:11,614 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:11,614 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 18:04:11,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:11,614 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 18:04:11,615 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 18:04:11,615 INFO  L87              Difference]: Start difference. First operand 4477 states and 5309 transitions. Second operand  has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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-19 18:04:12,617 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:12,618 INFO  L93              Difference]: Finished difference Result 14321 states and 17014 transitions.
[2024-11-19 18:04:12,618 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 18:04:12,618 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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 238
[2024-11-19 18:04:12,619 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:12,643 INFO  L225             Difference]: With dead ends: 14321
[2024-11-19 18:04:12,643 INFO  L226             Difference]: Without dead ends: 9846
[2024-11-19 18:04:12,653 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-19 18:04:12,654 INFO  L432           NwaCegarLoop]: 148 mSDtfsCounter, 302 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:12,654 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 191 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-19 18:04:12,664 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9846 states.
[2024-11-19 18:04:12,770 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 7627.
[2024-11-19 18:04:12,779 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7627 states, 7626 states have (on average 1.1702071859428271) internal successors, (8924), 7626 states have internal predecessors, (8924), 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-19 18:04:12,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7627 states to 7627 states and 8924 transitions.
[2024-11-19 18:04:12,788 INFO  L78                 Accepts]: Start accepts. Automaton has 7627 states and 8924 transitions. Word has length 238
[2024-11-19 18:04:12,789 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:12,789 INFO  L471      AbstractCegarLoop]: Abstraction has 7627 states and 8924 transitions.
[2024-11-19 18:04:12,789 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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-19 18:04:12,789 INFO  L276                IsEmpty]: Start isEmpty. Operand 7627 states and 8924 transitions.
[2024-11-19 18:04:12,791 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2024-11-19 18:04:12,791 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:12,792 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-19 18:04:12,792 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-19 18:04:12,792 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:12,792 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:12,792 INFO  L85        PathProgramCache]: Analyzing trace with hash 1310756102, now seen corresponding path program 1 times
[2024-11-19 18:04:12,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:12,793 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827282904]
[2024-11-19 18:04:12,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:12,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:12,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:13,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 18:04:13,060 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:13,060 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827282904]
[2024-11-19 18:04:13,060 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827282904] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:13,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:13,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 18:04:13,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635405522]
[2024-11-19 18:04:13,061 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:13,061 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 18:04:13,061 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:13,062 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 18:04:13,064 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 18:04:13,064 INFO  L87              Difference]: Start difference. First operand 7627 states and 8924 transitions. Second operand  has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-19 18:04:14,193 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:14,194 INFO  L93              Difference]: Finished difference Result 20234 states and 23746 transitions.
[2024-11-19 18:04:14,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 18:04:14,194 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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 248
[2024-11-19 18:04:14,195 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:14,211 INFO  L225             Difference]: With dead ends: 20234
[2024-11-19 18:04:14,212 INFO  L226             Difference]: Without dead ends: 12609
[2024-11-19 18:04:14,218 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-19 18:04:14,219 INFO  L432           NwaCegarLoop]: 76 mSDtfsCounter, 316 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:14,219 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 113 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-19 18:04:14,228 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12609 states.
[2024-11-19 18:04:14,305 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12609 to 10202.
[2024-11-19 18:04:14,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10202 states, 10201 states have (on average 1.1734143711400844) internal successors, (11970), 10201 states have internal predecessors, (11970), 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-19 18:04:14,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 11970 transitions.
[2024-11-19 18:04:14,329 INFO  L78                 Accepts]: Start accepts. Automaton has 10202 states and 11970 transitions. Word has length 248
[2024-11-19 18:04:14,329 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:14,329 INFO  L471      AbstractCegarLoop]: Abstraction has 10202 states and 11970 transitions.
[2024-11-19 18:04:14,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-19 18:04:14,330 INFO  L276                IsEmpty]: Start isEmpty. Operand 10202 states and 11970 transitions.
[2024-11-19 18:04:14,332 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2024-11-19 18:04:14,332 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:14,333 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-19 18:04:14,333 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-19 18:04:14,333 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:14,333 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:14,333 INFO  L85        PathProgramCache]: Analyzing trace with hash -499731777, now seen corresponding path program 1 times
[2024-11-19 18:04:14,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:14,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524565271]
[2024-11-19 18:04:14,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:14,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:14,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:14,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 18:04:14,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:14,477 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524565271]
[2024-11-19 18:04:14,477 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524565271] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:14,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:14,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 18:04:14,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380466732]
[2024-11-19 18:04:14,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:14,478 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:14,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:14,479 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:14,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:14,483 INFO  L87              Difference]: Start difference. First operand 10202 states and 11970 transitions. Second operand  has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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-19 18:04:15,079 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:15,080 INFO  L93              Difference]: Finished difference Result 20399 states and 23935 transitions.
[2024-11-19 18:04:15,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:15,081 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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 248
[2024-11-19 18:04:15,081 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:15,093 INFO  L225             Difference]: With dead ends: 20399
[2024-11-19 18:04:15,094 INFO  L226             Difference]: Without dead ends: 10199
[2024-11-19 18:04:15,102 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:15,103 INFO  L432           NwaCegarLoop]: 285 mSDtfsCounter, 148 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:15,103 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 305 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-19 18:04:15,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10199 states.
[2024-11-19 18:04:15,176 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10199 to 10199.
[2024-11-19 18:04:15,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10199 states, 10198 states have (on average 1.1445381447342615) internal successors, (11672), 10198 states have internal predecessors, (11672), 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-19 18:04:15,196 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 11672 transitions.
[2024-11-19 18:04:15,196 INFO  L78                 Accepts]: Start accepts. Automaton has 10199 states and 11672 transitions. Word has length 248
[2024-11-19 18:04:15,197 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:15,197 INFO  L471      AbstractCegarLoop]: Abstraction has 10199 states and 11672 transitions.
[2024-11-19 18:04:15,197 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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-19 18:04:15,197 INFO  L276                IsEmpty]: Start isEmpty. Operand 10199 states and 11672 transitions.
[2024-11-19 18:04:15,200 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2024-11-19 18:04:15,200 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:15,200 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 18:04:15,200 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-19 18:04:15,201 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:15,201 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:15,201 INFO  L85        PathProgramCache]: Analyzing trace with hash -1714177798, now seen corresponding path program 1 times
[2024-11-19 18:04:15,201 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:15,201 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328175219]
[2024-11-19 18:04:15,201 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:15,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:15,236 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:15,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 153 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2024-11-19 18:04:15,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:15,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328175219]
[2024-11-19 18:04:15,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328175219] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 18:04:15,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931891487]
[2024-11-19 18:04:15,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:15,558 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 18:04:15,558 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 18:04:15,563 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-19 18:04:15,565 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-19 18:04:15,674 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:15,676 INFO  L255         TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-19 18:04:15,688 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 18:04:15,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 153 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2024-11-19 18:04:15,759 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 18:04:15,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931891487] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:15,760 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-19 18:04:15,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2024-11-19 18:04:15,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655962185]
[2024-11-19 18:04:15,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:15,761 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:15,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:15,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:15,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-19 18:04:15,762 INFO  L87              Difference]: Start difference. First operand 10199 states and 11672 transitions. Second operand  has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-19 18:04:16,429 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:16,430 INFO  L93              Difference]: Finished difference Result 22787 states and 26113 transitions.
[2024-11-19 18:04:16,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:16,430 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 250
[2024-11-19 18:04:16,431 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:16,448 INFO  L225             Difference]: With dead ends: 22787
[2024-11-19 18:04:16,448 INFO  L226             Difference]: Without dead ends: 12590
[2024-11-19 18:04:16,458 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-19 18:04:16,459 INFO  L432           NwaCegarLoop]: 347 mSDtfsCounter, 162 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:16,459 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 370 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-19 18:04:16,467 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12590 states.
[2024-11-19 18:04:16,538 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12590 to 11114.
[2024-11-19 18:04:16,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11114 states, 11113 states have (on average 1.1383064878970575) internal successors, (12650), 11113 states have internal predecessors, (12650), 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-19 18:04:16,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11114 states to 11114 states and 12650 transitions.
[2024-11-19 18:04:16,560 INFO  L78                 Accepts]: Start accepts. Automaton has 11114 states and 12650 transitions. Word has length 250
[2024-11-19 18:04:16,560 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:16,561 INFO  L471      AbstractCegarLoop]: Abstraction has 11114 states and 12650 transitions.
[2024-11-19 18:04:16,561 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-19 18:04:16,561 INFO  L276                IsEmpty]: Start isEmpty. Operand 11114 states and 12650 transitions.
[2024-11-19 18:04:16,564 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 256
[2024-11-19 18:04:16,564 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:16,565 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 18:04:16,571 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-19 18:04:16,765 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,SelfDestructingSolverStorable11
[2024-11-19 18:04:16,766 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:16,766 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:16,766 INFO  L85        PathProgramCache]: Analyzing trace with hash 360106579, now seen corresponding path program 1 times
[2024-11-19 18:04:16,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:16,767 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631118512]
[2024-11-19 18:04:16,767 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:16,767 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:16,816 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:17,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 163 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2024-11-19 18:04:17,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:17,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631118512]
[2024-11-19 18:04:17,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631118512] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:17,034 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:17,034 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 18:04:17,034 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765321737]
[2024-11-19 18:04:17,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:17,035 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:17,035 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:17,035 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:17,035 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:17,035 INFO  L87              Difference]: Start difference. First operand 11114 states and 12650 transitions. Second operand  has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-19 18:04:17,819 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:17,820 INFO  L93              Difference]: Finished difference Result 22413 states and 25494 transitions.
[2024-11-19 18:04:17,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:17,820 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 255
[2024-11-19 18:04:17,821 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:17,832 INFO  L225             Difference]: With dead ends: 22413
[2024-11-19 18:04:17,832 INFO  L226             Difference]: Without dead ends: 11301
[2024-11-19 18:04:17,842 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-19 18:04:17,842 INFO  L432           NwaCegarLoop]: 351 mSDtfsCounter, 164 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:17,842 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 373 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-19 18:04:17,849 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11301 states.
[2024-11-19 18:04:17,915 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11301 to 11113.
[2024-11-19 18:04:17,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11113 states, 11112 states have (on average 1.1175305975521959) internal successors, (12418), 11112 states have internal predecessors, (12418), 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-19 18:04:17,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11113 states to 11113 states and 12418 transitions.
[2024-11-19 18:04:17,933 INFO  L78                 Accepts]: Start accepts. Automaton has 11113 states and 12418 transitions. Word has length 255
[2024-11-19 18:04:17,934 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:17,934 INFO  L471      AbstractCegarLoop]: Abstraction has 11113 states and 12418 transitions.
[2024-11-19 18:04:17,934 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-19 18:04:17,934 INFO  L276                IsEmpty]: Start isEmpty. Operand 11113 states and 12418 transitions.
[2024-11-19 18:04:17,937 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 270
[2024-11-19 18:04:17,938 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:17,938 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-19 18:04:17,938 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-19 18:04:17,938 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:17,938 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:17,938 INFO  L85        PathProgramCache]: Analyzing trace with hash 2039816122, now seen corresponding path program 1 times
[2024-11-19 18:04:17,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:17,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101748769]
[2024-11-19 18:04:17,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:17,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:17,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:18,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 156 backedges. 123 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 18:04:18,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:18,373 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101748769]
[2024-11-19 18:04:18,373 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101748769] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 18:04:18,373 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966291990]
[2024-11-19 18:04:18,373 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:18,373 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 18:04:18,373 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 18:04:18,375 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-19 18:04:18,378 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-19 18:04:18,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:18,463 INFO  L255         TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-19 18:04:18,470 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 18:04:18,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 18:04:18,809 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 18:04:18,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966291990] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:18,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-19 18:04:18,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2024-11-19 18:04:18,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600176196]
[2024-11-19 18:04:18,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:18,809 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 18:04:18,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:18,810 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 18:04:18,810 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-19 18:04:18,810 INFO  L87              Difference]: Start difference. First operand 11113 states and 12418 transitions. Second operand  has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 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-19 18:04:19,615 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:19,615 INFO  L93              Difference]: Finished difference Result 22227 states and 24838 transitions.
[2024-11-19 18:04:19,616 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 18:04:19,616 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 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 269
[2024-11-19 18:04:19,616 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:19,625 INFO  L225             Difference]: With dead ends: 22227
[2024-11-19 18:04:19,626 INFO  L226             Difference]: Without dead ends: 11116
[2024-11-19 18:04:19,631 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-19 18:04:19,632 INFO  L432           NwaCegarLoop]: 123 mSDtfsCounter, 187 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:19,632 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 155 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-19 18:04:19,637 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11116 states.
[2024-11-19 18:04:19,700 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11116 to 11113.
[2024-11-19 18:04:19,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11113 states, 11112 states have (on average 1.1164506839452844) internal successors, (12406), 11112 states have internal predecessors, (12406), 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-19 18:04:19,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11113 states to 11113 states and 12406 transitions.
[2024-11-19 18:04:19,718 INFO  L78                 Accepts]: Start accepts. Automaton has 11113 states and 12406 transitions. Word has length 269
[2024-11-19 18:04:19,718 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:19,719 INFO  L471      AbstractCegarLoop]: Abstraction has 11113 states and 12406 transitions.
[2024-11-19 18:04:19,719 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 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-19 18:04:19,719 INFO  L276                IsEmpty]: Start isEmpty. Operand 11113 states and 12406 transitions.
[2024-11-19 18:04:19,724 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 304
[2024-11-19 18:04:19,724 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:19,724 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:04:19,731 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-19 18:04:19,928 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,SelfDestructingSolverStorable13
[2024-11-19 18:04:19,929 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:19,929 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:19,929 INFO  L85        PathProgramCache]: Analyzing trace with hash 1065717957, now seen corresponding path program 1 times
[2024-11-19 18:04:19,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:19,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704343592]
[2024-11-19 18:04:19,929 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:19,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:19,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:20,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 324 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked.
[2024-11-19 18:04:20,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:20,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704343592]
[2024-11-19 18:04:20,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704343592] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:20,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:20,120 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 18:04:20,120 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010810782]
[2024-11-19 18:04:20,120 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:20,120 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:20,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:20,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:20,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:20,120 INFO  L87              Difference]: Start difference. First operand 11113 states and 12406 transitions. Second operand  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 18:04:20,698 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:20,698 INFO  L93              Difference]: Finished difference Result 23512 states and 26255 transitions.
[2024-11-19 18:04:20,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:20,698 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 303
[2024-11-19 18:04:20,699 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:20,712 INFO  L225             Difference]: With dead ends: 23512
[2024-11-19 18:04:20,712 INFO  L226             Difference]: Without dead ends: 12401
[2024-11-19 18:04:20,720 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-19 18:04:20,721 INFO  L432           NwaCegarLoop]: 355 mSDtfsCounter, 157 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:20,721 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 382 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-19 18:04:20,729 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12401 states.
[2024-11-19 18:04:20,863 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12401 to 11849.
[2024-11-19 18:04:20,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11849 states, 11848 states have (on average 1.112255232950709) internal successors, (13178), 11848 states have internal predecessors, (13178), 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-19 18:04:20,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 13178 transitions.
[2024-11-19 18:04:20,887 INFO  L78                 Accepts]: Start accepts. Automaton has 11849 states and 13178 transitions. Word has length 303
[2024-11-19 18:04:20,887 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:20,887 INFO  L471      AbstractCegarLoop]: Abstraction has 11849 states and 13178 transitions.
[2024-11-19 18:04:20,887 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 18:04:20,887 INFO  L276                IsEmpty]: Start isEmpty. Operand 11849 states and 13178 transitions.
[2024-11-19 18:04:20,894 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 308
[2024-11-19 18:04:20,894 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:20,894 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-19 18:04:20,894 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-19 18:04:20,894 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:20,897 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:20,898 INFO  L85        PathProgramCache]: Analyzing trace with hash -698824767, now seen corresponding path program 1 times
[2024-11-19 18:04:20,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:20,898 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878992880]
[2024-11-19 18:04:20,898 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:20,899 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:20,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:21,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 327 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked.
[2024-11-19 18:04:21,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:21,372 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878992880]
[2024-11-19 18:04:21,372 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878992880] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:21,372 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:21,372 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 18:04:21,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753372183]
[2024-11-19 18:04:21,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:21,372 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 18:04:21,372 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:21,373 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 18:04:21,373 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 18:04:21,373 INFO  L87              Difference]: Start difference. First operand 11849 states and 13178 transitions. Second operand  has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-19 18:04:22,517 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:22,517 INFO  L93              Difference]: Finished difference Result 29438 states and 32746 transitions.
[2024-11-19 18:04:22,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 18:04:22,518 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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 307
[2024-11-19 18:04:22,519 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:22,535 INFO  L225             Difference]: With dead ends: 29438
[2024-11-19 18:04:22,536 INFO  L226             Difference]: Without dead ends: 16850
[2024-11-19 18:04:22,545 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-19 18:04:22,545 INFO  L432           NwaCegarLoop]: 360 mSDtfsCounter, 303 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:22,545 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 421 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-19 18:04:22,556 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16850 states.
[2024-11-19 18:04:22,688 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16850 to 13338.
[2024-11-19 18:04:22,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13338 states, 13337 states have (on average 1.1131438854315063) internal successors, (14846), 13337 states have internal predecessors, (14846), 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-19 18:04:22,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13338 states to 13338 states and 14846 transitions.
[2024-11-19 18:04:22,711 INFO  L78                 Accepts]: Start accepts. Automaton has 13338 states and 14846 transitions. Word has length 307
[2024-11-19 18:04:22,711 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:22,711 INFO  L471      AbstractCegarLoop]: Abstraction has 13338 states and 14846 transitions.
[2024-11-19 18:04:22,712 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-19 18:04:22,712 INFO  L276                IsEmpty]: Start isEmpty. Operand 13338 states and 14846 transitions.
[2024-11-19 18:04:22,717 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 324
[2024-11-19 18:04:22,717 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:22,717 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-19 18:04:22,717 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-19 18:04:22,717 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:22,718 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:22,718 INFO  L85        PathProgramCache]: Analyzing trace with hash -2127545959, now seen corresponding path program 1 times
[2024-11-19 18:04:22,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:22,718 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452718058]
[2024-11-19 18:04:22,718 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:22,718 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:22,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:22,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 359 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2024-11-19 18:04:22,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:22,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452718058]
[2024-11-19 18:04:22,937 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452718058] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:22,937 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:22,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 18:04:22,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036424652]
[2024-11-19 18:04:22,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:22,938 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 18:04:22,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:22,939 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 18:04:22,939 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 18:04:22,939 INFO  L87              Difference]: Start difference. First operand 13338 states and 14846 transitions. Second operand  has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-19 18:04:24,013 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:24,013 INFO  L93              Difference]: Finished difference Result 34066 states and 37871 transitions.
[2024-11-19 18:04:24,014 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 18:04:24,014 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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 323
[2024-11-19 18:04:24,014 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:24,037 INFO  L225             Difference]: With dead ends: 34066
[2024-11-19 18:04:24,038 INFO  L226             Difference]: Without dead ends: 20730
[2024-11-19 18:04:24,049 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-19 18:04:24,050 INFO  L432           NwaCegarLoop]: 55 mSDtfsCounter, 327 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:24,050 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 87 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-19 18:04:24,064 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20730 states.
[2024-11-19 18:04:24,227 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20730 to 19063.
[2024-11-19 18:04:24,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19063 states, 19062 states have (on average 1.1078585667820795) internal successors, (21118), 19062 states have internal predecessors, (21118), 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-19 18:04:24,259 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19063 states to 19063 states and 21118 transitions.
[2024-11-19 18:04:24,260 INFO  L78                 Accepts]: Start accepts. Automaton has 19063 states and 21118 transitions. Word has length 323
[2024-11-19 18:04:24,260 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:24,260 INFO  L471      AbstractCegarLoop]: Abstraction has 19063 states and 21118 transitions.
[2024-11-19 18:04:24,260 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-19 18:04:24,260 INFO  L276                IsEmpty]: Start isEmpty. Operand 19063 states and 21118 transitions.
[2024-11-19 18:04:24,268 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 333
[2024-11-19 18:04:24,268 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:24,268 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 18:04:24,268 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-19 18:04:24,269 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:24,269 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:24,269 INFO  L85        PathProgramCache]: Analyzing trace with hash -409863096, now seen corresponding path program 1 times
[2024-11-19 18:04:24,269 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:24,269 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775895165]
[2024-11-19 18:04:24,269 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:24,269 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:24,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:24,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 351 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked.
[2024-11-19 18:04:24,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:24,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775895165]
[2024-11-19 18:04:24,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775895165] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:24,394 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:24,394 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 18:04:24,394 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083722717]
[2024-11-19 18:04:24,394 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:24,394 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:24,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:24,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:24,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:24,395 INFO  L87              Difference]: Start difference. First operand 19063 states and 21118 transitions. Second operand  has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-19 18:04:24,937 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:24,937 INFO  L93              Difference]: Finished difference Result 40515 states and 44895 transitions.
[2024-11-19 18:04:24,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:24,938 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 332
[2024-11-19 18:04:24,938 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:24,958 INFO  L225             Difference]: With dead ends: 40515
[2024-11-19 18:04:24,959 INFO  L226             Difference]: Without dead ends: 21454
[2024-11-19 18:04:24,972 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-19 18:04:24,972 INFO  L432           NwaCegarLoop]: 120 mSDtfsCounter, 185 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:24,972 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 144 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-19 18:04:24,985 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21454 states.
[2024-11-19 18:04:25,122 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21454 to 19058.
[2024-11-19 18:04:25,136 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19058 states, 19057 states have (on average 1.108306658970457) internal successors, (21121), 19057 states have internal predecessors, (21121), 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-19 18:04:25,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19058 states to 19058 states and 21121 transitions.
[2024-11-19 18:04:25,263 INFO  L78                 Accepts]: Start accepts. Automaton has 19058 states and 21121 transitions. Word has length 332
[2024-11-19 18:04:25,263 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:25,263 INFO  L471      AbstractCegarLoop]: Abstraction has 19058 states and 21121 transitions.
[2024-11-19 18:04:25,264 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-19 18:04:25,264 INFO  L276                IsEmpty]: Start isEmpty. Operand 19058 states and 21121 transitions.
[2024-11-19 18:04:25,269 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 335
[2024-11-19 18:04:25,270 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:25,270 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-19 18:04:25,270 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-19 18:04:25,270 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:25,270 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:25,271 INFO  L85        PathProgramCache]: Analyzing trace with hash -359061517, now seen corresponding path program 1 times
[2024-11-19 18:04:25,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:25,271 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642146642]
[2024-11-19 18:04:25,271 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:25,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:25,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:25,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 191 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2024-11-19 18:04:25,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:25,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642146642]
[2024-11-19 18:04:25,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642146642] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:25,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:25,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 18:04:25,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399628319]
[2024-11-19 18:04:25,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:25,484 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 18:04:25,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:25,484 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 18:04:25,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 18:04:25,484 INFO  L87              Difference]: Start difference. First operand 19058 states and 21121 transitions. Second operand  has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-19 18:04:26,211 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:26,212 INFO  L93              Difference]: Finished difference Result 40702 states and 45085 transitions.
[2024-11-19 18:04:26,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 18:04:26,212 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 334
[2024-11-19 18:04:26,213 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:26,234 INFO  L225             Difference]: With dead ends: 40702
[2024-11-19 18:04:26,234 INFO  L226             Difference]: Without dead ends: 21646
[2024-11-19 18:04:26,248 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-19 18:04:26,248 INFO  L432           NwaCegarLoop]: 115 mSDtfsCounter, 186 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:26,249 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 135 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-19 18:04:26,261 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21646 states.
[2024-11-19 18:04:26,460 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21646 to 17385.
[2024-11-19 18:04:26,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17385 states, 17384 states have (on average 1.1077427519558214) internal successors, (19257), 17384 states have internal predecessors, (19257), 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-19 18:04:26,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17385 states to 17385 states and 19257 transitions.
[2024-11-19 18:04:26,496 INFO  L78                 Accepts]: Start accepts. Automaton has 17385 states and 19257 transitions. Word has length 334
[2024-11-19 18:04:26,497 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:26,497 INFO  L471      AbstractCegarLoop]: Abstraction has 17385 states and 19257 transitions.
[2024-11-19 18:04:26,497 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-19 18:04:26,497 INFO  L276                IsEmpty]: Start isEmpty. Operand 17385 states and 19257 transitions.
[2024-11-19 18:04:26,511 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 359
[2024-11-19 18:04:26,511 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 18:04:26,512 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-19 18:04:26,512 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-19 18:04:26,512 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 18:04:26,512 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 18:04:26,513 INFO  L85        PathProgramCache]: Analyzing trace with hash -108272370, now seen corresponding path program 1 times
[2024-11-19 18:04:26,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 18:04:26,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469654284]
[2024-11-19 18:04:26,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 18:04:26,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 18:04:26,598 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 18:04:26,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 384 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked.
[2024-11-19 18:04:26,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 18:04:26,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469654284]
[2024-11-19 18:04:26,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469654284] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 18:04:26,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 18:04:26,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 18:04:26,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690070620]
[2024-11-19 18:04:26,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 18:04:26,986 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 18:04:26,986 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 18:04:26,986 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 18:04:26,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 18:04:26,986 INFO  L87              Difference]: Start difference. First operand 17385 states and 19257 transitions. Second operand  has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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-19 18:04:27,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 18:04:27,924 INFO  L93              Difference]: Finished difference Result 37721 states and 41614 transitions.
[2024-11-19 18:04:27,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 18:04:27,924 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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 358
[2024-11-19 18:04:27,925 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 18:04:27,925 INFO  L225             Difference]: With dead ends: 37721
[2024-11-19 18:04:27,925 INFO  L226             Difference]: Without dead ends: 0
[2024-11-19 18:04:27,938 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-19 18:04:27,939 INFO  L432           NwaCegarLoop]: 33 mSDtfsCounter, 321 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-19 18:04:27,939 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 57 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-19 18:04:27,940 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-19 18:04:27,940 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-19 18:04:27,943 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-19 18:04:27,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-19 18:04:27,944 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 358
[2024-11-19 18:04:27,944 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 18:04:27,944 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-19 18:04:27,944 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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-19 18:04:27,944 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-19 18:04:27,944 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-19 18:04:27,946 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-19 18:04:27,948 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-11-19 18:04:27,951 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 18:04:27,953 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-19 18:04:33,067 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-19 18:04:33,084 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:04:33 BoogieIcfgContainer
[2024-11-19 18:04:33,084 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-19 18:04:33,084 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-19 18:04:33,084 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-19 18:04:33,085 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-19 18:04:33,085 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:04:03" (3/4) ...
[2024-11-19 18:04:33,086 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-19 18:04:33,104 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-19 18:04:33,104 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-19 18:04:33,105 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-19 18:04:33,106 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-19 18:04:33,268 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-19 18:04:33,268 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-19 18:04:33,268 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-19 18:04:33,269 INFO  L158              Benchmark]: Toolchain (without parser) took 32167.57ms. Allocated memory was 163.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 88.2MB in the beginning and 1.1GB in the end (delta: -996.2MB). Peak memory consumption was 187.4MB. Max. memory is 16.1GB.
[2024-11-19 18:04:33,269 INFO  L158              Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 18:04:33,270 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 1131.16ms. Allocated memory was 163.6MB in the beginning and 281.0MB in the end (delta: 117.4MB). Free memory was 87.9MB in the beginning and 218.5MB in the end (delta: -130.6MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB.
[2024-11-19 18:04:33,270 INFO  L158              Benchmark]: Boogie Procedure Inliner took 135.47ms. Allocated memory is still 281.0MB. Free memory was 218.5MB in the beginning and 200.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-19 18:04:33,273 INFO  L158              Benchmark]: Boogie Preprocessor took 172.81ms. Allocated memory is still 281.0MB. Free memory was 200.7MB in the beginning and 175.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-19 18:04:33,273 INFO  L158              Benchmark]: RCFGBuilder took 1284.78ms. Allocated memory is still 281.0MB. Free memory was 175.5MB in the beginning and 151.8MB in the end (delta: 23.7MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB.
[2024-11-19 18:04:33,273 INFO  L158              Benchmark]: TraceAbstraction took 29253.96ms. Allocated memory was 281.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 150.8MB in the beginning and 1.1GB in the end (delta: -950.3MB). Peak memory consumption was 813.5MB. Max. memory is 16.1GB.
[2024-11-19 18:04:33,273 INFO  L158              Benchmark]: Witness Printer took 184.01ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-19 18:04:33,274 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.13ms. Allocated memory is still 163.6MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 1131.16ms. Allocated memory was 163.6MB in the beginning and 281.0MB in the end (delta: 117.4MB). Free memory was 87.9MB in the beginning and 218.5MB in the end (delta: -130.6MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 135.47ms. Allocated memory is still 281.0MB. Free memory was 218.5MB in the beginning and 200.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 172.81ms. Allocated memory is still 281.0MB. Free memory was 200.7MB in the beginning and 175.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1284.78ms. Allocated memory is still 281.0MB. Free memory was 175.5MB in the beginning and 151.8MB in the end (delta: 23.7MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 29253.96ms. Allocated memory was 281.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 150.8MB in the beginning and 1.1GB in the end (delta: -950.3MB). Peak memory consumption was 813.5MB. Max. memory is 16.1GB.
 * Witness Printer took 184.01ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.1GB 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: 124]: 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: 24.1s, OverallIterations: 20, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3861 SdHoareTripleChecker+Valid, 14.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3861 mSDsluCounter, 4633 SdHoareTripleChecker+Invalid, 11.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 2006 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14278 IncrementalHoareTripleChecker+Invalid, 16284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2006 mSolverCounterUnsat, 4085 mSDtfsCounter, 14278 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 580 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19063occurred in iteration=17, 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: 2.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 19275 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 5154 NumberOfCodeBlocks, 5154 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 5132 ConstructedInterpolants, 0 QuantifiedInterpolants, 14069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 741 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 3453/3514 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: (((((((((((((((((((((long long) a23 + 43) <= 0) && (a29 <= 384312)) && (a4 == 0)) && (a25 <= 9)) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || (((a4 == 0) && (a25 <= 10)) && (a29 <= 220))) || (((a25 == 13) && (a29 <= 384312)) && (a4 == 1))) || (((a29 <= 384312) && (a4 == 1)) && (a25 <= 9))) || (((a29 <= 244) && (a25 <= 10)) && (a4 == 1))) || (((a29 <= 275) && (a25 == 12)) && (a4 == 0))) || ((((a25 == 13) && (a4 == 0)) && (((long long) 35913 + a29) <= 0)) && (a23 <= 137))) || ((((307 <= a23) && (a25 <= 10)) && (a29 <= 599999)) && (a4 == 1))) || (((a25 == 12) && (a29 <= 599999)) && (a4 == 1))) || ((((a25 <= 10) && (a29 <= 599999)) && (381712 <= a29)) && (a4 == 1))) || ((a29 <= 599999) && ((((((long long) a23 + 43) <= 0) && (a29 <= 275)) && (a4 == 1)) || (((((long long) a23 + 43) <= 0) && (a25 <= 10)) && (a4 == 1))))) || (((a25 == 11) && (a4 == 1)) && (a23 <= 137))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599999)) && (a23 <= 137))) || (((a4 == 0) && (a25 == 11)) && (a29 <= 599999))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 275)) && (a4 == 0)))
RESULT: Ultimate proved your program to be correct!
[2024-11-19 18:04:33,298 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