./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa899b25f522973b6bbc58879b0eb17248367bb8b552686dbd6511ffcd7729d0
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 11:47:30,208 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 11:47:30,266 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 11:47:30,274 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 11:47:30,275 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 11:47:30,296 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 11:47:30,298 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 11:47:30,298 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 11:47:30,298 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 11:47:30,298 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 11:47:30,298 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 11:47:30,299 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 11:47:30,299 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 11:47:30,299 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 11:47:30,299 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 11:47:30,299 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 11:47:30,301 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 11:47:30,301 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 11:47:30,301 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 11:47:30,301 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 11:47:30,301 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 11:47:30,301 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 11:47:30,301 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 11:47:30,301 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 11:47:30,301 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 11:47:30,302 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 11:47:30,302 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 11:47:30,302 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 11:47:30,303 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 11:47:30,303 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa899b25f522973b6bbc58879b0eb17248367bb8b552686dbd6511ffcd7729d0
[2025-03-08 11:47:30,530 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 11:47:30,538 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 11:47:30,540 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 11:47:30,541 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 11:47:30,541 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 11:47:30,542 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i
[2025-03-08 11:47:31,735 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd6e3158/d91a0c9f0dab433dbe905f28309d5740/FLAG5376ddac7
[2025-03-08 11:47:31,968 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 11:47:31,969 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i
[2025-03-08 11:47:31,976 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd6e3158/d91a0c9f0dab433dbe905f28309d5740/FLAG5376ddac7
[2025-03-08 11:47:31,986 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd6e3158/d91a0c9f0dab433dbe905f28309d5740
[2025-03-08 11:47:31,988 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 11:47:31,989 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 11:47:31,990 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 11:47:31,990 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 11:47:31,993 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 11:47:31,993 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:47:31" (1/1) ...
[2025-03-08 11:47:31,994 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e2e419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:31, skipping insertion in model container
[2025-03-08 11:47:31,994 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:47:31" (1/1) ...
[2025-03-08 11:47:32,006 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 11:47:32,120 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i[919,932]
[2025-03-08 11:47:32,197 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 11:47:32,211 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 11:47:32,220 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i[919,932]
[2025-03-08 11:47:32,247 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 11:47:32,259 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 11:47:32,259 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32 WrapperNode
[2025-03-08 11:47:32,261 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 11:47:32,262 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 11:47:32,262 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 11:47:32,262 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 11:47:32,266 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (1/1) ...
[2025-03-08 11:47:32,273 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (1/1) ...
[2025-03-08 11:47:32,308 INFO  L138                Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240
[2025-03-08 11:47:32,308 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 11:47:32,309 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 11:47:32,309 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 11:47:32,309 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 11:47:32,315 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (1/1) ...
[2025-03-08 11:47:32,315 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (1/1) ...
[2025-03-08 11:47:32,320 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (1/1) ...
[2025-03-08 11:47:32,341 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].
[2025-03-08 11:47:32,342 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (1/1) ...
[2025-03-08 11:47:32,342 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (1/1) ...
[2025-03-08 11:47:32,348 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (1/1) ...
[2025-03-08 11:47:32,349 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (1/1) ...
[2025-03-08 11:47:32,350 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (1/1) ...
[2025-03-08 11:47:32,351 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (1/1) ...
[2025-03-08 11:47:32,353 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 11:47:32,354 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 11:47:32,354 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 11:47:32,354 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 11:47:32,355 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (1/1) ...
[2025-03-08 11:47:32,359 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 11:47:32,368 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:47:32,382 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 11:47:32,385 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 11:47:32,402 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 11:47:32,402 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 11:47:32,402 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 11:47:32,402 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 11:47:32,402 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 11:47:32,402 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 11:47:32,462 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 11:47:32,463 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 11:47:32,804 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L188: havoc property_#t~bitwise25#1;
[2025-03-08 11:47:32,836 INFO  L?                        ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2025-03-08 11:47:32,836 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 11:47:32,854 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 11:47:32,855 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 11:47:32,855 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:47:32 BoogieIcfgContainer
[2025-03-08 11:47:32,855 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 11:47:32,857 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 11:47:32,857 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 11:47:32,860 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 11:47:32,860 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:47:31" (1/3) ...
[2025-03-08 11:47:32,861 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffe4ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:47:32, skipping insertion in model container
[2025-03-08 11:47:32,862 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:47:32" (2/3) ...
[2025-03-08 11:47:32,863 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffe4ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:47:32, skipping insertion in model container
[2025-03-08 11:47:32,863 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:47:32" (3/3) ...
[2025-03-08 11:47:32,863 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i
[2025-03-08 11:47:32,874 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 11:47:32,875 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 11:47:32,914 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 11:47:32,926 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;@7a4fda92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 11:47:32,927 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 11:47:32,931 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 103 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2025-03-08 11:47:32,942 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2025-03-08 11:47:32,944 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:47:32,945 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:47:32,945 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:47:32,948 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:47:32,949 INFO  L85        PathProgramCache]: Analyzing trace with hash -469683470, now seen corresponding path program 1 times
[2025-03-08 11:47:32,954 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:47:32,955 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436205728]
[2025-03-08 11:47:32,955 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:47:32,955 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:47:33,044 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes.
[2025-03-08 11:47:33,072 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements.
[2025-03-08 11:47:33,072 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:47:33,072 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:47:33,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked.
[2025-03-08 11:47:33,301 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:47:33,301 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436205728]
[2025-03-08 11:47:33,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436205728] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 11:47:33,302 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986231765]
[2025-03-08 11:47:33,302 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:47:33,302 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 11:47:33,302 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:47:33,306 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 11:47:33,307 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 11:47:33,393 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes.
[2025-03-08 11:47:33,464 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements.
[2025-03-08 11:47:33,464 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:47:33,464 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:47:33,467 INFO  L256         TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 11:47:33,474 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 11:47:33,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked.
[2025-03-08 11:47:33,510 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 11:47:33,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [986231765] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:47:33,510 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 11:47:33,510 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 11:47:33,512 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629680566]
[2025-03-08 11:47:33,512 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:47:33,516 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 11:47:33,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:47:33,532 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 11:47:33,532 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 11:47:33,535 INFO  L87              Difference]: Start difference. First operand  has 103 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand  has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33)
[2025-03-08 11:47:33,568 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:47:33,570 INFO  L93              Difference]: Finished difference Result 200 states and 352 transitions.
[2025-03-08 11:47:33,571 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 11:47:33,572 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 211
[2025-03-08 11:47:33,572 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:47:33,576 INFO  L225             Difference]: With dead ends: 200
[2025-03-08 11:47:33,577 INFO  L226             Difference]: Without dead ends: 100
[2025-03-08 11:47:33,580 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 11:47:33,582 INFO  L435           NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:47:33,583 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:47:33,592 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2025-03-08 11:47:33,609 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100.
[2025-03-08 11:47:33,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2025-03-08 11:47:33,614 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions.
[2025-03-08 11:47:33,615 INFO  L78                 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 211
[2025-03-08 11:47:33,616 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:47:33,616 INFO  L471      AbstractCegarLoop]: Abstraction has 100 states and 156 transitions.
[2025-03-08 11:47:33,616 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33)
[2025-03-08 11:47:33,616 INFO  L276                IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions.
[2025-03-08 11:47:33,618 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2025-03-08 11:47:33,618 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:47:33,619 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:47:33,625 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 11:47:33,819 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 11:47:33,819 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:47:33,820 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:47:33,820 INFO  L85        PathProgramCache]: Analyzing trace with hash -873494255, now seen corresponding path program 1 times
[2025-03-08 11:47:33,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:47:33,820 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824133966]
[2025-03-08 11:47:33,820 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:47:33,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:47:33,842 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes.
[2025-03-08 11:47:33,969 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements.
[2025-03-08 11:47:33,969 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:47:33,969 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:47:34,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:47:34,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:47:34,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824133966]
[2025-03-08 11:47:34,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824133966] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:47:34,904 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:47:34,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 11:47:34,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920728767]
[2025-03-08 11:47:34,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:47:34,905 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 11:47:34,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:47:34,908 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 11:47:34,908 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:47:34,908 INFO  L87              Difference]: Start difference. First operand 100 states and 156 transitions. Second operand  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:35,196 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:47:35,197 INFO  L93              Difference]: Finished difference Result 257 states and 403 transitions.
[2025-03-08 11:47:35,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 11:47:35,197 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211
[2025-03-08 11:47:35,198 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:47:35,201 INFO  L225             Difference]: With dead ends: 257
[2025-03-08 11:47:35,201 INFO  L226             Difference]: Without dead ends: 160
[2025-03-08 11:47:35,202 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 11:47:35,203 INFO  L435           NwaCegarLoop]: 207 mSDtfsCounter, 143 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 11:47:35,204 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 433 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 11:47:35,204 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2025-03-08 11:47:35,222 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 101.
[2025-03-08 11:47:35,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2025-03-08 11:47:35,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions.
[2025-03-08 11:47:35,223 INFO  L78                 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 211
[2025-03-08 11:47:35,226 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:47:35,226 INFO  L471      AbstractCegarLoop]: Abstraction has 101 states and 156 transitions.
[2025-03-08 11:47:35,226 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:35,226 INFO  L276                IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions.
[2025-03-08 11:47:35,228 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 11:47:35,228 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:47:35,228 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:47:35,228 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 11:47:35,228 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:47:35,229 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:47:35,229 INFO  L85        PathProgramCache]: Analyzing trace with hash 1320293312, now seen corresponding path program 1 times
[2025-03-08 11:47:35,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:47:35,229 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107295970]
[2025-03-08 11:47:35,229 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:47:35,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:47:35,246 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 11:47:35,295 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 11:47:35,299 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:47:35,300 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:47:35,768 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:47:35,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:47:35,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107295970]
[2025-03-08 11:47:35,768 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107295970] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:47:35,768 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:47:35,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:47:35,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751197943]
[2025-03-08 11:47:35,769 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:47:35,769 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:47:35,769 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:47:35,770 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:47:35,770 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:47:35,770 INFO  L87              Difference]: Start difference. First operand 101 states and 156 transitions. Second operand  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:35,853 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:47:35,853 INFO  L93              Difference]: Finished difference Result 258 states and 401 transitions.
[2025-03-08 11:47:35,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:47:35,854 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212
[2025-03-08 11:47:35,855 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:47:35,856 INFO  L225             Difference]: With dead ends: 258
[2025-03-08 11:47:35,856 INFO  L226             Difference]: Without dead ends: 160
[2025-03-08 11:47:35,856 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:47:35,857 INFO  L435           NwaCegarLoop]: 207 mSDtfsCounter, 140 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:47:35,857 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 299 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:47:35,860 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2025-03-08 11:47:35,873 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 101.
[2025-03-08 11:47:35,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2025-03-08 11:47:35,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions.
[2025-03-08 11:47:35,876 INFO  L78                 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 212
[2025-03-08 11:47:35,877 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:47:35,878 INFO  L471      AbstractCegarLoop]: Abstraction has 101 states and 155 transitions.
[2025-03-08 11:47:35,878 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:35,878 INFO  L276                IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions.
[2025-03-08 11:47:35,880 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 11:47:35,882 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:47:35,882 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:47:35,882 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 11:47:35,882 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:47:35,883 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:47:35,883 INFO  L85        PathProgramCache]: Analyzing trace with hash 175162724, now seen corresponding path program 1 times
[2025-03-08 11:47:35,883 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:47:35,883 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002648631]
[2025-03-08 11:47:35,883 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:47:35,883 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:47:35,895 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 11:47:35,924 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 11:47:35,924 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:47:35,924 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:47:36,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:47:36,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:47:36,602 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002648631]
[2025-03-08 11:47:36,602 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002648631] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:47:36,602 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:47:36,603 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 11:47:36,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187800572]
[2025-03-08 11:47:36,603 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:47:36,603 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 11:47:36,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:47:36,603 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 11:47:36,604 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:47:36,604 INFO  L87              Difference]: Start difference. First operand 101 states and 155 transitions. Second operand  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:36,896 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:47:36,896 INFO  L93              Difference]: Finished difference Result 348 states and 537 transitions.
[2025-03-08 11:47:36,896 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 11:47:36,897 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212
[2025-03-08 11:47:36,897 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:47:36,899 INFO  L225             Difference]: With dead ends: 348
[2025-03-08 11:47:36,901 INFO  L226             Difference]: Without dead ends: 250
[2025-03-08 11:47:36,902 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:47:36,902 INFO  L435           NwaCegarLoop]: 309 mSDtfsCounter, 276 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 11:47:36,903 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 538 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 11:47:36,904 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 250 states.
[2025-03-08 11:47:36,920 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 108.
[2025-03-08 11:47:36,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 108 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2025-03-08 11:47:36,922 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 166 transitions.
[2025-03-08 11:47:36,924 INFO  L78                 Accepts]: Start accepts. Automaton has 108 states and 166 transitions. Word has length 212
[2025-03-08 11:47:36,924 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:47:36,924 INFO  L471      AbstractCegarLoop]: Abstraction has 108 states and 166 transitions.
[2025-03-08 11:47:36,924 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:36,924 INFO  L276                IsEmpty]: Start isEmpty. Operand 108 states and 166 transitions.
[2025-03-08 11:47:36,927 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 11:47:36,927 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:47:36,927 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:47:36,927 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 11:47:36,928 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:47:36,928 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:47:36,928 INFO  L85        PathProgramCache]: Analyzing trace with hash -233661501, now seen corresponding path program 1 times
[2025-03-08 11:47:36,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:47:36,928 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173888652]
[2025-03-08 11:47:36,928 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:47:36,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:47:36,949 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 11:47:36,975 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 11:47:36,975 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:47:36,975 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:47:37,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:47:37,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:47:37,832 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173888652]
[2025-03-08 11:47:37,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173888652] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:47:37,832 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:47:37,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 11:47:37,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400005398]
[2025-03-08 11:47:37,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:47:37,833 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 11:47:37,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:47:37,833 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 11:47:37,833 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-08 11:47:37,833 INFO  L87              Difference]: Start difference. First operand 108 states and 166 transitions. Second operand  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:38,634 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:47:38,635 INFO  L93              Difference]: Finished difference Result 449 states and 688 transitions.
[2025-03-08 11:47:38,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 11:47:38,635 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212
[2025-03-08 11:47:38,636 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:47:38,639 INFO  L225             Difference]: With dead ends: 449
[2025-03-08 11:47:38,639 INFO  L226             Difference]: Without dead ends: 344
[2025-03-08 11:47:38,639 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-08 11:47:38,640 INFO  L435           NwaCegarLoop]: 131 mSDtfsCounter, 573 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 11:47:38,640 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 247 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 11:47:38,641 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 344 states.
[2025-03-08 11:47:38,689 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 171.
[2025-03-08 11:47:38,690 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 171 states, 115 states have (on average 1.373913043478261) internal successors, (158), 116 states have internal predecessors, (158), 53 states have call successors, (53), 2 states have call predecessors, (53), 2 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53)
[2025-03-08 11:47:38,691 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 264 transitions.
[2025-03-08 11:47:38,691 INFO  L78                 Accepts]: Start accepts. Automaton has 171 states and 264 transitions. Word has length 212
[2025-03-08 11:47:38,692 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:47:38,692 INFO  L471      AbstractCegarLoop]: Abstraction has 171 states and 264 transitions.
[2025-03-08 11:47:38,692 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:38,692 INFO  L276                IsEmpty]: Start isEmpty. Operand 171 states and 264 transitions.
[2025-03-08 11:47:38,695 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 11:47:38,695 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:47:38,695 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:47:38,695 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 11:47:38,697 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:47:38,697 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:47:38,698 INFO  L85        PathProgramCache]: Analyzing trace with hash 1273890308, now seen corresponding path program 1 times
[2025-03-08 11:47:38,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:47:38,698 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688451562]
[2025-03-08 11:47:38,698 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:47:38,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:47:38,724 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 11:47:38,759 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 11:47:38,759 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:47:38,759 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:47:38,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:47:38,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:47:38,942 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688451562]
[2025-03-08 11:47:38,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688451562] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:47:38,942 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:47:38,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 11:47:38,942 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119840034]
[2025-03-08 11:47:38,942 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:47:38,943 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 11:47:38,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:47:38,943 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 11:47:38,943 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-08 11:47:38,943 INFO  L87              Difference]: Start difference. First operand 171 states and 264 transitions. Second operand  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:39,263 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:47:39,263 INFO  L93              Difference]: Finished difference Result 441 states and 686 transitions.
[2025-03-08 11:47:39,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 11:47:39,264 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212
[2025-03-08 11:47:39,264 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:47:39,267 INFO  L225             Difference]: With dead ends: 441
[2025-03-08 11:47:39,267 INFO  L226             Difference]: Without dead ends: 273
[2025-03-08 11:47:39,268 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2025-03-08 11:47:39,268 INFO  L435           NwaCegarLoop]: 160 mSDtfsCounter, 233 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 11:47:39,268 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 370 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 11:47:39,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 273 states.
[2025-03-08 11:47:39,323 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 254.
[2025-03-08 11:47:39,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 254 states, 164 states have (on average 1.353658536585366) internal successors, (222), 165 states have internal predecessors, (222), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86)
[2025-03-08 11:47:39,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 394 transitions.
[2025-03-08 11:47:39,326 INFO  L78                 Accepts]: Start accepts. Automaton has 254 states and 394 transitions. Word has length 212
[2025-03-08 11:47:39,327 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:47:39,327 INFO  L471      AbstractCegarLoop]: Abstraction has 254 states and 394 transitions.
[2025-03-08 11:47:39,327 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:39,327 INFO  L276                IsEmpty]: Start isEmpty. Operand 254 states and 394 transitions.
[2025-03-08 11:47:39,328 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 11:47:39,329 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:47:39,329 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:47:39,329 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 11:47:39,329 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:47:39,329 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:47:39,329 INFO  L85        PathProgramCache]: Analyzing trace with hash 358758435, now seen corresponding path program 1 times
[2025-03-08 11:47:39,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:47:39,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565108401]
[2025-03-08 11:47:39,330 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:47:39,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:47:39,343 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 11:47:39,359 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 11:47:39,360 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:47:39,360 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:47:39,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:47:39,798 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:47:39,799 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565108401]
[2025-03-08 11:47:39,799 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565108401] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:47:39,799 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:47:39,799 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 11:47:39,799 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537593562]
[2025-03-08 11:47:39,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:47:39,799 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 11:47:39,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:47:39,800 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 11:47:39,800 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 11:47:39,800 INFO  L87              Difference]: Start difference. First operand 254 states and 394 transitions. Second operand  has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:40,298 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:47:40,298 INFO  L93              Difference]: Finished difference Result 754 states and 1173 transitions.
[2025-03-08 11:47:40,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 11:47:40,300 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212
[2025-03-08 11:47:40,300 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:47:40,302 INFO  L225             Difference]: With dead ends: 754
[2025-03-08 11:47:40,304 INFO  L226             Difference]: Without dead ends: 503
[2025-03-08 11:47:40,305 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-08 11:47:40,305 INFO  L435           NwaCegarLoop]: 235 mSDtfsCounter, 155 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 11:47:40,306 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 523 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 11:47:40,307 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 503 states.
[2025-03-08 11:47:40,393 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 438.
[2025-03-08 11:47:40,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 438 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 281 states have internal predecessors, (376), 152 states have call successors, (152), 5 states have call predecessors, (152), 5 states have return successors, (152), 151 states have call predecessors, (152), 152 states have call successors, (152)
[2025-03-08 11:47:40,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 680 transitions.
[2025-03-08 11:47:40,397 INFO  L78                 Accepts]: Start accepts. Automaton has 438 states and 680 transitions. Word has length 212
[2025-03-08 11:47:40,398 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:47:40,398 INFO  L471      AbstractCegarLoop]: Abstraction has 438 states and 680 transitions.
[2025-03-08 11:47:40,398 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:40,398 INFO  L276                IsEmpty]: Start isEmpty. Operand 438 states and 680 transitions.
[2025-03-08 11:47:40,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-03-08 11:47:40,401 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:47:40,401 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:47:40,401 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 11:47:40,401 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:47:40,401 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:47:40,402 INFO  L85        PathProgramCache]: Analyzing trace with hash 1919507539, now seen corresponding path program 1 times
[2025-03-08 11:47:40,402 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:47:40,402 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031459586]
[2025-03-08 11:47:40,402 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:47:40,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:47:40,412 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-08 11:47:40,447 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-08 11:47:40,447 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:47:40,447 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:47:41,113 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:47:41,113 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:47:41,113 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031459586]
[2025-03-08 11:47:41,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031459586] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:47:41,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:47:41,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 11:47:41,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492297518]
[2025-03-08 11:47:41,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:47:41,114 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 11:47:41,114 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:47:41,115 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 11:47:41,115 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 11:47:41,115 INFO  L87              Difference]: Start difference. First operand 438 states and 680 transitions. Second operand  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:41,585 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:47:41,587 INFO  L93              Difference]: Finished difference Result 797 states and 1235 transitions.
[2025-03-08 11:47:41,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 11:47:41,589 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213
[2025-03-08 11:47:41,589 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:47:41,593 INFO  L225             Difference]: With dead ends: 797
[2025-03-08 11:47:41,593 INFO  L226             Difference]: Without dead ends: 546
[2025-03-08 11:47:41,594 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 11:47:41,594 INFO  L435           NwaCegarLoop]: 239 mSDtfsCounter, 169 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 11:47:41,595 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 657 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 11:47:41,595 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 546 states.
[2025-03-08 11:47:41,658 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 448.
[2025-03-08 11:47:41,659 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 448 states, 290 states have (on average 1.3448275862068966) internal successors, (390), 291 states have internal predecessors, (390), 152 states have call successors, (152), 5 states have call predecessors, (152), 5 states have return successors, (152), 151 states have call predecessors, (152), 152 states have call successors, (152)
[2025-03-08 11:47:41,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 694 transitions.
[2025-03-08 11:47:41,662 INFO  L78                 Accepts]: Start accepts. Automaton has 448 states and 694 transitions. Word has length 213
[2025-03-08 11:47:41,662 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:47:41,662 INFO  L471      AbstractCegarLoop]: Abstraction has 448 states and 694 transitions.
[2025-03-08 11:47:41,662 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:41,662 INFO  L276                IsEmpty]: Start isEmpty. Operand 448 states and 694 transitions.
[2025-03-08 11:47:41,664 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-03-08 11:47:41,664 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:47:41,664 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:47:41,664 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 11:47:41,664 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:47:41,664 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:47:41,665 INFO  L85        PathProgramCache]: Analyzing trace with hash 2130858452, now seen corresponding path program 1 times
[2025-03-08 11:47:41,665 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:47:41,665 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128218029]
[2025-03-08 11:47:41,665 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:47:41,665 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:47:41,674 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-08 11:47:41,709 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-08 11:47:41,709 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:47:41,709 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:47:42,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:47:42,376 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:47:42,376 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128218029]
[2025-03-08 11:47:42,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128218029] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:47:42,376 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:47:42,376 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 11:47:42,376 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888895582]
[2025-03-08 11:47:42,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:47:42,376 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 11:47:42,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:47:42,377 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 11:47:42,377 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-08 11:47:42,377 INFO  L87              Difference]: Start difference. First operand 448 states and 694 transitions. Second operand  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:42,994 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:47:42,994 INFO  L93              Difference]: Finished difference Result 1063 states and 1649 transitions.
[2025-03-08 11:47:42,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 11:47:42,995 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213
[2025-03-08 11:47:42,995 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:47:42,999 INFO  L225             Difference]: With dead ends: 1063
[2025-03-08 11:47:42,999 INFO  L226             Difference]: Without dead ends: 802
[2025-03-08 11:47:43,000 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-08 11:47:43,001 INFO  L435           NwaCegarLoop]: 209 mSDtfsCounter, 420 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 11:47:43,001 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 474 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 11:47:43,002 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 802 states.
[2025-03-08 11:47:43,082 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 670.
[2025-03-08 11:47:43,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 670 states, 423 states have (on average 1.326241134751773) internal successors, (561), 425 states have internal predecessors, (561), 238 states have call successors, (238), 8 states have call predecessors, (238), 8 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238)
[2025-03-08 11:47:43,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1037 transitions.
[2025-03-08 11:47:43,088 INFO  L78                 Accepts]: Start accepts. Automaton has 670 states and 1037 transitions. Word has length 213
[2025-03-08 11:47:43,088 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:47:43,088 INFO  L471      AbstractCegarLoop]: Abstraction has 670 states and 1037 transitions.
[2025-03-08 11:47:43,089 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:47:43,089 INFO  L276                IsEmpty]: Start isEmpty. Operand 670 states and 1037 transitions.
[2025-03-08 11:47:43,090 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-03-08 11:47:43,090 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:47:43,090 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:47:43,090 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 11:47:43,091 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:47:43,091 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:47:43,091 INFO  L85        PathProgramCache]: Analyzing trace with hash 1620324275, now seen corresponding path program 1 times
[2025-03-08 11:47:43,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:47:43,091 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761870491]
[2025-03-08 11:47:43,091 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:47:43,091 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:47:43,101 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-08 11:47:43,172 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-08 11:47:43,172 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:47:43,172 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat