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


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-4.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 1f54301a2d25df90ec2ca6a008bffd2d7169340bdd3fa7247718e0e85378bc7e
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 11:39:47,719 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 11:39:47,772 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 11:39:47,778 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 11:39:47,778 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 11:39:47,798 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 11:39:47,799 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 11:39:47,799 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 11:39:47,800 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 11:39:47,800 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 11:39:47,800 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 11:39:47,800 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 11:39:47,801 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 11:39:47,801 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 11:39:47,801 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 11:39:47,802 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 11:39:47,802 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 11:39:47,802 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 11:39:47,802 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 11:39:47,802 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 11:39:47,802 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 11:39:47,802 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 11:39:47,802 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 11:39:47,802 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 11:39:47,802 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 11:39:47,802 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 11:39:47,802 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 11:39:47,802 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 11:39:47,802 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 11:39:47,803 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 11:39:47,803 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 11:39:47,803 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 11:39:47,803 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 11:39:47,803 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 11:39:47,803 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 11:39:47,803 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 11:39:47,803 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 11:39:47,803 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 11:39:47,804 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 11:39:47,804 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 11:39:47,804 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 11:39:47,804 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 11:39:47,804 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 11:39:47,804 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 -> 1f54301a2d25df90ec2ca6a008bffd2d7169340bdd3fa7247718e0e85378bc7e
[2025-03-08 11:39:48,020 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 11:39:48,026 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 11:39:48,028 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 11:39:48,029 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 11:39:48,029 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 11:39:48,030 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-4.i
[2025-03-08 11:39:49,172 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e73055ef/89e79df2f555441b8fcf76eed368769d/FLAG0751eafcd
[2025-03-08 11:39:49,426 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 11:39:49,427 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-4.i
[2025-03-08 11:39:49,434 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e73055ef/89e79df2f555441b8fcf76eed368769d/FLAG0751eafcd
[2025-03-08 11:39:49,741 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e73055ef/89e79df2f555441b8fcf76eed368769d
[2025-03-08 11:39:49,744 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 11:39:49,746 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 11:39:49,747 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 11:39:49,747 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 11:39:49,750 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 11:39:49,751 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:39:49" (1/1) ...
[2025-03-08 11:39:49,751 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b209121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:49, skipping insertion in model container
[2025-03-08 11:39:49,751 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:39:49" (1/1) ...
[2025-03-08 11:39:49,770 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 11:39:49,871 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-4.i[918,931]
[2025-03-08 11:39:49,948 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 11:39:49,964 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 11:39:49,975 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-4.i[918,931]
[2025-03-08 11:39:50,006 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 11:39:50,018 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 11:39:50,019 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50 WrapperNode
[2025-03-08 11:39:50,020 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 11:39:50,021 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 11:39:50,021 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 11:39:50,021 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 11:39:50,026 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (1/1) ...
[2025-03-08 11:39:50,036 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (1/1) ...
[2025-03-08 11:39:50,060 INFO  L138                Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225
[2025-03-08 11:39:50,060 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 11:39:50,060 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 11:39:50,061 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 11:39:50,061 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 11:39:50,066 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (1/1) ...
[2025-03-08 11:39:50,066 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (1/1) ...
[2025-03-08 11:39:50,070 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (1/1) ...
[2025-03-08 11:39:50,088 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 11:39:50,088 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (1/1) ...
[2025-03-08 11:39:50,088 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (1/1) ...
[2025-03-08 11:39:50,094 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (1/1) ...
[2025-03-08 11:39:50,095 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (1/1) ...
[2025-03-08 11:39:50,096 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (1/1) ...
[2025-03-08 11:39:50,097 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (1/1) ...
[2025-03-08 11:39:50,099 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 11:39:50,100 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 11:39:50,100 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 11:39:50,100 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 11:39:50,101 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (1/1) ...
[2025-03-08 11:39:50,104 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 11:39:50,115 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:39:50,126 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 11:39:50,128 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 11:39:50,148 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 11:39:50,148 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 11:39:50,148 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 11:39:50,148 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 11:39:50,148 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 11:39:50,148 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 11:39:50,212 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 11:39:50,213 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 11:39:50,578 INFO  L?                        ?]: Removed 20 outVars from TransFormulas that were not future-live.
[2025-03-08 11:39:50,579 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 11:39:50,596 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 11:39:50,598 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 11:39:50,598 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:39:50 BoogieIcfgContainer
[2025-03-08 11:39:50,599 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 11:39:50,601 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 11:39:50,601 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 11:39:50,604 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 11:39:50,604 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:39:49" (1/3) ...
[2025-03-08 11:39:50,605 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68059ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:39:50, skipping insertion in model container
[2025-03-08 11:39:50,605 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:39:50" (2/3) ...
[2025-03-08 11:39:50,605 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68059ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:39:50, skipping insertion in model container
[2025-03-08 11:39:50,606 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:39:50" (3/3) ...
[2025-03-08 11:39:50,607 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-4.i
[2025-03-08 11:39:50,617 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 11:39:50,620 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-4.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 11:39:50,667 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 11:39:50,677 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;@abd44bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 11:39:50,677 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 11:39:50,681 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 99 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2025-03-08 11:39:50,692 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2025-03-08 11:39:50,692 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:39:50,693 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:39:50,693 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:39:50,698 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:39:50,699 INFO  L85        PathProgramCache]: Analyzing trace with hash 553649523, now seen corresponding path program 1 times
[2025-03-08 11:39:50,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:39:50,705 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996232935]
[2025-03-08 11:39:50,705 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:39:50,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:39:50,784 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.
[2025-03-08 11:39:50,805 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements.
[2025-03-08 11:39:50,805 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:39:50,805 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:39:50,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked.
[2025-03-08 11:39:50,990 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:39:50,990 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996232935]
[2025-03-08 11:39:50,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996232935] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 11:39:50,991 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565902081]
[2025-03-08 11:39:50,991 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:39:50,991 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 11:39:50,991 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:39:50,996 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 11:39:51,011 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 11:39:51,084 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.
[2025-03-08 11:39:51,159 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements.
[2025-03-08 11:39:51,159 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:39:51,159 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:39:51,163 INFO  L256         TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 11:39:51,171 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 11:39:51,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked.
[2025-03-08 11:39:51,196 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 11:39:51,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [565902081] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:39:51,196 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 11:39:51,196 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 11:39:51,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236733392]
[2025-03-08 11:39:51,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:39:51,203 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 11:39:51,203 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:39:51,217 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 11:39:51,218 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 11:39:51,219 INFO  L87              Difference]: Start difference. First operand  has 99 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand  has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33)
[2025-03-08 11:39:51,242 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:39:51,242 INFO  L93              Difference]: Finished difference Result 192 states and 344 transitions.
[2025-03-08 11:39:51,243 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 11:39:51,244 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 209
[2025-03-08 11:39:51,244 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:39:51,251 INFO  L225             Difference]: With dead ends: 192
[2025-03-08 11:39:51,251 INFO  L226             Difference]: Without dead ends: 96
[2025-03-08 11:39:51,256 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 11:39:51,258 INFO  L435           NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:39:51,259 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:39:51,267 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-03-08 11:39:51,283 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2025-03-08 11:39:51,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 61 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2025-03-08 11:39:51,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 152 transitions.
[2025-03-08 11:39:51,291 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 152 transitions. Word has length 209
[2025-03-08 11:39:51,291 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:39:51,291 INFO  L471      AbstractCegarLoop]: Abstraction has 96 states and 152 transitions.
[2025-03-08 11:39:51,292 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33)
[2025-03-08 11:39:51,292 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 152 transitions.
[2025-03-08 11:39:51,294 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 211
[2025-03-08 11:39:51,294 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:39:51,294 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:39:51,302 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 11:39:51,495 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 11:39:51,495 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:39:51,496 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:39:51,496 INFO  L85        PathProgramCache]: Analyzing trace with hash 1430470635, now seen corresponding path program 1 times
[2025-03-08 11:39:51,496 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:39:51,496 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197323858]
[2025-03-08 11:39:51,496 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:39:51,497 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:39:51,515 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-03-08 11:39:51,560 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-03-08 11:39:51,561 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:39:51,561 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:39:51,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:39:51,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:39:51,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197323858]
[2025-03-08 11:39:51,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197323858] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:39:51,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:39:51,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:39:51,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822087407]
[2025-03-08 11:39:51,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:39:51,823 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:39:51,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:39:51,824 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:39:51,824 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:39:51,824 INFO  L87              Difference]: Start difference. First operand 96 states and 152 transitions. Second operand  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:39:51,892 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:39:51,892 INFO  L93              Difference]: Finished difference Result 282 states and 450 transitions.
[2025-03-08 11:39:51,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:39:51,894 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210
[2025-03-08 11:39:51,895 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:39:51,896 INFO  L225             Difference]: With dead ends: 282
[2025-03-08 11:39:51,896 INFO  L226             Difference]: Without dead ends: 189
[2025-03-08 11:39:51,897 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-08 11:39:51,897 INFO  L435           NwaCegarLoop]: 157 mSDtfsCounter, 78 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:39:51,897 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 293 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:39:51,901 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 189 states.
[2025-03-08 11:39:51,923 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186.
[2025-03-08 11:39:51,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 186 states, 117 states have (on average 1.4102564102564104) internal successors, (165), 117 states have internal predecessors, (165), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2025-03-08 11:39:51,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 297 transitions.
[2025-03-08 11:39:51,926 INFO  L78                 Accepts]: Start accepts. Automaton has 186 states and 297 transitions. Word has length 210
[2025-03-08 11:39:51,926 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:39:51,926 INFO  L471      AbstractCegarLoop]: Abstraction has 186 states and 297 transitions.
[2025-03-08 11:39:51,926 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:39:51,927 INFO  L276                IsEmpty]: Start isEmpty. Operand 186 states and 297 transitions.
[2025-03-08 11:39:51,928 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2025-03-08 11:39:51,928 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:39:51,928 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:39:51,929 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 11:39:51,929 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:39:51,929 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:39:51,929 INFO  L85        PathProgramCache]: Analyzing trace with hash 1542849332, now seen corresponding path program 1 times
[2025-03-08 11:39:51,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:39:51,930 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640714723]
[2025-03-08 11:39:51,930 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:39:51,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:39:51,944 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes.
[2025-03-08 11:39:51,968 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements.
[2025-03-08 11:39:51,968 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:39:51,968 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:39:52,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:39:52,063 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:39:52,063 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640714723]
[2025-03-08 11:39:52,063 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640714723] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:39:52,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:39:52,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:39:52,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876294847]
[2025-03-08 11:39:52,064 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:39:52,065 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:39:52,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:39:52,065 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:39:52,066 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:39:52,066 INFO  L87              Difference]: Start difference. First operand 186 states and 297 transitions. Second operand  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:39:52,113 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:39:52,114 INFO  L93              Difference]: Finished difference Result 451 states and 715 transitions.
[2025-03-08 11:39:52,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:39:52,115 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211
[2025-03-08 11:39:52,115 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:39:52,117 INFO  L225             Difference]: With dead ends: 451
[2025-03-08 11:39:52,117 INFO  L226             Difference]: Without dead ends: 268
[2025-03-08 11:39:52,118 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-08 11:39:52,119 INFO  L435           NwaCegarLoop]: 147 mSDtfsCounter, 56 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:39:52,119 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 285 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:39:52,119 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 268 states.
[2025-03-08 11:39:52,148 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264.
[2025-03-08 11:39:52,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 264 states, 189 states have (on average 1.4497354497354498) internal successors, (274), 191 states have internal predecessors, (274), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70)
[2025-03-08 11:39:52,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 414 transitions.
[2025-03-08 11:39:52,152 INFO  L78                 Accepts]: Start accepts. Automaton has 264 states and 414 transitions. Word has length 211
[2025-03-08 11:39:52,153 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:39:52,153 INFO  L471      AbstractCegarLoop]: Abstraction has 264 states and 414 transitions.
[2025-03-08 11:39:52,154 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:39:52,154 INFO  L276                IsEmpty]: Start isEmpty. Operand 264 states and 414 transitions.
[2025-03-08 11:39:52,156 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2025-03-08 11:39:52,156 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:39:52,157 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:39:52,157 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 11:39:52,157 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:39:52,158 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:39:52,158 INFO  L85        PathProgramCache]: Analyzing trace with hash -1580254482, now seen corresponding path program 1 times
[2025-03-08 11:39:52,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:39:52,158 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449294777]
[2025-03-08 11:39:52,158 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:39:52,158 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:39:52,174 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes.
[2025-03-08 11:39:52,284 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements.
[2025-03-08 11:39:52,284 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:39:52,284 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:39:53,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:39:53,018 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:39:53,018 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449294777]
[2025-03-08 11:39:53,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449294777] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:39:53,018 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:39:53,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 11:39:53,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892540860]
[2025-03-08 11:39:53,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:39:53,019 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 11:39:53,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:39:53,020 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 11:39:53,020 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 11:39:53,021 INFO  L87              Difference]: Start difference. First operand 264 states and 414 transitions. Second operand  has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:39:53,311 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:39:53,311 INFO  L93              Difference]: Finished difference Result 971 states and 1519 transitions.
[2025-03-08 11:39:53,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 11:39:53,313 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211
[2025-03-08 11:39:53,313 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:39:53,320 INFO  L225             Difference]: With dead ends: 971
[2025-03-08 11:39:53,320 INFO  L226             Difference]: Without dead ends: 710
[2025-03-08 11:39:53,321 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 11:39:53,322 INFO  L435           NwaCegarLoop]: 240 mSDtfsCounter, 319 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 11:39:53,323 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 609 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 11:39:53,324 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 710 states.
[2025-03-08 11:39:53,374 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 543.
[2025-03-08 11:39:53,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 543 states, 394 states have (on average 1.4365482233502538) internal successors, (566), 398 states have internal predecessors, (566), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140)
[2025-03-08 11:39:53,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 846 transitions.
[2025-03-08 11:39:53,378 INFO  L78                 Accepts]: Start accepts. Automaton has 543 states and 846 transitions. Word has length 211
[2025-03-08 11:39:53,379 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:39:53,379 INFO  L471      AbstractCegarLoop]: Abstraction has 543 states and 846 transitions.
[2025-03-08 11:39:53,379 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:39:53,379 INFO  L276                IsEmpty]: Start isEmpty. Operand 543 states and 846 transitions.
[2025-03-08 11:39:53,381 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2025-03-08 11:39:53,381 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:39:53,381 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:39:53,382 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 11:39:53,382 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:39:53,382 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:39:53,382 INFO  L85        PathProgramCache]: Analyzing trace with hash -72702673, now seen corresponding path program 1 times
[2025-03-08 11:39:53,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:39:53,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033169880]
[2025-03-08 11:39:53,383 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:39:53,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:39:53,394 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes.
[2025-03-08 11:39:53,550 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements.
[2025-03-08 11:39:53,551 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:39:53,551 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:39:57,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:39:57,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:39:57,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033169880]
[2025-03-08 11:39:57,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033169880] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:39:57,820 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:39:57,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 11:39:57,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168930850]
[2025-03-08 11:39:57,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:39:57,821 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 11:39:57,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:39:57,821 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 11:39:57,822 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-08 11:39:57,822 INFO  L87              Difference]: Start difference. First operand 543 states and 846 transitions. Second operand  has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:39:58,975 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:39:58,976 INFO  L93              Difference]: Finished difference Result 821 states and 1265 transitions.
[2025-03-08 11:39:58,976 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 11:39:58,977 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211
[2025-03-08 11:39:58,977 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:39:58,981 INFO  L225             Difference]: With dead ends: 821
[2025-03-08 11:39:58,981 INFO  L226             Difference]: Without dead ends: 819
[2025-03-08 11:39:58,982 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110
[2025-03-08 11:39:58,982 INFO  L435           NwaCegarLoop]: 120 mSDtfsCounter, 175 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 11:39:58,982 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 769 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 11:39:58,983 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 819 states.
[2025-03-08 11:39:59,030 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 597.
[2025-03-08 11:39:59,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 597 states, 448 states have (on average 1.4486607142857142) internal successors, (649), 452 states have internal predecessors, (649), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140)
[2025-03-08 11:39:59,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 929 transitions.
[2025-03-08 11:39:59,035 INFO  L78                 Accepts]: Start accepts. Automaton has 597 states and 929 transitions. Word has length 211
[2025-03-08 11:39:59,037 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:39:59,037 INFO  L471      AbstractCegarLoop]: Abstraction has 597 states and 929 transitions.
[2025-03-08 11:39:59,037 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:39:59,037 INFO  L276                IsEmpty]: Start isEmpty. Operand 597 states and 929 transitions.
[2025-03-08 11:39:59,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2025-03-08 11:39:59,040 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:39:59,040 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:39:59,040 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 11:39:59,040 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:39:59,041 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:39:59,043 INFO  L85        PathProgramCache]: Analyzing trace with hash -2110758962, now seen corresponding path program 1 times
[2025-03-08 11:39:59,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:39:59,043 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718896872]
[2025-03-08 11:39:59,043 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:39:59,043 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:39:59,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes.
[2025-03-08 11:39:59,082 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements.
[2025-03-08 11:39:59,082 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:39:59,082 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:39:59,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:39:59,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:39:59,253 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718896872]
[2025-03-08 11:39:59,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718896872] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:39:59,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:39:59,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:39:59,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221612462]
[2025-03-08 11:39:59,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:39:59,254 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:39:59,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:39:59,254 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:39:59,255 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:39:59,255 INFO  L87              Difference]: Start difference. First operand 597 states and 929 transitions. Second operand  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:39:59,365 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:39:59,365 INFO  L93              Difference]: Finished difference Result 1707 states and 2660 transitions.
[2025-03-08 11:39:59,366 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:39:59,367 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211
[2025-03-08 11:39:59,367 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:39:59,376 INFO  L225             Difference]: With dead ends: 1707
[2025-03-08 11:39:59,376 INFO  L226             Difference]: Without dead ends: 1113
[2025-03-08 11:39:59,378 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:39:59,379 INFO  L435           NwaCegarLoop]: 185 mSDtfsCounter, 89 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:39:59,380 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 312 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:39:59,382 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1113 states.
[2025-03-08 11:39:59,474 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1111.
[2025-03-08 11:39:59,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1111 states, 814 states have (on average 1.4115479115479115) internal successors, (1149), 822 states have internal predecessors, (1149), 280 states have call successors, (280), 16 states have call predecessors, (280), 16 states have return successors, (280), 272 states have call predecessors, (280), 280 states have call successors, (280)
[2025-03-08 11:39:59,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1709 transitions.
[2025-03-08 11:39:59,482 INFO  L78                 Accepts]: Start accepts. Automaton has 1111 states and 1709 transitions. Word has length 211
[2025-03-08 11:39:59,483 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:39:59,483 INFO  L471      AbstractCegarLoop]: Abstraction has 1111 states and 1709 transitions.
[2025-03-08 11:39:59,483 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:39:59,483 INFO  L276                IsEmpty]: Start isEmpty. Operand 1111 states and 1709 transitions.
[2025-03-08 11:39:59,485 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 11:39:59,485 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:39:59,485 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:39:59,485 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 11:39:59,485 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:39:59,486 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:39:59,486 INFO  L85        PathProgramCache]: Analyzing trace with hash 869750345, now seen corresponding path program 1 times
[2025-03-08 11:39:59,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:39:59,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331084382]
[2025-03-08 11:39:59,486 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:39:59,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:39:59,496 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 11:39:59,505 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 11:39:59,505 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:39:59,505 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:39:59,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:39:59,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:39:59,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331084382]
[2025-03-08 11:39:59,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331084382] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:39:59,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:39:59,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:39:59,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147588618]
[2025-03-08 11:39:59,551 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:39:59,551 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:39:59,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:39:59,551 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:39:59,551 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:39:59,552 INFO  L87              Difference]: Start difference. First operand 1111 states and 1709 transitions. Second operand  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:39:59,617 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:39:59,617 INFO  L93              Difference]: Finished difference Result 2261 states and 3448 transitions.
[2025-03-08 11:39:59,618 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:39:59,618 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212
[2025-03-08 11:39:59,619 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:39:59,624 INFO  L225             Difference]: With dead ends: 2261
[2025-03-08 11:39:59,625 INFO  L226             Difference]: Without dead ends: 1153
[2025-03-08 11:39:59,627 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-08 11:39:59,628 INFO  L435           NwaCegarLoop]: 204 mSDtfsCounter, 54 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:39:59,628 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 338 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:39:59,630 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1153 states.
[2025-03-08 11:39:59,721 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 937.
[2025-03-08 11:39:59,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 937 states, 656 states have (on average 1.3643292682926829) internal successors, (895), 656 states have internal predecessors, (895), 264 states have call successors, (264), 16 states have call predecessors, (264), 16 states have return successors, (264), 264 states have call predecessors, (264), 264 states have call successors, (264)
[2025-03-08 11:39:59,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1423 transitions.
[2025-03-08 11:39:59,731 INFO  L78                 Accepts]: Start accepts. Automaton has 937 states and 1423 transitions. Word has length 212
[2025-03-08 11:39:59,731 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:39:59,731 INFO  L471      AbstractCegarLoop]: Abstraction has 937 states and 1423 transitions.
[2025-03-08 11:39:59,731 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:39:59,731 INFO  L276                IsEmpty]: Start isEmpty. Operand 937 states and 1423 transitions.
[2025-03-08 11:39:59,733 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 11:39:59,734 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:39:59,734 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:39:59,734 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 11:39:59,734 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:39:59,735 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:39:59,735 INFO  L85        PathProgramCache]: Analyzing trace with hash 1053853093, now seen corresponding path program 1 times
[2025-03-08 11:39:59,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:39:59,735 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487401224]
[2025-03-08 11:39:59,735 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:39:59,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:39:59,746 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 11:39:59,788 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 11:39:59,789 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:39:59,789 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:39:59,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:39:59,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:39:59,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487401224]
[2025-03-08 11:39:59,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487401224] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:39:59,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:39:59,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 11:39:59,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519936077]
[2025-03-08 11:39:59,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:39:59,935 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 11:39:59,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:39:59,936 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 11:39:59,936 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:39:59,936 INFO  L87              Difference]: Start difference. First operand 937 states and 1423 transitions. Second operand  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:40:00,202 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:40:00,202 INFO  L93              Difference]: Finished difference Result 1875 states and 2867 transitions.
[2025-03-08 11:40:00,203 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 11:40:00,203 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212
[2025-03-08 11:40:00,203 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:40:00,210 INFO  L225             Difference]: With dead ends: 1875
[2025-03-08 11:40:00,210 INFO  L226             Difference]: Without dead ends: 1371
[2025-03-08 11:40:00,212 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-08 11:40:00,213 INFO  L435           NwaCegarLoop]: 232 mSDtfsCounter, 220 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 11:40:00,213 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 514 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 11:40:00,214 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1371 states.
[2025-03-08 11:40:00,287 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1320.
[2025-03-08 11:40:00,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1320 states, 899 states have (on average 1.347052280311457) internal successors, (1211), 899 states have internal predecessors, (1211), 396 states have call successors, (396), 24 states have call predecessors, (396), 24 states have return successors, (396), 396 states have call predecessors, (396), 396 states have call successors, (396)
[2025-03-08 11:40:00,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2003 transitions.
[2025-03-08 11:40:00,299 INFO  L78                 Accepts]: Start accepts. Automaton has 1320 states and 2003 transitions. Word has length 212
[2025-03-08 11:40:00,299 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:40:00,299 INFO  L471      AbstractCegarLoop]: Abstraction has 1320 states and 2003 transitions.
[2025-03-08 11:40:00,300 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:40:00,300 INFO  L276                IsEmpty]: Start isEmpty. Operand 1320 states and 2003 transitions.
[2025-03-08 11:40:00,302 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 11:40:00,302 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:40:00,303 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:40:00,303 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 11:40:00,303 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:40:00,304 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:40:00,305 INFO  L85        PathProgramCache]: Analyzing trace with hash 209381222, now seen corresponding path program 1 times
[2025-03-08 11:40:00,305 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:40:00,305 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972984361]
[2025-03-08 11:40:00,305 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:40:00,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:40:00,315 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 11:40:00,441 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 11:40:00,441 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:40:00,441 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:40:01,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked.
[2025-03-08 11:40:01,089 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:40:01,089 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972984361]
[2025-03-08 11:40:01,089 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972984361] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 11:40:01,089 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937803710]
[2025-03-08 11:40:01,089 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:40:01,089 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 11:40:01,089 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:40:01,091 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-08 11:40:01,092 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-08 11:40:01,139 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 11:40:01,258 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 11:40:01,258 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:40:01,258 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:40:01,261 INFO  L256         TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 54 conjuncts are in the unsatisfiable core
[2025-03-08 11:40:01,269 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 11:40:04,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 1256 proven. 405 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked.
[2025-03-08 11:40:04,246 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 11:40:30,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937803710] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 11:40:30,013 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 11:40:30,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 22] total 31
[2025-03-08 11:40:30,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480930636]
[2025-03-08 11:40:30,013 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 11:40:30,013 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2025-03-08 11:40:30,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:40:30,014 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2025-03-08 11:40:30,016 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=1567, Unknown=1, NotChecked=0, Total=2070
[2025-03-08 11:40:30,016 INFO  L87              Difference]: Start difference. First operand 1320 states and 2003 transitions. Second operand  has 31 states, 31 states have (on average 3.6129032258064515) internal successors, (112), 29 states have internal predecessors, (112), 9 states have call successors, (66), 8 states have call predecessors, (66), 12 states have return successors, (66), 9 states have call predecessors, (66), 9 states have call successors, (66)
[2025-03-08 11:40:37,175 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:40:37,176 INFO  L93              Difference]: Finished difference Result 3925 states and 5728 transitions.
[2025-03-08 11:40:37,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. 
[2025-03-08 11:40:37,180 INFO  L78                 Accepts]: Start accepts. Automaton has  has 31 states, 31 states have (on average 3.6129032258064515) internal successors, (112), 29 states have internal predecessors, (112), 9 states have call successors, (66), 8 states have call predecessors, (66), 12 states have return successors, (66), 9 states have call predecessors, (66), 9 states have call successors, (66) Word has length 212
[2025-03-08 11:40:37,181 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:40:37,195 INFO  L225             Difference]: With dead ends: 3925
[2025-03-08 11:40:37,195 INFO  L226             Difference]: Without dead ends: 2608
[2025-03-08 11:40:37,203 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5320 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=3530, Invalid=13239, Unknown=1, NotChecked=0, Total=16770
[2025-03-08 11:40:37,204 INFO  L435           NwaCegarLoop]: 146 mSDtfsCounter, 932 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2025-03-08 11:40:37,204 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 1564 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 2506 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2025-03-08 11:40:37,206 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2608 states.
[2025-03-08 11:40:37,392 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2288.
[2025-03-08 11:40:37,396 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2288 states, 1571 states have (on average 1.3049013367281985) internal successors, (2050), 1575 states have internal predecessors, (2050), 624 states have call successors, (624), 92 states have call predecessors, (624), 92 states have return successors, (624), 620 states have call predecessors, (624), 624 states have call successors, (624)
[2025-03-08 11:40:37,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 3298 transitions.
[2025-03-08 11:40:37,407 INFO  L78                 Accepts]: Start accepts. Automaton has 2288 states and 3298 transitions. Word has length 212
[2025-03-08 11:40:37,408 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:40:37,408 INFO  L471      AbstractCegarLoop]: Abstraction has 2288 states and 3298 transitions.
[2025-03-08 11:40:37,408 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 3.6129032258064515) internal successors, (112), 29 states have internal predecessors, (112), 9 states have call successors, (66), 8 states have call predecessors, (66), 12 states have return successors, (66), 9 states have call predecessors, (66), 9 states have call successors, (66)
[2025-03-08 11:40:37,409 INFO  L276                IsEmpty]: Start isEmpty. Operand 2288 states and 3298 transitions.
[2025-03-08 11:40:37,410 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 11:40:37,411 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:40:37,411 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:40:37,421 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-08 11:40:37,611 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2025-03-08 11:40:37,612 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:40:37,612 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:40:37,612 INFO  L85        PathProgramCache]: Analyzing trace with hash -337204637, now seen corresponding path program 1 times
[2025-03-08 11:40:37,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:40:37,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831097021]
[2025-03-08 11:40:37,612 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:40:37,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:40:37,627 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 11:40:37,697 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 11:40:37,698 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:40:37,698 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:40:37,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked.
[2025-03-08 11:40:37,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:40:37,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831097021]
[2025-03-08 11:40:37,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831097021] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 11:40:37,960 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17472850]
[2025-03-08 11:40:37,960 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:40:37,960 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 11:40:37,960 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:40:37,965 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 11:40:37,967 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-08 11:40:38,015 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 11:40:38,063 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 11:40:38,063 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:40:38,063 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:40:38,065 INFO  L256         TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-03-08 11:40:38,069 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 11:40:38,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 158 proven. 93 refuted. 0 times theorem prover too weak. 1861 trivial. 0 not checked.
[2025-03-08 11:40:38,460 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 11:40:38,672 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked.
[2025-03-08 11:40:38,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [17472850] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 11:40:38,672 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 11:40:38,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11
[2025-03-08 11:40:38,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717468991]
[2025-03-08 11:40:38,672 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 11:40:38,673 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-08 11:40:38,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:40:38,673 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-08 11:40:38,673 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-03-08 11:40:38,673 INFO  L87              Difference]: Start difference. First operand 2288 states and 3298 transitions. Second operand  has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65)
[2025-03-08 11:40:39,328 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:40:39,329 INFO  L93              Difference]: Finished difference Result 5083 states and 7278 transitions.
[2025-03-08 11:40:39,330 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-03-08 11:40:39,331 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 212
[2025-03-08 11:40:39,331 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:40:39,343 INFO  L225             Difference]: With dead ends: 5083
[2025-03-08 11:40:39,344 INFO  L226             Difference]: Without dead ends: 2798
[2025-03-08 11:40:39,349 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462
[2025-03-08 11:40:39,350 INFO  L435           NwaCegarLoop]: 174 mSDtfsCounter, 269 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 11:40:39,350 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 742 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 11:40:39,352 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2798 states.
[2025-03-08 11:40:39,536 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2299.
[2025-03-08 11:40:39,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2299 states, 1582 states have (on average 1.3040455120101138) internal successors, (2063), 1586 states have internal predecessors, (2063), 624 states have call successors, (624), 92 states have call predecessors, (624), 92 states have return successors, (624), 620 states have call predecessors, (624), 624 states have call successors, (624)
[2025-03-08 11:40:39,547 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 3311 transitions.
[2025-03-08 11:40:39,551 INFO  L78                 Accepts]: Start accepts. Automaton has 2299 states and 3311 transitions. Word has length 212
[2025-03-08 11:40:39,552 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:40:39,552 INFO  L471      AbstractCegarLoop]: Abstraction has 2299 states and 3311 transitions.
[2025-03-08 11:40:39,552 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65)
[2025-03-08 11:40:39,553 INFO  L276                IsEmpty]: Start isEmpty. Operand 2299 states and 3311 transitions.
[2025-03-08 11:40:39,555 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 11:40:39,555 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:40:39,555 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:40:39,563 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-08 11:40:39,759 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 11:40:39,760 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:40:39,760 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:40:39,760 INFO  L85        PathProgramCache]: Analyzing trace with hash 1170347172, now seen corresponding path program 1 times
[2025-03-08 11:40:39,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:40:39,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686402780]
[2025-03-08 11:40:39,761 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:40:39,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:40:39,771 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 11:40:39,782 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 11:40:39,782 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:40:39,782 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:40:39,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:40:39,879 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:40:39,879 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686402780]
[2025-03-08 11:40:39,879 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686402780] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:40:39,879 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:40:39,879 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:40:39,879 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674346345]
[2025-03-08 11:40:39,879 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:40:39,879 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:40:39,879 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:40:39,880 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:40:39,880 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:40:39,880 INFO  L87              Difference]: Start difference. First operand 2299 states and 3311 transitions. Second operand  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:40:39,999 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:40:40,000 INFO  L93              Difference]: Finished difference Result 4310 states and 6255 transitions.
[2025-03-08 11:40:40,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:40:40,001 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212
[2025-03-08 11:40:40,001 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:40:40,014 INFO  L225             Difference]: With dead ends: 4310
[2025-03-08 11:40:40,014 INFO  L226             Difference]: Without dead ends: 1955
[2025-03-08 11:40:40,020 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:40:40,021 INFO  L435           NwaCegarLoop]: 192 mSDtfsCounter, 143 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:40:40,021 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:40:40,023 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1955 states.
[2025-03-08 11:40:40,168 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1949.
[2025-03-08 11:40:40,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1949 states, 1339 states have (on average 1.313666915608663) internal successors, (1759), 1341 states have internal predecessors, (1759), 543 states have call successors, (543), 66 states have call predecessors, (543), 66 states have return successors, (543), 541 states have call predecessors, (543), 543 states have call successors, (543)
[2025-03-08 11:40:40,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2845 transitions.
[2025-03-08 11:40:40,180 INFO  L78                 Accepts]: Start accepts. Automaton has 1949 states and 2845 transitions. Word has length 212
[2025-03-08 11:40:40,180 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:40:40,180 INFO  L471      AbstractCegarLoop]: Abstraction has 1949 states and 2845 transitions.
[2025-03-08 11:40:40,180 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:40:40,181 INFO  L276                IsEmpty]: Start isEmpty. Operand 1949 states and 2845 transitions.
[2025-03-08 11:40:40,182 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-03-08 11:40:40,182 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:40:40,182 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:40:40,182 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 11:40:40,183 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:40:40,183 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:40:40,183 INFO  L85        PathProgramCache]: Analyzing trace with hash 611663955, now seen corresponding path program 1 times
[2025-03-08 11:40:40,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:40:40,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99660569]
[2025-03-08 11:40:40,183 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:40:40,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:40:40,192 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-08 11:40:40,275 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-08 11:40:40,275 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:40:40,275 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:40:50,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 11:40:50,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:40:50,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99660569]
[2025-03-08 11:40:50,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99660569] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:40:50,877 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:40:50,877 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-08 11:40:50,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645185207]
[2025-03-08 11:40:50,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:40:50,877 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 11:40:50,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:40:50,878 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 11:40:50,878 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2025-03-08 11:40:50,878 INFO  L87              Difference]: Start difference. First operand 1949 states and 2845 transitions. Second operand  has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 11:40:58,661 WARN  L286               SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 60 DAG size of output: 58 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2025-03-08 11:41:12,791 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []