./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
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_fillercodesize_ps-cn-100_file-11.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 c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 19:20:50,866 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 19:20:50,914 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 19:20:50,919 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 19:20:50,922 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 19:20:50,944 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 19:20:50,945 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 19:20:50,945 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 19:20:50,945 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 19:20:50,945 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 19:20:50,946 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 19:20:50,946 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 19:20:50,946 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 19:20:50,946 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 19:20:50,947 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 19:20:50,947 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 19:20:50,947 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 19:20:50,947 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 19:20:50,948 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 19:20:50,948 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 19:20:50,948 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 19:20:50,948 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 19:20:50,948 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 19:20:50,948 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 19:20:50,948 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 19:20:50,948 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 19:20:50,948 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 19:20:50,948 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 -> c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63
[2025-03-03 19:20:51,165 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 19:20:51,171 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 19:20:51,173 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 19:20:51,174 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 19:20:51,174 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 19:20:51,175 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-03-03 19:20:52,260 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2899ca6e4/15b22ad138f94c8686a3340622c87ef3/FLAG668f5d29e
[2025-03-03 19:20:52,508 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 19:20:52,508 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-03-03 19:20:52,519 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2899ca6e4/15b22ad138f94c8686a3340622c87ef3/FLAG668f5d29e
[2025-03-03 19:20:52,545 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2899ca6e4/15b22ad138f94c8686a3340622c87ef3
[2025-03-03 19:20:52,550 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 19:20:52,551 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 19:20:52,552 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 19:20:52,552 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 19:20:52,555 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 19:20:52,556 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,556 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df3a61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52, skipping insertion in model container
[2025-03-03 19:20:52,556 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,578 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 19:20:52,664 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_fillercodesize_ps-cn-100_file-11.i[916,929]
[2025-03-03 19:20:52,724 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 19:20:52,732 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 19:20:52,738 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_fillercodesize_ps-cn-100_file-11.i[916,929]
[2025-03-03 19:20:52,775 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 19:20:52,787 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 19:20:52,787 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52 WrapperNode
[2025-03-03 19:20:52,787 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 19:20:52,789 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 19:20:52,789 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 19:20:52,789 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 19:20:52,793 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,806 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,833 INFO  L138                Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 315
[2025-03-03 19:20:52,833 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 19:20:52,834 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 19:20:52,834 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 19:20:52,834 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 19:20:52,839 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,839 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,842 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,851 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-03 19:20:52,851 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,852 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,863 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,868 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,870 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,870 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,875 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 19:20:52,876 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 19:20:52,876 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 19:20:52,876 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 19:20:52,877 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ...
[2025-03-03 19:20:52,881 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 19:20:52,890 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:20:52,902 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-03 19:20:52,907 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-03 19:20:52,919 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 19:20:52,919 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 19:20:52,919 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 19:20:52,919 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 19:20:52,919 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 19:20:52,919 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 19:20:52,987 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 19:20:52,988 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 19:20:53,369 INFO  L?                        ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2025-03-03 19:20:53,369 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 19:20:53,390 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 19:20:53,390 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 19:20:53,390 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:20:53 BoogieIcfgContainer
[2025-03-03 19:20:53,390 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 19:20:53,392 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 19:20:53,392 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 19:20:53,395 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 19:20:53,396 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:20:52" (1/3) ...
[2025-03-03 19:20:53,396 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7ba00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:20:53, skipping insertion in model container
[2025-03-03 19:20:53,396 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (2/3) ...
[2025-03-03 19:20:53,397 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7ba00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:20:53, skipping insertion in model container
[2025-03-03 19:20:53,397 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:20:53" (3/3) ...
[2025-03-03 19:20:53,398 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-03-03 19:20:53,406 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 19:20:53,408 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i that has 2 procedures, 132 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 19:20:53,446 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 19:20:53,457 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;@201e7893, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 19:20:53,457 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 19:20:53,461 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 132 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 91 states have internal predecessors, (138), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-03-03 19:20:53,477 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-03-03 19:20:53,477 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:53,478 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:20:53,478 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:53,482 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:53,482 INFO  L85        PathProgramCache]: Analyzing trace with hash -344281931, now seen corresponding path program 1 times
[2025-03-03 19:20:53,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:53,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114687728]
[2025-03-03 19:20:53,489 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:53,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:53,590 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-03-03 19:20:53,615 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-03-03 19:20:53,616 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:53,616 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:53,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked.
[2025-03-03 19:20:53,804 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:53,804 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114687728]
[2025-03-03 19:20:53,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114687728] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 19:20:53,805 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508508633]
[2025-03-03 19:20:53,805 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:53,805 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 19:20:53,806 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:20:53,807 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-03 19:20:53,809 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-03 19:20:53,904 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-03-03 19:20:53,993 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-03-03 19:20:53,995 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:53,995 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:53,998 INFO  L256         TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 19:20:54,010 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:20:54,046 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked.
[2025-03-03 19:20:54,046 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 19:20:54,047 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [508508633] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:54,047 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 19:20:54,047 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-03 19:20:54,048 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236856103]
[2025-03-03 19:20:54,049 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:54,051 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 19:20:54,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:54,064 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 19:20:54,064 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 19:20:54,066 INFO  L87              Difference]: Start difference. First operand  has 132 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 91 states have internal predecessors, (138), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand  has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39)
[2025-03-03 19:20:54,099 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:54,099 INFO  L93              Difference]: Finished difference Result 258 states and 466 transitions.
[2025-03-03 19:20:54,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 19:20:54,101 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 250
[2025-03-03 19:20:54,102 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:54,106 INFO  L225             Difference]: With dead ends: 258
[2025-03-03 19:20:54,107 INFO  L226             Difference]: Without dead ends: 129
[2025-03-03 19:20:54,109 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 251 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-03 19:20:54,110 INFO  L435           NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:54,111 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:20:54,119 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2025-03-03 19:20:54,137 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129.
[2025-03-03 19:20:54,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 88 states have (on average 1.5) internal successors, (132), 88 states have internal predecessors, (132), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-03-03 19:20:54,141 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 210 transitions.
[2025-03-03 19:20:54,144 INFO  L78                 Accepts]: Start accepts. Automaton has 129 states and 210 transitions. Word has length 250
[2025-03-03 19:20:54,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:54,144 INFO  L471      AbstractCegarLoop]: Abstraction has 129 states and 210 transitions.
[2025-03-03 19:20:54,144 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39)
[2025-03-03 19:20:54,144 INFO  L276                IsEmpty]: Start isEmpty. Operand 129 states and 210 transitions.
[2025-03-03 19:20:54,147 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-03-03 19:20:54,147 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:54,147 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:20:54,154 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-03 19:20:54,348 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-03 19:20:54,348 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:54,349 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:54,349 INFO  L85        PathProgramCache]: Analyzing trace with hash 1829787124, now seen corresponding path program 1 times
[2025-03-03 19:20:54,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:54,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638712914]
[2025-03-03 19:20:54,349 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:54,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:54,365 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-03-03 19:20:54,417 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-03-03 19:20:54,417 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:54,417 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:54,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:20:54,590 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:54,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638712914]
[2025-03-03 19:20:54,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638712914] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:54,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:54,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 19:20:54,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431471514]
[2025-03-03 19:20:54,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:54,591 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 19:20:54,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:54,591 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 19:20:54,591 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:20:54,592 INFO  L87              Difference]: Start difference. First operand 129 states and 210 transitions. Second operand  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:54,654 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:54,654 INFO  L93              Difference]: Finished difference Result 322 states and 522 transitions.
[2025-03-03 19:20:54,655 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 19:20:54,655 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250
[2025-03-03 19:20:54,656 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:54,660 INFO  L225             Difference]: With dead ends: 322
[2025-03-03 19:20:54,660 INFO  L226             Difference]: Without dead ends: 196
[2025-03-03 19:20:54,661 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:20:54,661 INFO  L435           NwaCegarLoop]: 297 mSDtfsCounter, 200 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:54,662 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 403 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:20:54,662 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2025-03-03 19:20:54,678 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 129.
[2025-03-03 19:20:54,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-03-03 19:20:54,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 208 transitions.
[2025-03-03 19:20:54,683 INFO  L78                 Accepts]: Start accepts. Automaton has 129 states and 208 transitions. Word has length 250
[2025-03-03 19:20:54,685 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:54,686 INFO  L471      AbstractCegarLoop]: Abstraction has 129 states and 208 transitions.
[2025-03-03 19:20:54,686 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:54,686 INFO  L276                IsEmpty]: Start isEmpty. Operand 129 states and 208 transitions.
[2025-03-03 19:20:54,688 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2025-03-03 19:20:54,690 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:54,690 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:20:54,690 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 19:20:54,690 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:54,691 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:54,691 INFO  L85        PathProgramCache]: Analyzing trace with hash 331106021, now seen corresponding path program 1 times
[2025-03-03 19:20:54,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:54,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807915157]
[2025-03-03 19:20:54,692 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:54,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:54,713 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-03-03 19:20:54,741 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-03-03 19:20:54,742 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:54,742 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:55,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:20:55,035 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:55,035 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807915157]
[2025-03-03 19:20:55,035 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807915157] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:55,035 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:55,035 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 19:20:55,035 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809757296]
[2025-03-03 19:20:55,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:55,036 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 19:20:55,036 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:55,036 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 19:20:55,036 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:20:55,037 INFO  L87              Difference]: Start difference. First operand 129 states and 208 transitions. Second operand  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:55,226 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:55,227 INFO  L93              Difference]: Finished difference Result 351 states and 567 transitions.
[2025-03-03 19:20:55,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:20:55,227 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 251
[2025-03-03 19:20:55,228 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:55,229 INFO  L225             Difference]: With dead ends: 351
[2025-03-03 19:20:55,229 INFO  L226             Difference]: Without dead ends: 225
[2025-03-03 19:20:55,230 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-03 19:20:55,231 INFO  L435           NwaCegarLoop]: 243 mSDtfsCounter, 288 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:55,231 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 643 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 19:20:55,232 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 225 states.
[2025-03-03 19:20:55,246 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 149.
[2025-03-03 19:20:55,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 149 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-03-03 19:20:55,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 238 transitions.
[2025-03-03 19:20:55,250 INFO  L78                 Accepts]: Start accepts. Automaton has 149 states and 238 transitions. Word has length 251
[2025-03-03 19:20:55,251 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:55,251 INFO  L471      AbstractCegarLoop]: Abstraction has 149 states and 238 transitions.
[2025-03-03 19:20:55,252 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:55,252 INFO  L276                IsEmpty]: Start isEmpty. Operand 149 states and 238 transitions.
[2025-03-03 19:20:55,253 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-03 19:20:55,254 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:55,254 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:20:55,254 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 19:20:55,255 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:55,255 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:55,255 INFO  L85        PathProgramCache]: Analyzing trace with hash 1098140009, now seen corresponding path program 1 times
[2025-03-03 19:20:55,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:55,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556968814]
[2025-03-03 19:20:55,256 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:55,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:55,273 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-03 19:20:55,290 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-03 19:20:55,291 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:55,291 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:55,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:20:55,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:55,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556968814]
[2025-03-03 19:20:55,434 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556968814] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:55,434 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:55,434 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 19:20:55,434 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505694879]
[2025-03-03 19:20:55,434 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:55,435 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 19:20:55,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:55,435 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 19:20:55,436 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:20:55,436 INFO  L87              Difference]: Start difference. First operand 149 states and 238 transitions. Second operand  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:55,469 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:55,472 INFO  L93              Difference]: Finished difference Result 296 states and 475 transitions.
[2025-03-03 19:20:55,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 19:20:55,473 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-03-03 19:20:55,473 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:55,474 INFO  L225             Difference]: With dead ends: 296
[2025-03-03 19:20:55,474 INFO  L226             Difference]: Without dead ends: 150
[2025-03-03 19:20:55,475 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:20:55,475 INFO  L435           NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:55,475 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:20:55,478 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2025-03-03 19:20:55,489 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150.
[2025-03-03 19:20:55,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 150 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 states have internal predecessors, (161), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-03-03 19:20:55,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 239 transitions.
[2025-03-03 19:20:55,494 INFO  L78                 Accepts]: Start accepts. Automaton has 150 states and 239 transitions. Word has length 252
[2025-03-03 19:20:55,494 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:55,494 INFO  L471      AbstractCegarLoop]: Abstraction has 150 states and 239 transitions.
[2025-03-03 19:20:55,494 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:55,495 INFO  L276                IsEmpty]: Start isEmpty. Operand 150 states and 239 transitions.
[2025-03-03 19:20:55,498 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-03 19:20:55,498 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:55,498 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:20:55,499 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 19:20:55,499 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:55,499 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:55,499 INFO  L85        PathProgramCache]: Analyzing trace with hash 101067656, now seen corresponding path program 1 times
[2025-03-03 19:20:55,500 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:55,500 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579426137]
[2025-03-03 19:20:55,500 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:55,500 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:55,520 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-03 19:20:55,541 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-03 19:20:55,542 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:55,542 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:55,638 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:20:55,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:55,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579426137]
[2025-03-03 19:20:55,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579426137] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:55,639 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:55,639 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 19:20:55,639 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787986711]
[2025-03-03 19:20:55,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:55,640 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 19:20:55,640 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:55,641 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 19:20:55,641 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:20:55,641 INFO  L87              Difference]: Start difference. First operand 150 states and 239 transitions. Second operand  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:55,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:55,703 INFO  L93              Difference]: Finished difference Result 408 states and 651 transitions.
[2025-03-03 19:20:55,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 19:20:55,703 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-03-03 19:20:55,704 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:55,708 INFO  L225             Difference]: With dead ends: 408
[2025-03-03 19:20:55,708 INFO  L226             Difference]: Without dead ends: 261
[2025-03-03 19:20:55,709 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:20:55,709 INFO  L435           NwaCegarLoop]: 300 mSDtfsCounter, 138 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:55,710 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 487 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:20:55,711 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 261 states.
[2025-03-03 19:20:55,734 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258.
[2025-03-03 19:20:55,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 258 states, 192 states have (on average 1.5) internal successors, (288), 193 states have internal predecessors, (288), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61)
[2025-03-03 19:20:55,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 410 transitions.
[2025-03-03 19:20:55,737 INFO  L78                 Accepts]: Start accepts. Automaton has 258 states and 410 transitions. Word has length 252
[2025-03-03 19:20:55,738 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:55,739 INFO  L471      AbstractCegarLoop]: Abstraction has 258 states and 410 transitions.
[2025-03-03 19:20:55,740 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:55,740 INFO  L276                IsEmpty]: Start isEmpty. Operand 258 states and 410 transitions.
[2025-03-03 19:20:55,742 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-03 19:20:55,743 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:55,743 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:20:55,743 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 19:20:55,743 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:55,745 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:55,745 INFO  L85        PathProgramCache]: Analyzing trace with hash 1062681673, now seen corresponding path program 1 times
[2025-03-03 19:20:55,745 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:55,745 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712216641]
[2025-03-03 19:20:55,745 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:55,745 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:55,765 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-03 19:20:55,794 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-03 19:20:55,794 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:55,794 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:56,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:20:56,059 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:56,060 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712216641]
[2025-03-03 19:20:56,060 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712216641] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:56,060 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:56,060 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 19:20:56,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151699229]
[2025-03-03 19:20:56,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:56,061 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 19:20:56,061 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:56,061 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 19:20:56,061 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-03 19:20:56,061 INFO  L87              Difference]: Start difference. First operand 258 states and 410 transitions. Second operand  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:56,282 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:56,282 INFO  L93              Difference]: Finished difference Result 671 states and 1071 transitions.
[2025-03-03 19:20:56,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 19:20:56,284 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-03-03 19:20:56,285 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:56,290 INFO  L225             Difference]: With dead ends: 671
[2025-03-03 19:20:56,290 INFO  L226             Difference]: Without dead ends: 416
[2025-03-03 19:20:56,291 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42
[2025-03-03 19:20:56,292 INFO  L435           NwaCegarLoop]: 243 mSDtfsCounter, 443 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:56,292 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 587 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 19:20:56,293 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 416 states.
[2025-03-03 19:20:56,313 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 260.
[2025-03-03 19:20:56,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 194 states have (on average 1.5051546391752577) internal successors, (292), 195 states have internal predecessors, (292), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61)
[2025-03-03 19:20:56,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 414 transitions.
[2025-03-03 19:20:56,315 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 414 transitions. Word has length 252
[2025-03-03 19:20:56,316 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:56,316 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 414 transitions.
[2025-03-03 19:20:56,316 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:56,316 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 414 transitions.
[2025-03-03 19:20:56,317 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-03 19:20:56,318 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:56,318 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:20:56,318 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 19:20:56,318 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:56,318 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:56,318 INFO  L85        PathProgramCache]: Analyzing trace with hash -1987521142, now seen corresponding path program 1 times
[2025-03-03 19:20:56,318 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:56,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281141800]
[2025-03-03 19:20:56,319 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:56,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:56,332 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-03 19:20:56,354 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-03 19:20:56,354 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:56,355 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:56,740 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:20:56,741 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:56,741 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281141800]
[2025-03-03 19:20:56,741 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281141800] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:56,741 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:56,741 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 19:20:56,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968920341]
[2025-03-03 19:20:56,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:56,742 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 19:20:56,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:56,743 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 19:20:56,743 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 19:20:56,743 INFO  L87              Difference]: Start difference. First operand 260 states and 414 transitions. Second operand  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:57,287 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:57,287 INFO  L93              Difference]: Finished difference Result 963 states and 1523 transitions.
[2025-03-03 19:20:57,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 19:20:57,287 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-03-03 19:20:57,288 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:57,292 INFO  L225             Difference]: With dead ends: 963
[2025-03-03 19:20:57,293 INFO  L226             Difference]: Without dead ends: 706
[2025-03-03 19:20:57,294 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2025-03-03 19:20:57,296 INFO  L435           NwaCegarLoop]: 469 mSDtfsCounter, 506 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:57,296 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 958 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 19:20:57,297 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 706 states.
[2025-03-03 19:20:57,325 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 260.
[2025-03-03 19:20:57,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 194 states have (on average 1.4948453608247423) internal successors, (290), 195 states have internal predecessors, (290), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61)
[2025-03-03 19:20:57,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 412 transitions.
[2025-03-03 19:20:57,329 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 412 transitions. Word has length 252
[2025-03-03 19:20:57,329 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:57,330 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 412 transitions.
[2025-03-03 19:20:57,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:57,330 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 412 transitions.
[2025-03-03 19:20:57,332 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-03 19:20:57,332 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:57,332 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:20:57,332 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 19:20:57,332 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:57,332 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:57,335 INFO  L85        PathProgramCache]: Analyzing trace with hash 797194570, now seen corresponding path program 1 times
[2025-03-03 19:20:57,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:57,335 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941163227]
[2025-03-03 19:20:57,335 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:57,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:57,349 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-03 19:20:57,368 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-03 19:20:57,368 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:57,368 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:57,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:20:57,574 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:57,574 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941163227]
[2025-03-03 19:20:57,574 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941163227] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:57,574 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:57,574 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 19:20:57,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626431531]
[2025-03-03 19:20:57,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:57,575 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 19:20:57,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:57,576 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 19:20:57,576 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-03 19:20:57,576 INFO  L87              Difference]: Start difference. First operand 260 states and 412 transitions. Second operand  has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:58,335 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:58,335 INFO  L93              Difference]: Finished difference Result 967 states and 1524 transitions.
[2025-03-03 19:20:58,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 19:20:58,336 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-03-03 19:20:58,337 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:58,340 INFO  L225             Difference]: With dead ends: 967
[2025-03-03 19:20:58,341 INFO  L226             Difference]: Without dead ends: 710
[2025-03-03 19:20:58,342 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156
[2025-03-03 19:20:58,342 INFO  L435           NwaCegarLoop]: 278 mSDtfsCounter, 689 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:58,342 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1023 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 19:20:58,343 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 710 states.
[2025-03-03 19:20:58,383 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 484.
[2025-03-03 19:20:58,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 484 states, 353 states have (on average 1.4702549575070822) internal successors, (519), 355 states have internal predecessors, (519), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122)
[2025-03-03 19:20:58,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 763 transitions.
[2025-03-03 19:20:58,387 INFO  L78                 Accepts]: Start accepts. Automaton has 484 states and 763 transitions. Word has length 252
[2025-03-03 19:20:58,387 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:58,387 INFO  L471      AbstractCegarLoop]: Abstraction has 484 states and 763 transitions.
[2025-03-03 19:20:58,388 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:58,388 INFO  L276                IsEmpty]: Start isEmpty. Operand 484 states and 763 transitions.
[2025-03-03 19:20:58,390 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-03 19:20:58,390 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:58,390 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:20:58,390 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 19:20:58,390 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:58,390 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:58,391 INFO  L85        PathProgramCache]: Analyzing trace with hash 388370345, now seen corresponding path program 1 times
[2025-03-03 19:20:58,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:58,391 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769740522]
[2025-03-03 19:20:58,391 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:58,391 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:58,404 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-03 19:20:58,420 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-03 19:20:58,420 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:58,420 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:58,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:20:58,808 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:58,808 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769740522]
[2025-03-03 19:20:58,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769740522] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:58,808 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:58,808 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 19:20:58,808 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740334198]
[2025-03-03 19:20:58,808 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:58,809 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 19:20:58,809 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:58,809 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 19:20:58,809 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:20:58,809 INFO  L87              Difference]: Start difference. First operand 484 states and 763 transitions. Second operand  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:58,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:58,881 INFO  L93              Difference]: Finished difference Result 1007 states and 1580 transitions.
[2025-03-03 19:20:58,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:20:58,882 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-03-03 19:20:58,882 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:58,884 INFO  L225             Difference]: With dead ends: 1007
[2025-03-03 19:20:58,884 INFO  L226             Difference]: Without dead ends: 526
[2025-03-03 19:20:58,886 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 19:20:58,886 INFO  L435           NwaCegarLoop]: 197 mSDtfsCounter, 42 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:58,886 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 397 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:20:58,887 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 526 states.
[2025-03-03 19:20:58,938 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 500.
[2025-03-03 19:20:58,939 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 500 states, 369 states have (on average 1.4715447154471544) internal successors, (543), 371 states have internal predecessors, (543), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122)
[2025-03-03 19:20:58,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 787 transitions.
[2025-03-03 19:20:58,942 INFO  L78                 Accepts]: Start accepts. Automaton has 500 states and 787 transitions. Word has length 252
[2025-03-03 19:20:58,942 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:58,942 INFO  L471      AbstractCegarLoop]: Abstraction has 500 states and 787 transitions.
[2025-03-03 19:20:58,943 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:58,943 INFO  L276                IsEmpty]: Start isEmpty. Operand 500 states and 787 transitions.
[2025-03-03 19:20:58,945 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-03 19:20:58,945 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:58,945 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:20:58,945 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 19:20:58,946 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:58,946 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:58,946 INFO  L85        PathProgramCache]: Analyzing trace with hash 389293866, now seen corresponding path program 1 times
[2025-03-03 19:20:58,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:58,946 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253647470]
[2025-03-03 19:20:58,946 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:58,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:58,959 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-03 19:20:59,027 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-03 19:20:59,031 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:59,031 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:59,225 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:20:59,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:59,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253647470]
[2025-03-03 19:20:59,228 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253647470] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:59,228 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:59,228 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 19:20:59,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544045107]
[2025-03-03 19:20:59,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:59,233 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 19:20:59,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:59,233 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 19:20:59,234 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:20:59,234 INFO  L87              Difference]: Start difference. First operand 500 states and 787 transitions. Second operand  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:59,508 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:59,509 INFO  L93              Difference]: Finished difference Result 1328 states and 2099 transitions.
[2025-03-03 19:20:59,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:20:59,509 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-03-03 19:20:59,511 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:59,516 INFO  L225             Difference]: With dead ends: 1328
[2025-03-03 19:20:59,516 INFO  L226             Difference]: Without dead ends: 831
[2025-03-03 19:20:59,517 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 19:20:59,518 INFO  L435           NwaCegarLoop]: 198 mSDtfsCounter, 190 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:59,518 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 700 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 19:20:59,519 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 831 states.
[2025-03-03 19:20:59,570 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 749.
[2025-03-03 19:20:59,573 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 749 states, 577 states have (on average 1.4974003466204506) internal successors, (864), 579 states have internal predecessors, (864), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-03-03 19:20:59,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1186 transitions.
[2025-03-03 19:20:59,587 INFO  L78                 Accepts]: Start accepts. Automaton has 749 states and 1186 transitions. Word has length 252
[2025-03-03 19:20:59,588 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:59,588 INFO  L471      AbstractCegarLoop]: Abstraction has 749 states and 1186 transitions.
[2025-03-03 19:20:59,588 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:20:59,588 INFO  L276                IsEmpty]: Start isEmpty. Operand 749 states and 1186 transitions.
[2025-03-03 19:20:59,590 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-03-03 19:20:59,590 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:59,590 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:20:59,590 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 19:20:59,590 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:59,591 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:59,591 INFO  L85        PathProgramCache]: Analyzing trace with hash 1376635546, now seen corresponding path program 1 times
[2025-03-03 19:20:59,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:59,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163833399]
[2025-03-03 19:20:59,591 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:59,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:59,604 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-03-03 19:20:59,649 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-03-03 19:20:59,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:59,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:00,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:21:00,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:21:00,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163833399]
[2025-03-03 19:21:00,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163833399] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:21:00,469 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:21:00,469 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 19:21:00,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986953068]
[2025-03-03 19:21:00,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:21:00,470 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 19:21:00,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:21:00,470 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 19:21:00,470 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2025-03-03 19:21:00,471 INFO  L87              Difference]: Start difference. First operand 749 states and 1186 transitions. Second operand  has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39)
[2025-03-03 19:21:01,600 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:21:01,600 INFO  L93              Difference]: Finished difference Result 2531 states and 4007 transitions.
[2025-03-03 19:21:01,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 19:21:01,601 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 253
[2025-03-03 19:21:01,602 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:21:01,612 INFO  L225             Difference]: With dead ends: 2531
[2025-03-03 19:21:01,612 INFO  L226             Difference]: Without dead ends: 1992
[2025-03-03 19:21:01,615 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210
[2025-03-03 19:21:01,615 INFO  L435           NwaCegarLoop]: 279 mSDtfsCounter, 1071 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 19:21:01,616 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 676 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 19:21:01,617 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1992 states.
[2025-03-03 19:21:01,717 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 795.
[2025-03-03 19:21:01,719 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 795 states, 623 states have (on average 1.4895666131621188) internal successors, (928), 625 states have internal predecessors, (928), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-03-03 19:21:01,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1250 transitions.
[2025-03-03 19:21:01,723 INFO  L78                 Accepts]: Start accepts. Automaton has 795 states and 1250 transitions. Word has length 253
[2025-03-03 19:21:01,724 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:21:01,724 INFO  L471      AbstractCegarLoop]: Abstraction has 795 states and 1250 transitions.
[2025-03-03 19:21:01,724 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39)
[2025-03-03 19:21:01,724 INFO  L276                IsEmpty]: Start isEmpty. Operand 795 states and 1250 transitions.
[2025-03-03 19:21:01,726 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-03-03 19:21:01,726 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:01,726 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:01,727 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 19:21:01,727 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:01,727 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:01,727 INFO  L85        PathProgramCache]: Analyzing trace with hash -700573797, now seen corresponding path program 1 times
[2025-03-03 19:21:01,727 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:21:01,727 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030849221]
[2025-03-03 19:21:01,727 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:01,727 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:21:01,739 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-03-03 19:21:01,751 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-03-03 19:21:01,752 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:01,752 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:01,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:21:01,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:21:01,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030849221]
[2025-03-03 19:21:01,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030849221] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:21:01,821 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:21:01,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 19:21:01,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969987160]
[2025-03-03 19:21:01,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:21:01,821 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 19:21:01,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:21:01,822 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 19:21:01,822 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 19:21:01,822 INFO  L87              Difference]: Start difference. First operand 795 states and 1250 transitions. Second operand  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:02,028 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:21:02,028 INFO  L93              Difference]: Finished difference Result 1532 states and 2409 transitions.
[2025-03-03 19:21:02,028 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 19:21:02,029 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 253
[2025-03-03 19:21:02,029 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:21:02,033 INFO  L225             Difference]: With dead ends: 1532
[2025-03-03 19:21:02,033 INFO  L226             Difference]: Without dead ends: 941
[2025-03-03 19:21:02,035 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 19:21:02,035 INFO  L435           NwaCegarLoop]: 303 mSDtfsCounter, 140 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 19:21:02,036 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 734 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 19:21:02,036 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 941 states.
[2025-03-03 19:21:02,098 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 781.
[2025-03-03 19:21:02,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 781 states, 609 states have (on average 1.4811165845648604) internal successors, (902), 611 states have internal predecessors, (902), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-03-03 19:21:02,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1224 transitions.
[2025-03-03 19:21:02,103 INFO  L78                 Accepts]: Start accepts. Automaton has 781 states and 1224 transitions. Word has length 253
[2025-03-03 19:21:02,103 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:21:02,104 INFO  L471      AbstractCegarLoop]: Abstraction has 781 states and 1224 transitions.
[2025-03-03 19:21:02,104 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:02,104 INFO  L276                IsEmpty]: Start isEmpty. Operand 781 states and 1224 transitions.
[2025-03-03 19:21:02,106 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-03-03 19:21:02,106 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:02,106 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:02,106 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 19:21:02,106 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:02,107 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:02,107 INFO  L85        PathProgramCache]: Analyzing trace with hash -449427811, now seen corresponding path program 1 times
[2025-03-03 19:21:02,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:21:02,107 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119335298]
[2025-03-03 19:21:02,107 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:02,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:21:02,119 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-03 19:21:02,131 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-03 19:21:02,131 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:02,131 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:02,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:21:02,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:21:02,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119335298]
[2025-03-03 19:21:02,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119335298] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:21:02,238 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:21:02,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 19:21:02,239 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318020216]
[2025-03-03 19:21:02,239 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:21:02,239 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 19:21:02,239 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:21:02,240 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 19:21:02,240 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-03 19:21:02,240 INFO  L87              Difference]: Start difference. First operand 781 states and 1224 transitions. Second operand  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:02,622 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:21:02,623 INFO  L93              Difference]: Finished difference Result 1824 states and 2864 transitions.
[2025-03-03 19:21:02,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 19:21:02,623 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254
[2025-03-03 19:21:02,624 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:21:02,631 INFO  L225             Difference]: With dead ends: 1824
[2025-03-03 19:21:02,631 INFO  L226             Difference]: Without dead ends: 1497
[2025-03-03 19:21:02,632 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-03-03 19:21:02,633 INFO  L435           NwaCegarLoop]: 231 mSDtfsCounter, 307 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 19:21:02,633 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 923 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 19:21:02,634 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1497 states.
[2025-03-03 19:21:02,705 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 801.
[2025-03-03 19:21:02,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 801 states, 629 states have (on average 1.4848966613672496) internal successors, (934), 631 states have internal predecessors, (934), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-03-03 19:21:02,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1256 transitions.
[2025-03-03 19:21:02,711 INFO  L78                 Accepts]: Start accepts. Automaton has 801 states and 1256 transitions. Word has length 254
[2025-03-03 19:21:02,711 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:21:02,711 INFO  L471      AbstractCegarLoop]: Abstraction has 801 states and 1256 transitions.
[2025-03-03 19:21:02,711 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:02,711 INFO  L276                IsEmpty]: Start isEmpty. Operand 801 states and 1256 transitions.
[2025-03-03 19:21:02,714 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-03-03 19:21:02,714 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:02,714 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:02,715 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 19:21:02,715 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:02,715 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:02,715 INFO  L85        PathProgramCache]: Analyzing trace with hash -238076898, now seen corresponding path program 1 times
[2025-03-03 19:21:02,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:21:02,715 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461145072]
[2025-03-03 19:21:02,715 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:02,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:21:02,726 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-03 19:21:02,738 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-03 19:21:02,738 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:02,739 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:02,795 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:21:02,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:21:02,796 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461145072]
[2025-03-03 19:21:02,796 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461145072] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:21:02,796 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:21:02,796 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 19:21:02,796 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406158596]
[2025-03-03 19:21:02,796 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:21:02,796 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 19:21:02,796 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:21:02,797 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 19:21:02,797 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 19:21:02,797 INFO  L87              Difference]: Start difference. First operand 801 states and 1256 transitions. Second operand  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:02,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:21:02,984 INFO  L93              Difference]: Finished difference Result 1324 states and 2080 transitions.
[2025-03-03 19:21:02,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 19:21:02,984 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254
[2025-03-03 19:21:02,985 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:21:02,989 INFO  L225             Difference]: With dead ends: 1324
[2025-03-03 19:21:02,989 INFO  L226             Difference]: Without dead ends: 961
[2025-03-03 19:21:02,990 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 19:21:02,991 INFO  L435           NwaCegarLoop]: 204 mSDtfsCounter, 142 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 19:21:02,991 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 530 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 19:21:02,991 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 961 states.
[2025-03-03 19:21:03,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 801.
[2025-03-03 19:21:03,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 801 states, 629 states have (on average 1.4721780604133545) internal successors, (926), 631 states have internal predecessors, (926), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-03-03 19:21:03,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1248 transitions.
[2025-03-03 19:21:03,055 INFO  L78                 Accepts]: Start accepts. Automaton has 801 states and 1248 transitions. Word has length 254
[2025-03-03 19:21:03,055 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:21:03,055 INFO  L471      AbstractCegarLoop]: Abstraction has 801 states and 1248 transitions.
[2025-03-03 19:21:03,056 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:03,056 INFO  L276                IsEmpty]: Start isEmpty. Operand 801 states and 1248 transitions.
[2025-03-03 19:21:03,057 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-03-03 19:21:03,057 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:03,058 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:03,058 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 19:21:03,058 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:03,058 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:03,058 INFO  L85        PathProgramCache]: Analyzing trace with hash 1979681055, now seen corresponding path program 1 times
[2025-03-03 19:21:03,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:21:03,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630484728]
[2025-03-03 19:21:03,058 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:03,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:21:03,068 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-03 19:21:03,079 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-03 19:21:03,079 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:03,079 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:03,250 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:21:03,251 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:21:03,251 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630484728]
[2025-03-03 19:21:03,251 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630484728] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:21:03,251 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:21:03,251 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 19:21:03,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654544195]
[2025-03-03 19:21:03,252 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:21:03,253 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 19:21:03,253 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:21:03,253 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 19:21:03,253 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:21:03,253 INFO  L87              Difference]: Start difference. First operand 801 states and 1248 transitions. Second operand  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:03,641 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:21:03,641 INFO  L93              Difference]: Finished difference Result 1284 states and 2010 transitions.
[2025-03-03 19:21:03,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:21:03,642 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254
[2025-03-03 19:21:03,642 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:21:03,647 INFO  L225             Difference]: With dead ends: 1284
[2025-03-03 19:21:03,647 INFO  L226             Difference]: Without dead ends: 909
[2025-03-03 19:21:03,648 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 19:21:03,649 INFO  L435           NwaCegarLoop]: 407 mSDtfsCounter, 427 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 19:21:03,649 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 809 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 19:21:03,650 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 909 states.
[2025-03-03 19:21:03,705 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 755.
[2025-03-03 19:21:03,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 755 states, 583 states have (on average 1.4648370497427101) internal successors, (854), 585 states have internal predecessors, (854), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-03-03 19:21:03,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1176 transitions.
[2025-03-03 19:21:03,709 INFO  L78                 Accepts]: Start accepts. Automaton has 755 states and 1176 transitions. Word has length 254
[2025-03-03 19:21:03,710 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:21:03,710 INFO  L471      AbstractCegarLoop]: Abstraction has 755 states and 1176 transitions.
[2025-03-03 19:21:03,711 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:03,711 INFO  L276                IsEmpty]: Start isEmpty. Operand 755 states and 1176 transitions.
[2025-03-03 19:21:03,712 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-03-03 19:21:03,712 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:03,712 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:03,712 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 19:21:03,712 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:03,712 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:03,713 INFO  L85        PathProgramCache]: Analyzing trace with hash -185064485, now seen corresponding path program 1 times
[2025-03-03 19:21:03,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:21:03,713 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401316388]
[2025-03-03 19:21:03,713 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:03,713 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:21:03,725 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-03 19:21:03,737 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-03 19:21:03,738 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:03,738 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:03,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:21:03,873 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:21:03,873 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401316388]
[2025-03-03 19:21:03,873 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401316388] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:21:03,874 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:21:03,874 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 19:21:03,874 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874524500]
[2025-03-03 19:21:03,874 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:21:03,874 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 19:21:03,874 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:21:03,875 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 19:21:03,875 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 19:21:03,875 INFO  L87              Difference]: Start difference. First operand 755 states and 1176 transitions. Second operand  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:04,060 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:21:04,060 INFO  L93              Difference]: Finished difference Result 1750 states and 2749 transitions.
[2025-03-03 19:21:04,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 19:21:04,061 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254
[2025-03-03 19:21:04,061 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:21:04,066 INFO  L225             Difference]: With dead ends: 1750
[2025-03-03 19:21:04,066 INFO  L226             Difference]: Without dead ends: 1155
[2025-03-03 19:21:04,067 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 19:21:04,068 INFO  L435           NwaCegarLoop]: 262 mSDtfsCounter, 121 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 19:21:04,068 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 645 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 19:21:04,069 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1155 states.
[2025-03-03 19:21:04,132 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 747.
[2025-03-03 19:21:04,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 747 states, 575 states have (on average 1.4539130434782608) internal successors, (836), 577 states have internal predecessors, (836), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-03-03 19:21:04,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1158 transitions.
[2025-03-03 19:21:04,137 INFO  L78                 Accepts]: Start accepts. Automaton has 747 states and 1158 transitions. Word has length 254
[2025-03-03 19:21:04,138 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:21:04,138 INFO  L471      AbstractCegarLoop]: Abstraction has 747 states and 1158 transitions.
[2025-03-03 19:21:04,138 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:04,138 INFO  L276                IsEmpty]: Start isEmpty. Operand 747 states and 1158 transitions.
[2025-03-03 19:21:04,139 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-03-03 19:21:04,139 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:04,139 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:04,139 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 19:21:04,140 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:04,140 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:04,140 INFO  L85        PathProgramCache]: Analyzing trace with hash 1882886011, now seen corresponding path program 1 times
[2025-03-03 19:21:04,140 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:21:04,140 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555263462]
[2025-03-03 19:21:04,140 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:04,140 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:21:04,151 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-03 19:21:04,161 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-03 19:21:04,161 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:04,161 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:04,246 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:21:04,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:21:04,247 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555263462]
[2025-03-03 19:21:04,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555263462] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:21:04,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:21:04,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 19:21:04,247 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445457314]
[2025-03-03 19:21:04,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:21:04,248 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 19:21:04,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:21:04,249 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 19:21:04,249 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:21:04,249 INFO  L87              Difference]: Start difference. First operand 747 states and 1158 transitions. Second operand  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:04,578 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:21:04,578 INFO  L93              Difference]: Finished difference Result 1541 states and 2388 transitions.
[2025-03-03 19:21:04,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:21:04,579 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254
[2025-03-03 19:21:04,579 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:21:04,584 INFO  L225             Difference]: With dead ends: 1541
[2025-03-03 19:21:04,584 INFO  L226             Difference]: Without dead ends: 994
[2025-03-03 19:21:04,586 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03 19:21:04,586 INFO  L435           NwaCegarLoop]: 260 mSDtfsCounter, 281 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 19:21:04,586 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 619 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 19:21:04,588 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 994 states.
[2025-03-03 19:21:04,662 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 988.
[2025-03-03 19:21:04,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 988 states, 764 states have (on average 1.4541884816753927) internal successors, (1111), 768 states have internal predecessors, (1111), 209 states have call successors, (209), 14 states have call predecessors, (209), 14 states have return successors, (209), 205 states have call predecessors, (209), 209 states have call successors, (209)
[2025-03-03 19:21:04,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1529 transitions.
[2025-03-03 19:21:04,669 INFO  L78                 Accepts]: Start accepts. Automaton has 988 states and 1529 transitions. Word has length 254
[2025-03-03 19:21:04,669 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:21:04,669 INFO  L471      AbstractCegarLoop]: Abstraction has 988 states and 1529 transitions.
[2025-03-03 19:21:04,669 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:04,669 INFO  L276                IsEmpty]: Start isEmpty. Operand 988 states and 1529 transitions.
[2025-03-03 19:21:04,670 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-03-03 19:21:04,671 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:04,671 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:04,671 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 19:21:04,671 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:04,671 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:04,671 INFO  L85        PathProgramCache]: Analyzing trace with hash 2094236924, now seen corresponding path program 1 times
[2025-03-03 19:21:04,671 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:21:04,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633706034]
[2025-03-03 19:21:04,672 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:04,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:21:04,682 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-03 19:21:04,755 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-03 19:21:04,755 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:04,755 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:04,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked.
[2025-03-03 19:21:04,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:21:04,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633706034]
[2025-03-03 19:21:04,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633706034] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 19:21:04,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986712784]
[2025-03-03 19:21:04,997 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:04,997 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 19:21:04,998 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:21:04,999 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 19:21:05,001 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 19:21:05,074 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-03 19:21:05,122 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-03 19:21:05,122 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:05,122 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:05,124 INFO  L256         TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-03-03 19:21:05,129 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:21:05,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 1508 proven. 51 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked.
[2025-03-03 19:21:05,538 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 19:21:05,610 WARN  L320   FreeRefinementEngine]: Global settings require throwing the following exception
[2025-03-03 19:21:05,618 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-03 19:21:05,815 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-03-03 19:21:05,816 FATAL L?                        ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.IllegalArgumentException: Modulus must be strictly greater one but is 0
	at de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.findAllDmlPossibilities(DualJunctionDml.java:162)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.tryToEliminate(DualJunctionDml.java:184)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.<init>(TraceCheckSpWp.java:160)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77)
	at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267)
	at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148)
	at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137)
	at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.<init>(AutomatonFreeRefinementEngine.java:85)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:82)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:140)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
	at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63)
[2025-03-03 19:21:05,820 INFO  L158              Benchmark]: Toolchain (without parser) took 13269.29ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 107.5MB in the beginning and 226.3MB in the end (delta: -118.8MB). Peak memory consumption was 260.5MB. Max. memory is 16.1GB.
[2025-03-03 19:21:05,821 INFO  L158              Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 19:21:05,821 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 235.87ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 90.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-03 19:21:05,822 INFO  L158              Benchmark]: Boogie Procedure Inliner took 44.80ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 86.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 19:21:05,822 INFO  L158              Benchmark]: Boogie Preprocessor took 41.57ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 81.9MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 19:21:05,822 INFO  L158              Benchmark]: IcfgBuilder took 514.71ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 47.5MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-03 19:21:05,822 INFO  L158              Benchmark]: TraceAbstraction took 12428.06ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 46.5MB in the beginning and 226.3MB in the end (delta: -179.8MB). Peak memory consumption was 201.8MB. Max. memory is 16.1GB.
[2025-03-03 19:21:05,823 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 235.87ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 90.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 44.80ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 86.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 41.57ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 81.9MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 514.71ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 47.5MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 12428.06ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 46.5MB in the beginning and 226.3MB in the end (delta: -179.8MB). Peak memory consumption was 201.8MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - ExceptionOrErrorResult: IllegalArgumentException: Modulus must be strictly greater one but is 0
    de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: Modulus must be strictly greater one but is 0: de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
[2025-03-03 19:21:05,839 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
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_fillercodesize_ps-cn-100_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 19:21:07,582 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 19:21:07,661 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-03 19:21:07,666 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 19:21:07,666 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 19:21:07,683 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 19:21:07,683 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 19:21:07,683 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 19:21:07,684 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 19:21:07,684 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 19:21:07,684 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 19:21:07,684 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 19:21:07,684 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 19:21:07,684 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 19:21:07,684 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 19:21:07,684 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 19:21:07,685 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 19:21:07,685 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 19:21:07,685 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 19:21:07,685 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 19:21:07,685 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 19:21:07,685 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 19:21:07,685 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 19:21:07,685 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-03 19:21:07,685 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-03 19:21:07,685 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-03 19:21:07,685 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 19:21:07,685 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 19:21:07,686 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 19:21:07,686 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 19:21:07,686 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 19:21:07,686 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 19:21:07,686 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 19:21:07,686 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 19:21:07,686 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 19:21:07,686 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 19:21:07,686 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 19:21:07,686 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 19:21:07,687 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 19:21:07,687 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-03 19:21:07,687 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-03 19:21:07,687 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 19:21:07,687 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 19:21:07,687 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 19:21:07,687 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 19:21:07,687 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 -> c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63
[2025-03-03 19:21:07,913 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 19:21:07,922 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 19:21:07,923 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 19:21:07,924 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 19:21:07,925 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 19:21:07,925 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-03-03 19:21:09,037 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75aa2e2a/79d51660e69043f4ac6fd01486ee8785/FLAG4a05c6d1d
[2025-03-03 19:21:09,244 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 19:21:09,246 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-03-03 19:21:09,254 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75aa2e2a/79d51660e69043f4ac6fd01486ee8785/FLAG4a05c6d1d
[2025-03-03 19:21:09,594 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75aa2e2a/79d51660e69043f4ac6fd01486ee8785
[2025-03-03 19:21:09,596 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 19:21:09,596 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 19:21:09,597 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 19:21:09,597 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 19:21:09,600 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 19:21:09,600 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,601 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c509ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09, skipping insertion in model container
[2025-03-03 19:21:09,601 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,614 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 19:21:09,701 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_fillercodesize_ps-cn-100_file-11.i[916,929]
[2025-03-03 19:21:09,792 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 19:21:09,805 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 19:21:09,813 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_fillercodesize_ps-cn-100_file-11.i[916,929]
[2025-03-03 19:21:09,866 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 19:21:09,882 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 19:21:09,883 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09 WrapperNode
[2025-03-03 19:21:09,883 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 19:21:09,884 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 19:21:09,884 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 19:21:09,884 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 19:21:09,889 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,898 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,917 INFO  L138                Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250
[2025-03-03 19:21:09,917 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 19:21:09,917 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 19:21:09,917 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 19:21:09,917 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 19:21:09,923 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,923 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,926 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,941 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-03 19:21:09,942 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,942 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,950 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,951 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,952 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,953 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,955 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 19:21:09,959 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 19:21:09,959 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 19:21:09,959 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 19:21:09,960 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (1/1) ...
[2025-03-03 19:21:09,963 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 19:21:09,976 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:21:09,986 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-03 19:21:09,990 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-03 19:21:10,005 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 19:21:10,005 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-03 19:21:10,005 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 19:21:10,005 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 19:21:10,005 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 19:21:10,005 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 19:21:10,071 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 19:21:10,072 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 19:21:10,707 INFO  L?                        ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2025-03-03 19:21:10,707 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 19:21:10,716 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 19:21:10,716 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 19:21:10,716 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:21:10 BoogieIcfgContainer
[2025-03-03 19:21:10,716 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 19:21:10,718 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 19:21:10,718 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 19:21:10,722 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 19:21:10,722 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:21:09" (1/3) ...
[2025-03-03 19:21:10,722 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac51ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:21:10, skipping insertion in model container
[2025-03-03 19:21:10,722 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:21:09" (2/3) ...
[2025-03-03 19:21:10,722 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac51ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:21:10, skipping insertion in model container
[2025-03-03 19:21:10,723 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:21:10" (3/3) ...
[2025-03-03 19:21:10,723 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-03-03 19:21:10,733 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 19:21:10,735 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 19:21:10,783 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 19:21:10,790 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;@18a20600, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 19:21:10,790 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 19:21:10,793 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 113 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 72 states have internal predecessors, (106), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-03-03 19:21:10,802 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-03-03 19:21:10,802 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:10,802 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:10,802 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:10,805 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:10,805 INFO  L85        PathProgramCache]: Analyzing trace with hash -47776823, now seen corresponding path program 1 times
[2025-03-03 19:21:10,812 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 19:21:10,812 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468915948]
[2025-03-03 19:21:10,813 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:10,813 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 19:21:10,813 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 19:21:10,815 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 19:21:10,817 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2025-03-03 19:21:10,885 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-03-03 19:21:11,122 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-03-03 19:21:11,123 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:11,123 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:11,135 INFO  L256         TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 19:21:11,144 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:21:11,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 944 proven. 0 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked.
[2025-03-03 19:21:11,186 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 19:21:11,187 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 19:21:11,187 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468915948]
[2025-03-03 19:21:11,187 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [468915948] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:21:11,187 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:21:11,187 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 19:21:11,188 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025675920]
[2025-03-03 19:21:11,188 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:21:11,191 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 19:21:11,191 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 19:21:11,206 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 19:21:11,207 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 19:21:11,208 INFO  L87              Difference]: Start difference. First operand  has 113 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 72 states have internal predecessors, (106), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand  has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39)
[2025-03-03 19:21:11,227 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:21:11,228 INFO  L93              Difference]: Finished difference Result 220 states and 402 transitions.
[2025-03-03 19:21:11,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 19:21:11,229 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 246
[2025-03-03 19:21:11,229 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:21:11,233 INFO  L225             Difference]: With dead ends: 220
[2025-03-03 19:21:11,233 INFO  L226             Difference]: Without dead ends: 110
[2025-03-03 19:21:11,235 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 245 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-03 19:21:11,237 INFO  L435           NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:21:11,237 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:21:11,245 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2025-03-03 19:21:11,261 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110.
[2025-03-03 19:21:11,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 110 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-03-03 19:21:11,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 177 transitions.
[2025-03-03 19:21:11,268 INFO  L78                 Accepts]: Start accepts. Automaton has 110 states and 177 transitions. Word has length 246
[2025-03-03 19:21:11,268 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:21:11,268 INFO  L471      AbstractCegarLoop]: Abstraction has 110 states and 177 transitions.
[2025-03-03 19:21:11,270 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39)
[2025-03-03 19:21:11,270 INFO  L276                IsEmpty]: Start isEmpty. Operand 110 states and 177 transitions.
[2025-03-03 19:21:11,273 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-03-03 19:21:11,273 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:11,273 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:11,285 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2025-03-03 19:21:11,473 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 19:21:11,474 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:11,474 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:11,474 INFO  L85        PathProgramCache]: Analyzing trace with hash 306781320, now seen corresponding path program 1 times
[2025-03-03 19:21:11,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 19:21:11,475 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473610265]
[2025-03-03 19:21:11,475 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:11,475 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 19:21:11,475 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 19:21:11,477 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 19:21:11,479 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2025-03-03 19:21:11,558 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-03-03 19:21:11,797 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-03-03 19:21:11,797 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:11,798 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:11,809 INFO  L256         TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 19:21:11,814 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:21:11,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:21:11,845 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 19:21:11,845 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 19:21:11,845 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473610265]
[2025-03-03 19:21:11,845 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473610265] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:21:11,845 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:21:11,845 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 19:21:11,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583925055]
[2025-03-03 19:21:11,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:21:11,846 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 19:21:11,846 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 19:21:11,847 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 19:21:11,847 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:21:11,847 INFO  L87              Difference]: Start difference. First operand 110 states and 177 transitions. Second operand  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:11,902 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:21:11,902 INFO  L93              Difference]: Finished difference Result 290 states and 469 transitions.
[2025-03-03 19:21:11,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 19:21:11,903 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246
[2025-03-03 19:21:11,904 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:21:11,907 INFO  L225             Difference]: With dead ends: 290
[2025-03-03 19:21:11,908 INFO  L226             Difference]: Without dead ends: 183
[2025-03-03 19:21:11,909 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 244 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-03 19:21:11,911 INFO  L435           NwaCegarLoop]: 271 mSDtfsCounter, 112 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:21:11,911 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 432 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:21:11,911 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2025-03-03 19:21:11,932 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180.
[2025-03-03 19:21:11,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 180 states, 116 states have (on average 1.4482758620689655) internal successors, (168), 117 states have internal predecessors, (168), 61 states have call successors, (61), 2 states have call predecessors, (61), 2 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61)
[2025-03-03 19:21:11,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions.
[2025-03-03 19:21:11,935 INFO  L78                 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 246
[2025-03-03 19:21:11,935 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:21:11,935 INFO  L471      AbstractCegarLoop]: Abstraction has 180 states and 290 transitions.
[2025-03-03 19:21:11,936 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:11,936 INFO  L276                IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions.
[2025-03-03 19:21:11,941 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-03-03 19:21:11,941 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:11,941 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:11,954 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2025-03-03 19:21:12,142 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 19:21:12,142 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:12,143 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:12,143 INFO  L85        PathProgramCache]: Analyzing trace with hash -1731274969, now seen corresponding path program 1 times
[2025-03-03 19:21:12,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 19:21:12,143 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506041251]
[2025-03-03 19:21:12,143 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:12,143 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 19:21:12,144 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 19:21:12,145 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 19:21:12,146 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2025-03-03 19:21:12,193 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-03-03 19:21:12,388 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-03-03 19:21:12,388 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:12,388 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:12,400 INFO  L256         TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-03 19:21:12,405 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:21:13,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:21:13,387 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 19:21:13,387 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 19:21:13,387 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506041251]
[2025-03-03 19:21:13,387 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [506041251] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:21:13,387 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:21:13,387 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 19:21:13,387 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756094940]
[2025-03-03 19:21:13,387 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:21:13,388 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 19:21:13,388 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 19:21:13,388 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 19:21:13,388 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:21:13,389 INFO  L87              Difference]: Start difference. First operand 180 states and 290 transitions. Second operand  has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:13,770 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:21:13,770 INFO  L93              Difference]: Finished difference Result 498 states and 807 transitions.
[2025-03-03 19:21:13,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:21:13,771 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246
[2025-03-03 19:21:13,772 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:21:13,775 INFO  L225             Difference]: With dead ends: 498
[2025-03-03 19:21:13,775 INFO  L226             Difference]: Without dead ends: 321
[2025-03-03 19:21:13,776 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 19:21:13,776 INFO  L435           NwaCegarLoop]: 173 mSDtfsCounter, 133 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 19:21:13,776 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 600 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 19:21:13,778 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 321 states.
[2025-03-03 19:21:13,826 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 287.
[2025-03-03 19:21:13,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 287 states, 183 states have (on average 1.459016393442623) internal successors, (267), 184 states have internal predecessors, (267), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100)
[2025-03-03 19:21:13,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 467 transitions.
[2025-03-03 19:21:13,832 INFO  L78                 Accepts]: Start accepts. Automaton has 287 states and 467 transitions. Word has length 246
[2025-03-03 19:21:13,833 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:21:13,833 INFO  L471      AbstractCegarLoop]: Abstraction has 287 states and 467 transitions.
[2025-03-03 19:21:13,834 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:13,834 INFO  L276                IsEmpty]: Start isEmpty. Operand 287 states and 467 transitions.
[2025-03-03 19:21:13,837 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 248
[2025-03-03 19:21:13,837 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:13,837 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:13,848 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2025-03-03 19:21:14,037 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 19:21:14,038 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:14,038 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:14,039 INFO  L85        PathProgramCache]: Analyzing trace with hash 91216731, now seen corresponding path program 1 times
[2025-03-03 19:21:14,039 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 19:21:14,039 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326527795]
[2025-03-03 19:21:14,039 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:14,039 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 19:21:14,039 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 19:21:14,042 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 19:21:14,043 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2025-03-03 19:21:14,094 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes.
[2025-03-03 19:21:14,302 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements.
[2025-03-03 19:21:14,302 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:14,302 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:14,314 INFO  L256         TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-03 19:21:14,319 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:21:14,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 464 proven. 105 refuted. 0 times theorem prover too weak. 2395 trivial. 0 not checked.
[2025-03-03 19:21:14,598 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 19:21:14,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked.
[2025-03-03 19:21:14,842 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 19:21:14,842 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326527795]
[2025-03-03 19:21:14,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326527795] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 19:21:14,842 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 19:21:14,842 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9
[2025-03-03 19:21:14,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001796939]
[2025-03-03 19:21:14,842 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 19:21:14,843 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 19:21:14,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 19:21:14,844 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 19:21:14,844 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-03-03 19:21:14,844 INFO  L87              Difference]: Start difference. First operand 287 states and 467 transitions. Second operand  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75)
[2025-03-03 19:21:15,216 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:21:15,217 INFO  L93              Difference]: Finished difference Result 488 states and 775 transitions.
[2025-03-03 19:21:15,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 19:21:15,219 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 247
[2025-03-03 19:21:15,220 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:21:15,222 INFO  L225             Difference]: With dead ends: 488
[2025-03-03 19:21:15,222 INFO  L226             Difference]: Without dead ends: 311
[2025-03-03 19:21:15,223 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240
[2025-03-03 19:21:15,223 INFO  L435           NwaCegarLoop]: 129 mSDtfsCounter, 319 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 19:21:15,223 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 308 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 19:21:15,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 311 states.
[2025-03-03 19:21:15,258 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299.
[2025-03-03 19:21:15,258 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 299 states, 192 states have (on average 1.4166666666666667) internal successors, (272), 193 states have internal predecessors, (272), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100)
[2025-03-03 19:21:15,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 472 transitions.
[2025-03-03 19:21:15,261 INFO  L78                 Accepts]: Start accepts. Automaton has 299 states and 472 transitions. Word has length 247
[2025-03-03 19:21:15,261 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:21:15,261 INFO  L471      AbstractCegarLoop]: Abstraction has 299 states and 472 transitions.
[2025-03-03 19:21:15,261 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75)
[2025-03-03 19:21:15,261 INFO  L276                IsEmpty]: Start isEmpty. Operand 299 states and 472 transitions.
[2025-03-03 19:21:15,263 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-03 19:21:15,263 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:15,263 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:15,275 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2025-03-03 19:21:15,464 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 19:21:15,464 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:15,465 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:15,465 INFO  L85        PathProgramCache]: Analyzing trace with hash -462028635, now seen corresponding path program 1 times
[2025-03-03 19:21:15,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 19:21:15,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544404255]
[2025-03-03 19:21:15,465 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:15,465 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 19:21:15,465 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 19:21:15,467 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 19:21:15,469 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2025-03-03 19:21:15,506 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-03 19:21:15,702 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-03 19:21:15,702 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:15,702 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:15,716 INFO  L256         TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 19:21:15,719 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:21:16,057 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-03 19:21:16,057 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 19:21:16,057 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 19:21:16,057 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544404255]
[2025-03-03 19:21:16,057 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [544404255] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:21:16,057 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:21:16,057 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 19:21:16,057 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714924533]
[2025-03-03 19:21:16,057 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:21:16,058 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 19:21:16,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 19:21:16,058 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 19:21:16,058 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 19:21:16,058 INFO  L87              Difference]: Start difference. First operand 299 states and 472 transitions. Second operand  has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:16,799 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:21:16,800 INFO  L93              Difference]: Finished difference Result 492 states and 773 transitions.
[2025-03-03 19:21:16,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 19:21:16,800 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248
[2025-03-03 19:21:16,801 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:21:16,803 INFO  L225             Difference]: With dead ends: 492
[2025-03-03 19:21:16,803 INFO  L226             Difference]: Without dead ends: 307
[2025-03-03 19:21:16,803 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 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-03 19:21:16,804 INFO  L435           NwaCegarLoop]: 299 mSDtfsCounter, 139 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 19:21:16,804 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 436 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 19:21:16,804 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 307 states.
[2025-03-03 19:21:16,825 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 299.
[2025-03-03 19:21:16,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 299 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 193 states have internal predecessors, (268), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100)
[2025-03-03 19:21:16,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 468 transitions.
[2025-03-03 19:21:16,827 INFO  L78                 Accepts]: Start accepts. Automaton has 299 states and 468 transitions. Word has length 248
[2025-03-03 19:21:16,828 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:21:16,828 INFO  L471      AbstractCegarLoop]: Abstraction has 299 states and 468 transitions.
[2025-03-03 19:21:16,828 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-03-03 19:21:16,828 INFO  L276                IsEmpty]: Start isEmpty. Operand 299 states and 468 transitions.
[2025-03-03 19:21:16,829 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-03-03 19:21:16,830 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:21:16,830 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:21:16,841 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2025-03-03 19:21:17,030 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 19:21:17,031 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:21:17,031 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:21:17,031 INFO  L85        PathProgramCache]: Analyzing trace with hash 1555818246, now seen corresponding path program 1 times
[2025-03-03 19:21:17,031 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 19:21:17,032 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523014411]
[2025-03-03 19:21:17,032 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:21:17,032 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 19:21:17,032 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 19:21:17,034 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 19:21:17,035 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2025-03-03 19:21:17,070 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-03-03 19:21:17,288 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-03-03 19:21:17,288 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:21:17,288 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:21:17,303 INFO  L256         TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-03-03 19:21:17,309 INFO  L279         TraceCheckSpWp]: Computing forward predicates...