./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/Problem01_label11.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 84cfde4a
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label11.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2dc34619b8722f38daca39084af716acca2f2990c40299072c7b560e6e3245de
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-84cfde4
[2024-10-10 22:33:25,616 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-10 22:33:25,678 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-10 22:33:25,684 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-10 22:33:25,684 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-10 22:33:25,711 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-10 22:33:25,712 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-10 22:33:25,712 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-10 22:33:25,712 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-10 22:33:25,715 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-10-10 22:33:25,715 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-10 22:33:25,715 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-10 22:33:25,716 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-10 22:33:25,716 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-10 22:33:25,716 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-10 22:33:25,716 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-10 22:33:25,717 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-10 22:33:25,717 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-10 22:33:25,717 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-10 22:33:25,717 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-10 22:33:25,717 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-10 22:33:25,718 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-10 22:33:25,718 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-10 22:33:25,718 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-10 22:33:25,718 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-10 22:33:25,718 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-10 22:33:25,718 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-10 22:33:25,719 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-10 22:33:25,719 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-10 22:33:25,719 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-10 22:33:25,719 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-10-10 22:33:25,719 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-10 22:33:25,719 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-10 22:33:25,720 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-10 22:33:25,720 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-10 22:33:25,720 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-10 22:33:25,720 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-10 22:33:25,720 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-10 22:33:25,720 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-10 22:33:25,720 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-10 22:33:25,721 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-10-10 22:33:25,722 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-10 22:33:25,722 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-clean/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-clean/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 -> 2dc34619b8722f38daca39084af716acca2f2990c40299072c7b560e6e3245de
[2024-10-10 22:33:25,938 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-10 22:33:25,961 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-10 22:33:25,975 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-10 22:33:25,977 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-10 22:33:25,978 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-10 22:33:25,979 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label11.c
[2024-10-10 22:33:27,232 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-10 22:33:27,451 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-10 22:33:27,455 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label11.c
[2024-10-10 22:33:27,465 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/98a12112e/a90dcb71bd964658ada7454807b3e453/FLAGcc966cd7b
[2024-10-10 22:33:27,486 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/98a12112e/a90dcb71bd964658ada7454807b3e453
[2024-10-10 22:33:27,488 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-10 22:33:27,489 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-10 22:33:27,492 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-10 22:33:27,492 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-10 22:33:27,497 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-10 22:33:27,498 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:27,498 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b106b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27, skipping insertion in model container
[2024-10-10 22:33:27,498 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:27,533 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-10 22:33:27,764 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label11.c[19099,19112]
[2024-10-10 22:33:27,822 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-10 22:33:27,831 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-10 22:33:27,916 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label11.c[19099,19112]
[2024-10-10 22:33:27,924 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-10 22:33:27,937 INFO  L204         MainTranslator]: Completed translation
[2024-10-10 22:33:27,938 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27 WrapperNode
[2024-10-10 22:33:27,938 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-10 22:33:27,939 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-10 22:33:27,939 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-10 22:33:27,939 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-10 22:33:27,945 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:27,965 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:28,001 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658
[2024-10-10 22:33:28,001 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-10 22:33:28,002 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-10 22:33:28,002 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-10 22:33:28,002 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-10 22:33:28,012 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:28,012 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:28,016 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:28,040 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-10-10 22:33:28,041 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:28,041 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:28,063 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:28,070 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:28,075 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:28,078 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:28,084 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-10 22:33:28,088 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-10 22:33:28,089 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-10 22:33:28,089 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-10 22:33:28,090 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (1/1) ...
[2024-10-10 22:33:28,095 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-10 22:33:28,108 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3
[2024-10-10 22:33:28,127 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-10-10 22:33:28,133 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-10-10 22:33:28,176 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-10 22:33:28,176 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-10 22:33:28,177 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-10 22:33:28,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-10 22:33:28,242 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-10 22:33:28,244 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-10 22:33:29,046 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2024-10-10 22:33:29,047 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-10 22:33:29,121 INFO  L309             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-10 22:33:29,121 INFO  L314             CfgBuilder]: Removed 1 assume(true) statements.
[2024-10-10 22:33:29,122 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:33:29 BoogieIcfgContainer
[2024-10-10 22:33:29,122 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-10 22:33:29,123 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-10 22:33:29,124 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-10 22:33:29,126 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-10 22:33:29,127 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:33:27" (1/3) ...
[2024-10-10 22:33:29,128 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca8930d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:33:29, skipping insertion in model container
[2024-10-10 22:33:29,128 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:27" (2/3) ...
[2024-10-10 22:33:29,129 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca8930d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:33:29, skipping insertion in model container
[2024-10-10 22:33:29,129 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:33:29" (3/3) ...
[2024-10-10 22:33:29,130 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem01_label11.c
[2024-10-10 22:33:29,145 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-10 22:33:29,145 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-10 22:33:29,206 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-10 22:33:29,214 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;@214e4fc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-10 22:33:29,215 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-10 22:33:29,218 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 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-10-10 22:33:29,229 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2024-10-10 22:33:29,229 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:29,231 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-10 22:33:29,231 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:29,236 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:29,236 INFO  L85        PathProgramCache]: Analyzing trace with hash -1198555533, now seen corresponding path program 1 times
[2024-10-10 22:33:29,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:29,245 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53270870]
[2024-10-10 22:33:29,245 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:29,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:29,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:29,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-10 22:33:29,575 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:29,575 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53270870]
[2024-10-10 22:33:29,576 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53270870] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:29,576 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-10 22:33:29,576 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-10 22:33:29,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990233944]
[2024-10-10 22:33:29,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:29,582 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-10-10 22:33:29,582 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:29,607 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-10-10 22:33:29,608 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-10 22:33:29,610 INFO  L87              Difference]: Start difference. First operand  has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 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 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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-10-10 22:33:29,645 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:29,647 INFO  L93              Difference]: Finished difference Result 271 states and 529 transitions.
[2024-10-10 22:33:29,648 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-10 22:33:29,649 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108
[2024-10-10 22:33:29,650 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:29,658 INFO  L225             Difference]: With dead ends: 271
[2024-10-10 22:33:29,658 INFO  L226             Difference]: Without dead ends: 134
[2024-10-10 22:33:29,661 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-10 22:33:29,664 INFO  L432           NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:29,665 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-10 22:33:29,680 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2024-10-10 22:33:29,695 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134.
[2024-10-10 22:33:29,697 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 0 states have call successors, (0), 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-10-10 22:33:29,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions.
[2024-10-10 22:33:29,701 INFO  L78                 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 108
[2024-10-10 22:33:29,701 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:29,701 INFO  L471      AbstractCegarLoop]: Abstraction has 134 states and 200 transitions.
[2024-10-10 22:33:29,701 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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-10-10 22:33:29,702 INFO  L276                IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions.
[2024-10-10 22:33:29,705 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2024-10-10 22:33:29,705 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:29,705 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-10 22:33:29,706 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-10 22:33:29,706 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:29,706 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:29,706 INFO  L85        PathProgramCache]: Analyzing trace with hash -1721528346, now seen corresponding path program 1 times
[2024-10-10 22:33:29,707 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:29,707 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430659452]
[2024-10-10 22:33:29,707 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:29,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:29,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:29,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-10 22:33:29,967 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:29,967 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430659452]
[2024-10-10 22:33:29,967 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430659452] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:29,967 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-10 22:33:29,967 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-10 22:33:29,967 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93300359]
[2024-10-10 22:33:29,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:29,969 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-10 22:33:29,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:29,972 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-10 22:33:29,972 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-10 22:33:29,973 INFO  L87              Difference]: Start difference. First operand 134 states and 200 transitions. Second operand  has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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-10-10 22:33:30,390 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:30,390 INFO  L93              Difference]: Finished difference Result 398 states and 597 transitions.
[2024-10-10 22:33:30,390 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-10 22:33:30,391 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108
[2024-10-10 22:33:30,391 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:30,393 INFO  L225             Difference]: With dead ends: 398
[2024-10-10 22:33:30,393 INFO  L226             Difference]: Without dead ends: 265
[2024-10-10 22:33:30,393 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-10-10 22:33:30,394 INFO  L432           NwaCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:30,395 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 29 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-10 22:33:30,396 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 265 states.
[2024-10-10 22:33:30,414 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265.
[2024-10-10 22:33:30,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 265 states, 264 states have (on average 1.4356060606060606) internal successors, (379), 264 states have internal predecessors, (379), 0 states have call successors, (0), 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-10-10 22:33:30,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 379 transitions.
[2024-10-10 22:33:30,423 INFO  L78                 Accepts]: Start accepts. Automaton has 265 states and 379 transitions. Word has length 108
[2024-10-10 22:33:30,424 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:30,424 INFO  L471      AbstractCegarLoop]: Abstraction has 265 states and 379 transitions.
[2024-10-10 22:33:30,424 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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-10-10 22:33:30,424 INFO  L276                IsEmpty]: Start isEmpty. Operand 265 states and 379 transitions.
[2024-10-10 22:33:30,426 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2024-10-10 22:33:30,428 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:30,428 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-10 22:33:30,428 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-10 22:33:30,429 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:30,429 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:30,429 INFO  L85        PathProgramCache]: Analyzing trace with hash 156945715, now seen corresponding path program 1 times
[2024-10-10 22:33:30,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:30,429 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281904348]
[2024-10-10 22:33:30,429 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:30,429 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:30,467 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:30,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-10 22:33:30,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:30,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281904348]
[2024-10-10 22:33:30,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281904348] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:30,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-10 22:33:30,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-10 22:33:30,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517734246]
[2024-10-10 22:33:30,562 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:30,562 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-10 22:33:30,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:30,563 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-10 22:33:30,563 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-10 22:33:30,563 INFO  L87              Difference]: Start difference. First operand 265 states and 379 transitions. Second operand  has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-10 22:33:30,929 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:30,929 INFO  L93              Difference]: Finished difference Result 791 states and 1134 transitions.
[2024-10-10 22:33:30,930 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-10 22:33:30,930 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114
[2024-10-10 22:33:30,930 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:30,932 INFO  L225             Difference]: With dead ends: 791
[2024-10-10 22:33:30,933 INFO  L226             Difference]: Without dead ends: 527
[2024-10-10 22:33:30,934 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-10-10 22:33:30,935 INFO  L432           NwaCegarLoop]: 30 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:30,935 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-10 22:33:30,936 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 527 states.
[2024-10-10 22:33:30,961 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527.
[2024-10-10 22:33:30,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 527 states, 526 states have (on average 1.3460076045627376) internal successors, (708), 526 states have internal predecessors, (708), 0 states have call successors, (0), 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-10-10 22:33:30,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 708 transitions.
[2024-10-10 22:33:30,969 INFO  L78                 Accepts]: Start accepts. Automaton has 527 states and 708 transitions. Word has length 114
[2024-10-10 22:33:30,969 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:30,969 INFO  L471      AbstractCegarLoop]: Abstraction has 527 states and 708 transitions.
[2024-10-10 22:33:30,970 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-10 22:33:30,970 INFO  L276                IsEmpty]: Start isEmpty. Operand 527 states and 708 transitions.
[2024-10-10 22:33:30,974 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-10-10 22:33:30,974 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:30,976 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-10 22:33:30,976 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-10 22:33:30,976 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:30,977 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:30,977 INFO  L85        PathProgramCache]: Analyzing trace with hash -1422492173, now seen corresponding path program 1 times
[2024-10-10 22:33:30,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:30,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842068706]
[2024-10-10 22:33:30,977 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:30,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:31,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:31,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-10 22:33:31,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:31,341 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842068706]
[2024-10-10 22:33:31,341 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842068706] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:31,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-10 22:33:31,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-10 22:33:31,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555659222]
[2024-10-10 22:33:31,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:31,344 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-10 22:33:31,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:31,345 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-10 22:33:31,345 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-10 22:33:31,345 INFO  L87              Difference]: Start difference. First operand 527 states and 708 transitions. Second operand  has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-10-10 22:33:31,888 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:31,888 INFO  L93              Difference]: Finished difference Result 1410 states and 1881 transitions.
[2024-10-10 22:33:31,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-10 22:33:31,889 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115
[2024-10-10 22:33:31,889 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:31,891 INFO  L225             Difference]: With dead ends: 1410
[2024-10-10 22:33:31,892 INFO  L226             Difference]: Without dead ends: 789
[2024-10-10 22:33:31,893 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-10 22:33:31,894 INFO  L432           NwaCegarLoop]: 68 mSDtfsCounter, 130 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:31,895 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 77 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-10-10 22:33:31,896 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 789 states.
[2024-10-10 22:33:31,907 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789.
[2024-10-10 22:33:31,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 789 states, 788 states have (on average 1.1637055837563453) internal successors, (917), 788 states have internal predecessors, (917), 0 states have call successors, (0), 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-10-10 22:33:31,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 917 transitions.
[2024-10-10 22:33:31,910 INFO  L78                 Accepts]: Start accepts. Automaton has 789 states and 917 transitions. Word has length 115
[2024-10-10 22:33:31,910 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:31,910 INFO  L471      AbstractCegarLoop]: Abstraction has 789 states and 917 transitions.
[2024-10-10 22:33:31,911 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-10-10 22:33:31,911 INFO  L276                IsEmpty]: Start isEmpty. Operand 789 states and 917 transitions.
[2024-10-10 22:33:31,916 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2024-10-10 22:33:31,917 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:31,917 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:33:31,917 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-10 22:33:31,917 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:31,917 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:31,918 INFO  L85        PathProgramCache]: Analyzing trace with hash 1976948352, now seen corresponding path program 1 times
[2024-10-10 22:33:31,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:31,918 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753344829]
[2024-10-10 22:33:31,918 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:31,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:31,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:32,045 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-10-10 22:33:32,047 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:32,047 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753344829]
[2024-10-10 22:33:32,047 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753344829] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:32,047 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-10 22:33:32,047 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-10 22:33:32,048 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998962378]
[2024-10-10 22:33:32,048 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:32,048 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-10 22:33:32,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:32,050 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-10 22:33:32,050 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-10 22:33:32,050 INFO  L87              Difference]: Start difference. First operand 789 states and 917 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-10 22:33:32,327 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:32,327 INFO  L93              Difference]: Finished difference Result 1577 states and 1858 transitions.
[2024-10-10 22:33:32,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-10 22:33:32,328 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120
[2024-10-10 22:33:32,328 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:32,330 INFO  L225             Difference]: With dead ends: 1577
[2024-10-10 22:33:32,330 INFO  L226             Difference]: Without dead ends: 920
[2024-10-10 22:33:32,332 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-10-10 22:33:32,332 INFO  L432           NwaCegarLoop]: 39 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:32,333 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 43 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-10 22:33:32,334 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 920 states.
[2024-10-10 22:33:32,343 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920.
[2024-10-10 22:33:32,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 920 states, 919 states have (on average 1.1534276387377584) internal successors, (1060), 919 states have internal predecessors, (1060), 0 states have call successors, (0), 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-10-10 22:33:32,346 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1060 transitions.
[2024-10-10 22:33:32,346 INFO  L78                 Accepts]: Start accepts. Automaton has 920 states and 1060 transitions. Word has length 120
[2024-10-10 22:33:32,347 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:32,347 INFO  L471      AbstractCegarLoop]: Abstraction has 920 states and 1060 transitions.
[2024-10-10 22:33:32,347 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-10 22:33:32,347 INFO  L276                IsEmpty]: Start isEmpty. Operand 920 states and 1060 transitions.
[2024-10-10 22:33:32,349 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2024-10-10 22:33:32,349 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:32,349 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-10 22:33:32,349 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-10 22:33:32,349 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:32,350 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:32,350 INFO  L85        PathProgramCache]: Analyzing trace with hash 1817204514, now seen corresponding path program 1 times
[2024-10-10 22:33:32,350 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:32,350 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295837620]
[2024-10-10 22:33:32,350 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:32,350 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:32,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:32,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-10-10 22:33:32,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:32,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295837620]
[2024-10-10 22:33:32,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295837620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:32,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-10 22:33:32,432 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-10 22:33:32,432 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259685388]
[2024-10-10 22:33:32,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:32,433 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-10 22:33:32,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:32,434 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-10 22:33:32,434 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-10 22:33:32,434 INFO  L87              Difference]: Start difference. First operand 920 states and 1060 transitions. Second operand  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-10 22:33:32,750 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:32,751 INFO  L93              Difference]: Finished difference Result 2363 states and 2731 transitions.
[2024-10-10 22:33:32,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-10 22:33:32,751 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129
[2024-10-10 22:33:32,752 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:32,756 INFO  L225             Difference]: With dead ends: 2363
[2024-10-10 22:33:32,756 INFO  L226             Difference]: Without dead ends: 1575
[2024-10-10 22:33:32,757 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-10-10 22:33:32,758 INFO  L432           NwaCegarLoop]: 13 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:32,758 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 17 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-10 22:33:32,760 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1575 states.
[2024-10-10 22:33:32,775 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1182.
[2024-10-10 22:33:32,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1182 states, 1181 states have (on average 1.1507197290431836) internal successors, (1359), 1181 states have internal predecessors, (1359), 0 states have call successors, (0), 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-10-10 22:33:32,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1359 transitions.
[2024-10-10 22:33:32,783 INFO  L78                 Accepts]: Start accepts. Automaton has 1182 states and 1359 transitions. Word has length 129
[2024-10-10 22:33:32,784 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:32,785 INFO  L471      AbstractCegarLoop]: Abstraction has 1182 states and 1359 transitions.
[2024-10-10 22:33:32,785 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-10 22:33:32,785 INFO  L276                IsEmpty]: Start isEmpty. Operand 1182 states and 1359 transitions.
[2024-10-10 22:33:32,787 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2024-10-10 22:33:32,787 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:32,787 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-10 22:33:32,787 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-10 22:33:32,788 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:32,788 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:32,788 INFO  L85        PathProgramCache]: Analyzing trace with hash -908997231, now seen corresponding path program 1 times
[2024-10-10 22:33:32,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:32,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696239587]
[2024-10-10 22:33:32,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:32,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:32,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:32,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-10-10 22:33:32,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:32,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696239587]
[2024-10-10 22:33:32,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696239587] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:32,904 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-10 22:33:32,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-10 22:33:32,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150199977]
[2024-10-10 22:33:32,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:32,905 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-10 22:33:32,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:32,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-10 22:33:32,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-10 22:33:32,906 INFO  L87              Difference]: Start difference. First operand 1182 states and 1359 transitions. Second operand  has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-10-10 22:33:33,414 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:33,415 INFO  L93              Difference]: Finished difference Result 2494 states and 2924 transitions.
[2024-10-10 22:33:33,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-10 22:33:33,415 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 135
[2024-10-10 22:33:33,415 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:33,419 INFO  L225             Difference]: With dead ends: 2494
[2024-10-10 22:33:33,419 INFO  L226             Difference]: Without dead ends: 1444
[2024-10-10 22:33:33,421 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-10 22:33:33,422 INFO  L432           NwaCegarLoop]: 24 mSDtfsCounter, 261 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:33,422 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 32 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-10-10 22:33:33,424 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1444 states.
[2024-10-10 22:33:33,440 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444.
[2024-10-10 22:33:33,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1444 states, 1443 states have (on average 1.1448371448371448) internal successors, (1652), 1443 states have internal predecessors, (1652), 0 states have call successors, (0), 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-10-10 22:33:33,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1652 transitions.
[2024-10-10 22:33:33,445 INFO  L78                 Accepts]: Start accepts. Automaton has 1444 states and 1652 transitions. Word has length 135
[2024-10-10 22:33:33,445 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:33,445 INFO  L471      AbstractCegarLoop]: Abstraction has 1444 states and 1652 transitions.
[2024-10-10 22:33:33,446 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-10-10 22:33:33,446 INFO  L276                IsEmpty]: Start isEmpty. Operand 1444 states and 1652 transitions.
[2024-10-10 22:33:33,448 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2024-10-10 22:33:33,448 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:33,448 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:33:33,448 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-10-10 22:33:33,448 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:33,449 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:33,449 INFO  L85        PathProgramCache]: Analyzing trace with hash -1345138540, now seen corresponding path program 1 times
[2024-10-10 22:33:33,449 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:33,449 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027125943]
[2024-10-10 22:33:33,449 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:33,449 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:33,471 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:33,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-10-10 22:33:33,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:33,587 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027125943]
[2024-10-10 22:33:33,587 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027125943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:33,587 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-10 22:33:33,587 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-10 22:33:33,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728416088]
[2024-10-10 22:33:33,588 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:33,588 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-10 22:33:33,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:33,588 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-10 22:33:33,589 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-10 22:33:33,589 INFO  L87              Difference]: Start difference. First operand 1444 states and 1652 transitions. Second operand  has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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-10-10 22:33:34,070 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:34,070 INFO  L93              Difference]: Finished difference Result 3542 states and 4042 transitions.
[2024-10-10 22:33:34,070 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-10 22:33:34,071 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 149
[2024-10-10 22:33:34,071 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:34,077 INFO  L225             Difference]: With dead ends: 3542
[2024-10-10 22:33:34,077 INFO  L226             Difference]: Without dead ends: 2230
[2024-10-10 22:33:34,079 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-10 22:33:34,080 INFO  L432           NwaCegarLoop]: 27 mSDtfsCounter, 255 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:34,080 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 35 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-10 22:33:34,082 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2230 states.
[2024-10-10 22:33:34,105 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2230.
[2024-10-10 22:33:34,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2230 states, 2229 states have (on average 1.1094661283086587) internal successors, (2473), 2229 states have internal predecessors, (2473), 0 states have call successors, (0), 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-10-10 22:33:34,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2473 transitions.
[2024-10-10 22:33:34,112 INFO  L78                 Accepts]: Start accepts. Automaton has 2230 states and 2473 transitions. Word has length 149
[2024-10-10 22:33:34,112 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:34,112 INFO  L471      AbstractCegarLoop]: Abstraction has 2230 states and 2473 transitions.
[2024-10-10 22:33:34,112 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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-10-10 22:33:34,113 INFO  L276                IsEmpty]: Start isEmpty. Operand 2230 states and 2473 transitions.
[2024-10-10 22:33:34,115 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2024-10-10 22:33:34,115 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:34,115 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:33:34,116 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-10-10 22:33:34,116 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:34,116 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:34,116 INFO  L85        PathProgramCache]: Analyzing trace with hash 16467761, now seen corresponding path program 1 times
[2024-10-10 22:33:34,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:34,116 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343882726]
[2024-10-10 22:33:34,116 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:34,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:34,140 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:34,308 INFO  L134       CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-10-10 22:33:34,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:34,309 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343882726]
[2024-10-10 22:33:34,309 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343882726] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:34,309 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-10 22:33:34,309 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-10 22:33:34,309 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792515916]
[2024-10-10 22:33:34,310 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:34,310 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-10 22:33:34,310 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:34,311 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-10 22:33:34,311 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-10 22:33:34,311 INFO  L87              Difference]: Start difference. First operand 2230 states and 2473 transitions. Second operand  has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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-10-10 22:33:34,775 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:34,775 INFO  L93              Difference]: Finished difference Result 4459 states and 4950 transitions.
[2024-10-10 22:33:34,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-10 22:33:34,776 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 166
[2024-10-10 22:33:34,776 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:34,781 INFO  L225             Difference]: With dead ends: 4459
[2024-10-10 22:33:34,781 INFO  L226             Difference]: Without dead ends: 2361
[2024-10-10 22:33:34,783 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-10 22:33:34,784 INFO  L432           NwaCegarLoop]: 23 mSDtfsCounter, 233 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:34,784 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 31 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-10 22:33:34,786 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2361 states.
[2024-10-10 22:33:34,806 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2230.
[2024-10-10 22:33:34,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2230 states, 2229 states have (on average 1.1040825482279049) internal successors, (2461), 2229 states have internal predecessors, (2461), 0 states have call successors, (0), 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-10-10 22:33:34,812 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2461 transitions.
[2024-10-10 22:33:34,812 INFO  L78                 Accepts]: Start accepts. Automaton has 2230 states and 2461 transitions. Word has length 166
[2024-10-10 22:33:34,813 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:34,813 INFO  L471      AbstractCegarLoop]: Abstraction has 2230 states and 2461 transitions.
[2024-10-10 22:33:34,813 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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-10-10 22:33:34,813 INFO  L276                IsEmpty]: Start isEmpty. Operand 2230 states and 2461 transitions.
[2024-10-10 22:33:34,816 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 192
[2024-10-10 22:33:34,816 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:34,816 INFO  L215           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:33:34,816 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-10-10 22:33:34,817 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:34,817 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:34,817 INFO  L85        PathProgramCache]: Analyzing trace with hash -437867790, now seen corresponding path program 1 times
[2024-10-10 22:33:34,817 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:34,817 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509118542]
[2024-10-10 22:33:34,817 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:34,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:34,842 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:34,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked.
[2024-10-10 22:33:34,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:34,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509118542]
[2024-10-10 22:33:34,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509118542] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:34,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-10 22:33:34,985 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-10 22:33:34,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896004640]
[2024-10-10 22:33:34,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:34,985 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-10 22:33:34,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:34,986 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-10 22:33:34,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-10 22:33:34,986 INFO  L87              Difference]: Start difference. First operand 2230 states and 2461 transitions. Second operand  has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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-10-10 22:33:35,459 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:35,460 INFO  L93              Difference]: Finished difference Result 4590 states and 5115 transitions.
[2024-10-10 22:33:35,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-10 22:33:35,460 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 191
[2024-10-10 22:33:35,460 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:35,466 INFO  L225             Difference]: With dead ends: 4590
[2024-10-10 22:33:35,466 INFO  L226             Difference]: Without dead ends: 2492
[2024-10-10 22:33:35,469 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-10 22:33:35,470 INFO  L432           NwaCegarLoop]: 31 mSDtfsCounter, 252 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:35,470 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 44 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-10 22:33:35,472 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2492 states.
[2024-10-10 22:33:35,494 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2361.
[2024-10-10 22:33:35,497 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2361 states, 2360 states have (on average 1.1088983050847459) internal successors, (2617), 2360 states have internal predecessors, (2617), 0 states have call successors, (0), 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-10-10 22:33:35,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 2617 transitions.
[2024-10-10 22:33:35,501 INFO  L78                 Accepts]: Start accepts. Automaton has 2361 states and 2617 transitions. Word has length 191
[2024-10-10 22:33:35,501 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:35,501 INFO  L471      AbstractCegarLoop]: Abstraction has 2361 states and 2617 transitions.
[2024-10-10 22:33:35,502 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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-10-10 22:33:35,502 INFO  L276                IsEmpty]: Start isEmpty. Operand 2361 states and 2617 transitions.
[2024-10-10 22:33:35,504 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2024-10-10 22:33:35,505 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:35,505 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 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]
[2024-10-10 22:33:35,505 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-10-10 22:33:35,505 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:35,505 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:35,506 INFO  L85        PathProgramCache]: Analyzing trace with hash -1886784175, now seen corresponding path program 1 times
[2024-10-10 22:33:35,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:35,506 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267627002]
[2024-10-10 22:33:35,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:35,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:35,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:35,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2024-10-10 22:33:35,640 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:35,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267627002]
[2024-10-10 22:33:35,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267627002] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:35,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-10 22:33:35,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-10 22:33:35,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630172093]
[2024-10-10 22:33:35,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:35,641 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-10 22:33:35,641 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:35,642 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-10 22:33:35,642 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-10 22:33:35,642 INFO  L87              Difference]: Start difference. First operand 2361 states and 2617 transitions. Second operand  has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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-10-10 22:33:35,996 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:35,996 INFO  L93              Difference]: Finished difference Result 5114 states and 5670 transitions.
[2024-10-10 22:33:35,996 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-10 22:33:35,996 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 209
[2024-10-10 22:33:35,997 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:36,004 INFO  L225             Difference]: With dead ends: 5114
[2024-10-10 22:33:36,004 INFO  L226             Difference]: Without dead ends: 2754
[2024-10-10 22:33:36,007 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-10-10 22:33:36,007 INFO  L432           NwaCegarLoop]: 172 mSDtfsCounter, 86 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:36,007 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 177 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-10 22:33:36,010 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2754 states.
[2024-10-10 22:33:36,037 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2623.
[2024-10-10 22:33:36,040 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2623 states, 2622 states have (on average 1.1033562166285278) internal successors, (2893), 2622 states have internal predecessors, (2893), 0 states have call successors, (0), 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-10-10 22:33:36,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 2893 transitions.
[2024-10-10 22:33:36,045 INFO  L78                 Accepts]: Start accepts. Automaton has 2623 states and 2893 transitions. Word has length 209
[2024-10-10 22:33:36,045 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:36,045 INFO  L471      AbstractCegarLoop]: Abstraction has 2623 states and 2893 transitions.
[2024-10-10 22:33:36,045 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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-10-10 22:33:36,045 INFO  L276                IsEmpty]: Start isEmpty. Operand 2623 states and 2893 transitions.
[2024-10-10 22:33:36,049 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2024-10-10 22:33:36,049 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:36,049 INFO  L215           NwaCegarLoop]: trace histogram [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, 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-10-10 22:33:36,049 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-10-10 22:33:36,050 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:36,050 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:36,050 INFO  L85        PathProgramCache]: Analyzing trace with hash -2010342556, now seen corresponding path program 1 times
[2024-10-10 22:33:36,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:36,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603483208]
[2024-10-10 22:33:36,050 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:36,050 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:36,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:36,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 155 backedges. 57 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-10 22:33:36,487 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:36,487 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603483208]
[2024-10-10 22:33:36,487 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603483208] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-10 22:33:36,487 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227053483]
[2024-10-10 22:33:36,487 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:36,487 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-10 22:33:36,488 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3
[2024-10-10 22:33:36,489 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-10 22:33:36,492 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-10-10 22:33:36,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:36,598 INFO  L255         TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-10 22:33:36,610 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-10 22:33:36,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked.
[2024-10-10 22:33:36,843 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-10 22:33:36,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227053483] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:36,844 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-10 22:33:36,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6
[2024-10-10 22:33:36,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273197679]
[2024-10-10 22:33:36,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:36,844 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-10 22:33:36,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:36,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-10 22:33:36,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-10-10 22:33:36,846 INFO  L87              Difference]: Start difference. First operand 2623 states and 2893 transitions. Second operand  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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-10-10 22:33:37,136 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:37,136 INFO  L93              Difference]: Finished difference Result 4066 states and 4446 transitions.
[2024-10-10 22:33:37,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-10 22:33:37,137 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 212
[2024-10-10 22:33:37,137 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:37,146 INFO  L225             Difference]: With dead ends: 4066
[2024-10-10 22:33:37,146 INFO  L226             Difference]: Without dead ends: 3933
[2024-10-10 22:33:37,147 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-10-10 22:33:37,148 INFO  L432           NwaCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:37,148 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 29 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-10 22:33:37,151 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3933 states.
[2024-10-10 22:33:37,186 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3540.
[2024-10-10 22:33:37,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3540 states, 3539 states have (on average 1.0938118112461148) internal successors, (3871), 3539 states have internal predecessors, (3871), 0 states have call successors, (0), 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-10-10 22:33:37,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 3871 transitions.
[2024-10-10 22:33:37,195 INFO  L78                 Accepts]: Start accepts. Automaton has 3540 states and 3871 transitions. Word has length 212
[2024-10-10 22:33:37,196 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:37,196 INFO  L471      AbstractCegarLoop]: Abstraction has 3540 states and 3871 transitions.
[2024-10-10 22:33:37,196 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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-10-10 22:33:37,196 INFO  L276                IsEmpty]: Start isEmpty. Operand 3540 states and 3871 transitions.
[2024-10-10 22:33:37,202 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 245
[2024-10-10 22:33:37,202 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:37,202 INFO  L215           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-10 22:33:37,217 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-10-10 22:33:37,402 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-10-10 22:33:37,403 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:37,404 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:37,404 INFO  L85        PathProgramCache]: Analyzing trace with hash 1966114505, now seen corresponding path program 1 times
[2024-10-10 22:33:37,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:37,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631782439]
[2024-10-10 22:33:37,404 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:37,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:37,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:37,851 INFO  L134       CoverageAnalysis]: Checked inductivity of 280 backedges. 194 proven. 38 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2024-10-10 22:33:37,851 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:37,851 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631782439]
[2024-10-10 22:33:37,852 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631782439] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-10 22:33:37,852 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963891898]
[2024-10-10 22:33:37,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:37,852 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-10 22:33:37,852 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3
[2024-10-10 22:33:37,853 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-10 22:33:37,861 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-10-10 22:33:37,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:37,985 INFO  L255         TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-10 22:33:37,988 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-10 22:33:38,102 INFO  L134       CoverageAnalysis]: Checked inductivity of 280 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked.
[2024-10-10 22:33:38,103 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-10 22:33:38,103 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963891898] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:38,103 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-10 22:33:38,103 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2024-10-10 22:33:38,104 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319826324]
[2024-10-10 22:33:38,104 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:38,104 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-10 22:33:38,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:38,105 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-10 22:33:38,105 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-10-10 22:33:38,105 INFO  L87              Difference]: Start difference. First operand 3540 states and 3871 transitions. Second operand  has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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-10-10 22:33:38,421 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:38,421 INFO  L93              Difference]: Finished difference Result 7079 states and 7741 transitions.
[2024-10-10 22:33:38,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-10 22:33:38,422 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 244
[2024-10-10 22:33:38,422 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:38,431 INFO  L225             Difference]: With dead ends: 7079
[2024-10-10 22:33:38,432 INFO  L226             Difference]: Without dead ends: 3540
[2024-10-10 22:33:38,436 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-10-10 22:33:38,436 INFO  L432           NwaCegarLoop]: 161 mSDtfsCounter, 96 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:38,437 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 166 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-10 22:33:38,440 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3540 states.
[2024-10-10 22:33:38,466 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3540 to 2099.
[2024-10-10 22:33:38,468 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2099 states, 2098 states have (on average 1.0919923736892279) internal successors, (2291), 2098 states have internal predecessors, (2291), 0 states have call successors, (0), 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-10-10 22:33:38,471 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2291 transitions.
[2024-10-10 22:33:38,472 INFO  L78                 Accepts]: Start accepts. Automaton has 2099 states and 2291 transitions. Word has length 244
[2024-10-10 22:33:38,472 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:38,472 INFO  L471      AbstractCegarLoop]: Abstraction has 2099 states and 2291 transitions.
[2024-10-10 22:33:38,473 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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-10-10 22:33:38,473 INFO  L276                IsEmpty]: Start isEmpty. Operand 2099 states and 2291 transitions.
[2024-10-10 22:33:38,476 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2024-10-10 22:33:38,476 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:38,477 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-10 22:33:38,490 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-10-10 22:33:38,677 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-10 22:33:38,678 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:38,678 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:38,678 INFO  L85        PathProgramCache]: Analyzing trace with hash -2126853217, now seen corresponding path program 1 times
[2024-10-10 22:33:38,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:38,678 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285309842]
[2024-10-10 22:33:38,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:38,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:38,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:39,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2024-10-10 22:33:39,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:39,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285309842]
[2024-10-10 22:33:39,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285309842] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-10 22:33:39,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116430604]
[2024-10-10 22:33:39,116 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:39,116 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-10 22:33:39,117 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3
[2024-10-10 22:33:39,141 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-10 22:33:39,143 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-10-10 22:33:39,246 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:39,248 INFO  L255         TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-10 22:33:39,250 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-10 22:33:39,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked.
[2024-10-10 22:33:39,358 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-10 22:33:39,358 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [116430604] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:39,358 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-10 22:33:39,358 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2024-10-10 22:33:39,360 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379523947]
[2024-10-10 22:33:39,360 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:39,360 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-10 22:33:39,360 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:39,361 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-10 22:33:39,361 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-10-10 22:33:39,361 INFO  L87              Difference]: Start difference. First operand 2099 states and 2291 transitions. Second operand  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-10-10 22:33:39,629 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:39,629 INFO  L93              Difference]: Finished difference Result 4197 states and 4581 transitions.
[2024-10-10 22:33:39,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-10 22:33:39,630 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 253
[2024-10-10 22:33:39,630 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:39,635 INFO  L225             Difference]: With dead ends: 4197
[2024-10-10 22:33:39,635 INFO  L226             Difference]: Without dead ends: 2099
[2024-10-10 22:33:39,637 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-10-10 22:33:39,638 INFO  L432           NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:39,638 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 22 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-10 22:33:39,640 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2099 states.
[2024-10-10 22:33:39,662 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1837.
[2024-10-10 22:33:39,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1837 states, 1836 states have (on average 1.093681917211329) internal successors, (2008), 1836 states have internal predecessors, (2008), 0 states have call successors, (0), 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-10-10 22:33:39,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2008 transitions.
[2024-10-10 22:33:39,669 INFO  L78                 Accepts]: Start accepts. Automaton has 1837 states and 2008 transitions. Word has length 253
[2024-10-10 22:33:39,669 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:39,669 INFO  L471      AbstractCegarLoop]: Abstraction has 1837 states and 2008 transitions.
[2024-10-10 22:33:39,669 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-10-10 22:33:39,670 INFO  L276                IsEmpty]: Start isEmpty. Operand 1837 states and 2008 transitions.
[2024-10-10 22:33:39,672 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 260
[2024-10-10 22:33:39,672 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-10 22:33:39,673 INFO  L215           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-10 22:33:39,688 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-10-10 22:33:39,873 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-10 22:33:39,873 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-10 22:33:39,873 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-10 22:33:39,873 INFO  L85        PathProgramCache]: Analyzing trace with hash -1537508359, now seen corresponding path program 1 times
[2024-10-10 22:33:39,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-10 22:33:39,874 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319939039]
[2024-10-10 22:33:39,874 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-10 22:33:39,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-10 22:33:39,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-10 22:33:40,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked.
[2024-10-10 22:33:40,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-10 22:33:40,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319939039]
[2024-10-10 22:33:40,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319939039] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-10 22:33:40,030 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-10 22:33:40,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-10 22:33:40,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000237280]
[2024-10-10 22:33:40,030 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-10 22:33:40,031 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-10 22:33:40,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-10 22:33:40,031 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-10 22:33:40,031 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-10 22:33:40,032 INFO  L87              Difference]: Start difference. First operand 1837 states and 2008 transitions. Second operand  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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-10-10 22:33:40,293 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-10 22:33:40,293 INFO  L93              Difference]: Finished difference Result 4064 states and 4423 transitions.
[2024-10-10 22:33:40,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-10 22:33:40,293 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 259
[2024-10-10 22:33:40,294 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-10 22:33:40,294 INFO  L225             Difference]: With dead ends: 4064
[2024-10-10 22:33:40,294 INFO  L226             Difference]: Without dead ends: 0
[2024-10-10 22:33:40,297 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-10-10 22:33:40,298 INFO  L432           NwaCegarLoop]: 162 mSDtfsCounter, 31 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-10 22:33:40,298 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 166 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-10 22:33:40,298 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-10-10 22:33:40,299 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-10-10 22:33:40,299 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-10-10 22:33:40,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-10-10 22:33:40,299 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 259
[2024-10-10 22:33:40,299 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-10 22:33:40,299 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-10-10 22:33:40,299 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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-10-10 22:33:40,299 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-10-10 22:33:40,299 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-10-10 22:33:40,302 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-10-10 22:33:40,302 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-10-10 22:33:40,304 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-10 22:33:40,306 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-10-10 22:33:40,573 INFO  L165   ceAbstractionStarter]: Computing trace abstraction results
[2024-10-10 22:33:40,592 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:33:40 BoogieIcfgContainer
[2024-10-10 22:33:40,592 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-10 22:33:40,592 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-10 22:33:40,593 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-10-10 22:33:40,593 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-10-10 22:33:40,593 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:33:29" (3/4) ...
[2024-10-10 22:33:40,595 INFO  L139         WitnessPrinter]: Generating witness for correct program
[2024-10-10 22:33:40,613 INFO  L904   BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2024-10-10 22:33:40,614 INFO  L904   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-10-10 22:33:40,614 INFO  L904   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-10-10 22:33:40,615 INFO  L904   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-10-10 22:33:40,731 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-10-10 22:33:40,732 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-10-10 22:33:40,732 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-10 22:33:40,732 INFO  L158              Benchmark]: Toolchain (without parser) took 13242.87ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 88.1MB in the beginning and 200.4MB in the end (delta: -112.3MB). Peak memory consumption was 174.0MB. Max. memory is 16.1GB.
[2024-10-10 22:33:40,732 INFO  L158              Benchmark]: CDTParser took 0.52ms. Allocated memory is still 142.6MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-10 22:33:40,732 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 446.51ms. Allocated memory was 142.6MB in the beginning and 213.9MB in the end (delta: 71.3MB). Free memory was 88.1MB in the beginning and 175.1MB in the end (delta: -87.0MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB.
[2024-10-10 22:33:40,733 INFO  L158              Benchmark]: Boogie Procedure Inliner took 62.53ms. Allocated memory is still 213.9MB. Free memory was 175.1MB in the beginning and 169.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-10-10 22:33:40,733 INFO  L158              Benchmark]: Boogie Preprocessor took 85.66ms. Allocated memory is still 213.9MB. Free memory was 169.8MB in the beginning and 164.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-10-10 22:33:40,733 INFO  L158              Benchmark]: RCFGBuilder took 1033.40ms. Allocated memory is still 213.9MB. Free memory was 164.6MB in the beginning and 164.7MB in the end (delta: -171.8kB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB.
[2024-10-10 22:33:40,733 INFO  L158              Benchmark]: TraceAbstraction took 11469.12ms. Allocated memory was 213.9MB in the beginning and 427.8MB in the end (delta: 213.9MB). Free memory was 163.7MB in the beginning and 213.0MB in the end (delta: -49.3MB). Peak memory consumption was 166.7MB. Max. memory is 16.1GB.
[2024-10-10 22:33:40,733 INFO  L158              Benchmark]: Witness Printer took 139.19ms. Allocated memory is still 427.8MB. Free memory was 213.0MB in the beginning and 200.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-10-10 22:33:40,734 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.52ms. Allocated memory is still 142.6MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 446.51ms. Allocated memory was 142.6MB in the beginning and 213.9MB in the end (delta: 71.3MB). Free memory was 88.1MB in the beginning and 175.1MB in the end (delta: -87.0MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 62.53ms. Allocated memory is still 213.9MB. Free memory was 175.1MB in the beginning and 169.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 85.66ms. Allocated memory is still 213.9MB. Free memory was 169.8MB in the beginning and 164.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1033.40ms. Allocated memory is still 213.9MB. Free memory was 164.6MB in the beginning and 164.7MB in the end (delta: -171.8kB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 11469.12ms. Allocated memory was 213.9MB in the beginning and 427.8MB in the end (delta: 213.9MB). Free memory was 163.7MB in the beginning and 213.0MB in the end (delta: -49.3MB). Peak memory consumption was 166.7MB. Max. memory is 16.1GB.
 * Witness Printer took 139.19ms. Allocated memory is still 427.8MB. Free memory was 213.0MB in the beginning and 200.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 513]: 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1875 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1875 mSDsluCounter, 1102 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 745 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5496 IncrementalHoareTripleChecker+Invalid, 6241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 745 mSolverCounterUnsat, 1015 mSDtfsCounter, 5496 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 752 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3540occurred in iteration=12, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 2882 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 3221 NumberOfCodeBlocks, 3221 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3203 ConstructedInterpolants, 0 QuantifiedInterpolants, 13787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1254 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 2006/2283 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 593]: Loop Invariant
    Derived loop invariant: ((((((((((((a7 <= 0) && (a21 == 1)) && (a16 <= 4)) && (a20 == 1)) || (((5 == a16) && (a21 == 1)) && (a20 == 1))) || ((((a20 <= 0) && (a16 == 6)) && (a21 == 1)) && (15 <= a8))) || (((a21 == 1) && (a20 == 1)) && (15 <= a8))) || ((a8 <= 13) && (a20 == 1))) || (((((a7 <= 0) && (a12 == 8)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || ((((a20 <= 0) && (a8 <= 13)) && (a17 == 1)) && (a16 <= 5))) || (((a20 <= 0) && (5 == a16)) && (a21 == 1))) || (((a20 <= 0) && (a21 == 1)) && (a16 <= 4)))
RESULT: Ultimate proved your program to be correct!
[2024-10-10 22:33:40,759 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-clean/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