./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-5.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_fillercodesize_ps-cn-250_file-5.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 21bdbc3e0ac2e83aebdf4ed5d685b5451eeeab46fc8ce4a523557df5ff3c8a1c
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 10:59:04,677 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 10:59:04,723 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 10:59:04,727 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 10:59:04,731 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 10:59:04,747 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 10:59:04,748 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 10:59:04,748 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 10:59:04,748 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 10:59:04,748 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 10:59:04,749 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 10:59:04,749 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 10:59:04,749 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 10:59:04,749 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 10:59:04,749 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 10:59:04,749 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 10:59:04,749 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 10:59:04,749 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 10:59:04,749 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 10:59:04,750 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 10:59:04,750 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 10:59:04,750 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 10:59:04,750 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 10:59:04,750 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 10:59:04,750 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 10:59:04,750 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 10:59:04,750 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 10:59:04,750 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 10:59:04,750 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 10:59:04,750 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 10:59:04,751 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 10:59:04,751 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 10:59:04,751 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 10:59:04,751 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 10:59:04,751 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 10:59:04,751 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 10:59:04,751 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 10:59:04,751 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 10:59:04,751 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 10:59:04,751 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 10:59:04,752 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 10:59:04,752 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 10:59:04,752 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 10:59:04,752 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 -> 21bdbc3e0ac2e83aebdf4ed5d685b5451eeeab46fc8ce4a523557df5ff3c8a1c
[2025-03-08 10:59:04,983 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 10:59:04,991 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 10:59:04,994 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 10:59:04,994 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 10:59:04,995 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 10:59:04,996 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-5.i
[2025-03-08 10:59:06,157 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abae36e05/ed90264d5b2a43009873aeb8be67dd89/FLAG7abcce3ab
[2025-03-08 10:59:06,368 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 10:59:06,369 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-5.i
[2025-03-08 10:59:06,377 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abae36e05/ed90264d5b2a43009873aeb8be67dd89/FLAG7abcce3ab
[2025-03-08 10:59:06,388 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abae36e05/ed90264d5b2a43009873aeb8be67dd89
[2025-03-08 10:59:06,390 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 10:59:06,391 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 10:59:06,391 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 10:59:06,391 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 10:59:06,395 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 10:59:06,396 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,397 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55956521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06, skipping insertion in model container
[2025-03-08 10:59:06,398 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,422 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 10:59:06,523 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-5.i[915,928]
[2025-03-08 10:59:06,618 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 10:59:06,629 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 10:59:06,637 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-5.i[915,928]
[2025-03-08 10:59:06,689 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 10:59:06,702 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 10:59:06,702 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06 WrapperNode
[2025-03-08 10:59:06,702 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 10:59:06,703 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 10:59:06,703 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 10:59:06,703 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 10:59:06,707 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,717 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,751 INFO  L138                Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 490
[2025-03-08 10:59:06,751 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 10:59:06,752 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 10:59:06,752 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 10:59:06,752 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 10:59:06,759 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,759 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,768 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,797 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 10:59:06,801 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,801 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,813 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,819 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,827 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,830 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,838 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 10:59:06,839 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 10:59:06,839 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 10:59:06,839 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 10:59:06,841 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (1/1) ...
[2025-03-08 10:59:06,845 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 10:59:06,855 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 10:59:06,866 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 10:59:06,868 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 10:59:06,886 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 10:59:06,886 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 10:59:06,887 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 10:59:06,887 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 10:59:06,887 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 10:59:06,887 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 10:59:06,966 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 10:59:06,967 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 10:59:07,745 INFO  L?                        ?]: Removed 19 outVars from TransFormulas that were not future-live.
[2025-03-08 10:59:07,745 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 10:59:07,777 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 10:59:07,780 INFO  L336             CfgBuilder]: Removed 2 assume(true) statements.
[2025-03-08 10:59:07,780 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:59:07 BoogieIcfgContainer
[2025-03-08 10:59:07,780 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 10:59:07,782 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 10:59:07,782 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 10:59:07,785 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 10:59:07,786 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:59:06" (1/3) ...
[2025-03-08 10:59:07,786 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c2f05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:59:07, skipping insertion in model container
[2025-03-08 10:59:07,787 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:06" (2/3) ...
[2025-03-08 10:59:07,787 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c2f05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:59:07, skipping insertion in model container
[2025-03-08 10:59:07,787 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:59:07" (3/3) ...
[2025-03-08 10:59:07,788 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-5.i
[2025-03-08 10:59:07,799 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 10:59:07,803 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-5.i that has 2 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 10:59:07,860 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 10:59:07,870 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;@248c1772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 10:59:07,871 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 10:59:07,875 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 206 states, 136 states have (on average 1.5220588235294117) internal successors, (207), 137 states have internal predecessors, (207), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67)
[2025-03-08 10:59:07,893 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2025-03-08 10:59:07,893 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 10:59:07,894 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:59:07,895 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 10:59:07,898 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 10:59:07,899 INFO  L85        PathProgramCache]: Analyzing trace with hash 946601201, now seen corresponding path program 1 times
[2025-03-08 10:59:07,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 10:59:07,904 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374315658]
[2025-03-08 10:59:07,905 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 10:59:07,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 10:59:08,008 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 10:59:08,042 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 10:59:08,042 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 10:59:08,043 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 10:59:08,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked.
[2025-03-08 10:59:08,358 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 10:59:08,358 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374315658]
[2025-03-08 10:59:08,359 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374315658] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 10:59:08,359 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264215952]
[2025-03-08 10:59:08,359 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 10:59:08,360 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 10:59:08,360 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 10:59:08,362 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 10:59:08,364 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 10:59:08,484 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 10:59:08,611 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 10:59:08,611 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 10:59:08,611 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 10:59:08,615 INFO  L256         TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 10:59:08,629 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 10:59:08,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked.
[2025-03-08 10:59:08,672 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 10:59:08,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264215952] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 10:59:08,672 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 10:59:08,674 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 10:59:08,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284840206]
[2025-03-08 10:59:08,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 10:59:08,681 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 10:59:08,681 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 10:59:08,698 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 10:59:08,699 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 10:59:08,701 INFO  L87              Difference]: Start difference. First operand  has 206 states, 136 states have (on average 1.5220588235294117) internal successors, (207), 137 states have internal predecessors, (207), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand  has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67)
[2025-03-08 10:59:08,755 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 10:59:08,755 INFO  L93              Difference]: Finished difference Result 406 states and 744 transitions.
[2025-03-08 10:59:08,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 10:59:08,759 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 431
[2025-03-08 10:59:08,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 10:59:08,765 INFO  L225             Difference]: With dead ends: 406
[2025-03-08 10:59:08,765 INFO  L226             Difference]: Without dead ends: 203
[2025-03-08 10:59:08,768 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 432 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 10:59:08,770 INFO  L435           NwaCegarLoop]: 326 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 10:59:08,770 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 326 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 10:59:08,780 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 203 states.
[2025-03-08 10:59:08,809 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203.
[2025-03-08 10:59:08,811 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 203 states, 134 states have (on average 1.492537313432836) internal successors, (200), 134 states have internal predecessors, (200), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67)
[2025-03-08 10:59:08,817 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 334 transitions.
[2025-03-08 10:59:08,821 INFO  L78                 Accepts]: Start accepts. Automaton has 203 states and 334 transitions. Word has length 431
[2025-03-08 10:59:08,821 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 10:59:08,821 INFO  L471      AbstractCegarLoop]: Abstraction has 203 states and 334 transitions.
[2025-03-08 10:59:08,823 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67)
[2025-03-08 10:59:08,823 INFO  L276                IsEmpty]: Start isEmpty. Operand 203 states and 334 transitions.
[2025-03-08 10:59:08,831 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2025-03-08 10:59:08,832 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 10:59:08,832 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:59:08,841 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 10:59:09,033 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 10:59:09,033 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 10:59:09,034 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 10:59:09,034 INFO  L85        PathProgramCache]: Analyzing trace with hash 294203419, now seen corresponding path program 1 times
[2025-03-08 10:59:09,034 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 10:59:09,034 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750262820]
[2025-03-08 10:59:09,034 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 10:59:09,035 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 10:59:09,068 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 10:59:09,186 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 10:59:09,186 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 10:59:09,186 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 10:59:09,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 10:59:09,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 10:59:09,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750262820]
[2025-03-08 10:59:09,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750262820] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 10:59:09,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 10:59:09,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 10:59:09,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36618833]
[2025-03-08 10:59:09,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 10:59:09,691 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 10:59:09,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 10:59:09,693 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 10:59:09,693 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 10:59:09,693 INFO  L87              Difference]: Start difference. First operand 203 states and 334 transitions. Second operand  has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 10:59:09,799 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 10:59:09,800 INFO  L93              Difference]: Finished difference Result 603 states and 996 transitions.
[2025-03-08 10:59:09,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 10:59:09,800 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 431
[2025-03-08 10:59:09,801 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 10:59:09,807 INFO  L225             Difference]: With dead ends: 603
[2025-03-08 10:59:09,807 INFO  L226             Difference]: Without dead ends: 403
[2025-03-08 10:59:09,808 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 10:59:09,810 INFO  L435           NwaCegarLoop]: 323 mSDtfsCounter, 194 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 10:59:09,811 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 963 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 10:59:09,812 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 403 states.
[2025-03-08 10:59:09,881 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401.
[2025-03-08 10:59:09,882 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 401 states, 264 states have (on average 1.496212121212121) internal successors, (395), 264 states have internal predecessors, (395), 134 states have call successors, (134), 2 states have call predecessors, (134), 2 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134)
[2025-03-08 10:59:09,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 663 transitions.
[2025-03-08 10:59:09,890 INFO  L78                 Accepts]: Start accepts. Automaton has 401 states and 663 transitions. Word has length 431
[2025-03-08 10:59:09,891 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 10:59:09,891 INFO  L471      AbstractCegarLoop]: Abstraction has 401 states and 663 transitions.
[2025-03-08 10:59:09,892 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 10:59:09,892 INFO  L276                IsEmpty]: Start isEmpty. Operand 401 states and 663 transitions.
[2025-03-08 10:59:09,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2025-03-08 10:59:09,898 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 10:59:09,898 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:59:09,898 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 10:59:09,898 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 10:59:09,899 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 10:59:09,900 INFO  L85        PathProgramCache]: Analyzing trace with hash 227196666, now seen corresponding path program 1 times
[2025-03-08 10:59:09,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 10:59:09,900 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334528139]
[2025-03-08 10:59:09,900 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 10:59:09,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 10:59:09,934 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 10:59:10,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 10:59:10,044 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 10:59:10,044 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 10:59:16,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 10:59:16,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 10:59:16,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334528139]
[2025-03-08 10:59:16,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334528139] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 10:59:16,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 10:59:16,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2025-03-08 10:59:16,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864807182]
[2025-03-08 10:59:16,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 10:59:16,803 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-03-08 10:59:16,803 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 10:59:16,804 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-03-08 10:59:16,805 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272
[2025-03-08 10:59:16,805 INFO  L87              Difference]: Start difference. First operand 401 states and 663 transitions. Second operand  has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67)
[2025-03-08 10:59:26,386 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 10:59:26,386 INFO  L93              Difference]: Finished difference Result 2225 states and 3644 transitions.
[2025-03-08 10:59:26,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2025-03-08 10:59:26,387 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 431
[2025-03-08 10:59:26,387 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 10:59:26,396 INFO  L225             Difference]: With dead ends: 2225
[2025-03-08 10:59:26,398 INFO  L226             Difference]: Without dead ends: 1827
[2025-03-08 10:59:26,400 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=364, Invalid=826, Unknown=0, NotChecked=0, Total=1190
[2025-03-08 10:59:26,401 INFO  L435           NwaCegarLoop]: 545 mSDtfsCounter, 3529 mSDsluCounter, 4332 mSDsCounter, 0 mSdLazyCounter, 4718 mSolverCounterSat, 1056 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3529 SdHoareTripleChecker+Valid, 4877 SdHoareTripleChecker+Invalid, 5774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1056 IncrementalHoareTripleChecker+Valid, 4718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time
[2025-03-08 10:59:26,402 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3529 Valid, 4877 Invalid, 5774 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1056 Valid, 4718 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time]
[2025-03-08 10:59:26,404 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1827 states.
[2025-03-08 10:59:26,492 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 960.
[2025-03-08 10:59:26,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 960 states, 693 states have (on average 1.5497835497835497) internal successors, (1074), 698 states have internal predecessors, (1074), 259 states have call successors, (259), 7 states have call predecessors, (259), 7 states have return successors, (259), 254 states have call predecessors, (259), 259 states have call successors, (259)
[2025-03-08 10:59:26,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1592 transitions.
[2025-03-08 10:59:26,503 INFO  L78                 Accepts]: Start accepts. Automaton has 960 states and 1592 transitions. Word has length 431
[2025-03-08 10:59:26,505 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 10:59:26,505 INFO  L471      AbstractCegarLoop]: Abstraction has 960 states and 1592 transitions.
[2025-03-08 10:59:26,506 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67)
[2025-03-08 10:59:26,506 INFO  L276                IsEmpty]: Start isEmpty. Operand 960 states and 1592 transitions.
[2025-03-08 10:59:26,510 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2025-03-08 10:59:26,510 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 10:59:26,511 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:59:26,511 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 10:59:26,511 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 10:59:26,512 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 10:59:26,512 INFO  L85        PathProgramCache]: Analyzing trace with hash -1708463621, now seen corresponding path program 1 times
[2025-03-08 10:59:26,512 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 10:59:26,512 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596698442]
[2025-03-08 10:59:26,512 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 10:59:26,512 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 10:59:26,535 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 10:59:26,643 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 10:59:26,644 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 10:59:26,644 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 10:59:30,922 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 10:59:30,922 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 10:59:30,922 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596698442]
[2025-03-08 10:59:30,922 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596698442] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 10:59:30,923 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 10:59:30,923 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2025-03-08 10:59:30,923 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684788130]
[2025-03-08 10:59:30,923 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 10:59:30,923 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-03-08 10:59:30,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 10:59:30,924 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-03-08 10:59:30,924 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420
[2025-03-08 10:59:30,924 INFO  L87              Difference]: Start difference. First operand 960 states and 1592 transitions. Second operand  has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 states have internal predecessors, (99), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67)
[2025-03-08 11:00:24,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:00:24,347 INFO  L93              Difference]: Finished difference Result 15213 states and 23726 transitions.
[2025-03-08 11:00:24,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. 
[2025-03-08 11:00:24,349 INFO  L78                 Accepts]: Start accepts. Automaton has  has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 states have internal predecessors, (99), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 431
[2025-03-08 11:00:24,350 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:00:24,418 INFO  L225             Difference]: With dead ends: 15213
[2025-03-08 11:00:24,418 INFO  L226             Difference]: Without dead ends: 14256
[2025-03-08 11:00:24,435 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19047 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=7257, Invalid=42249, Unknown=0, NotChecked=0, Total=49506
[2025-03-08 11:00:24,437 INFO  L435           NwaCegarLoop]: 442 mSDtfsCounter, 8211 mSDsluCounter, 9238 mSDsCounter, 0 mSdLazyCounter, 10308 mSolverCounterSat, 2760 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8211 SdHoareTripleChecker+Valid, 9680 SdHoareTripleChecker+Invalid, 13068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2760 IncrementalHoareTripleChecker+Valid, 10308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time
[2025-03-08 11:00:24,438 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [8211 Valid, 9680 Invalid, 13068 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2760 Valid, 10308 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time]
[2025-03-08 11:00:24,450 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14256 states.
[2025-03-08 11:00:24,908 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14256 to 2426.
[2025-03-08 11:00:24,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2426 states, 1813 states have (on average 1.5477109762824048) internal successors, (2806), 1832 states have internal predecessors, (2806), 586 states have call successors, (586), 26 states have call predecessors, (586), 26 states have return successors, (586), 567 states have call predecessors, (586), 586 states have call successors, (586)
[2025-03-08 11:00:24,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3978 transitions.
[2025-03-08 11:00:24,926 INFO  L78                 Accepts]: Start accepts. Automaton has 2426 states and 3978 transitions. Word has length 431
[2025-03-08 11:00:24,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:00:24,927 INFO  L471      AbstractCegarLoop]: Abstraction has 2426 states and 3978 transitions.
[2025-03-08 11:00:24,927 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 states have internal predecessors, (99), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67)
[2025-03-08 11:00:24,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 2426 states and 3978 transitions.
[2025-03-08 11:00:24,933 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2025-03-08 11:00:24,933 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:00:24,934 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:24,934 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 11:00:24,934 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:00:24,934 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:00:24,935 INFO  L85        PathProgramCache]: Analyzing trace with hash -463699140, now seen corresponding path program 1 times
[2025-03-08 11:00:24,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:00:24,935 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212864505]
[2025-03-08 11:00:24,935 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:00:24,935 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:00:24,956 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 11:00:25,005 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 11:00:25,005 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:00:25,005 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:00:26,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:00:26,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:00:26,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212864505]
[2025-03-08 11:00:26,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212864505] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:00:26,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:00:26,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2025-03-08 11:00:26,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001977637]
[2025-03-08 11:00:26,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:00:26,332 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-03-08 11:00:26,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:00:26,332 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-03-08 11:00:26,332 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240
[2025-03-08 11:00:26,332 INFO  L87              Difference]: Start difference. First operand 2426 states and 3978 transitions. Second operand  has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67)
[2025-03-08 11:00:31,520 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:00:31,520 INFO  L93              Difference]: Finished difference Result 11560 states and 19046 transitions.
[2025-03-08 11:00:31,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-03-08 11:00:31,521 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 431
[2025-03-08 11:00:31,522 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:00:31,555 INFO  L225             Difference]: With dead ends: 11560
[2025-03-08 11:00:31,555 INFO  L226             Difference]: Without dead ends: 9133
[2025-03-08 11:00:31,564 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992
[2025-03-08 11:00:31,564 INFO  L435           NwaCegarLoop]: 376 mSDtfsCounter, 2499 mSDsluCounter, 3511 mSDsCounter, 0 mSdLazyCounter, 3502 mSolverCounterSat, 666 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2505 SdHoareTripleChecker+Valid, 3887 SdHoareTripleChecker+Invalid, 4168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 666 IncrementalHoareTripleChecker+Valid, 3502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:00:31,564 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2505 Valid, 3887 Invalid, 4168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [666 Valid, 3502 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2025-03-08 11:00:31,571 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9133 states.
[2025-03-08 11:00:31,962 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9133 to 2911.
[2025-03-08 11:00:31,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2911 states, 2298 states have (on average 1.6144473455178416) internal successors, (3710), 2317 states have internal predecessors, (3710), 586 states have call successors, (586), 26 states have call predecessors, (586), 26 states have return successors, (586), 567 states have call predecessors, (586), 586 states have call successors, (586)
[2025-03-08 11:00:31,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4882 transitions.
[2025-03-08 11:00:31,977 INFO  L78                 Accepts]: Start accepts. Automaton has 2911 states and 4882 transitions. Word has length 431
[2025-03-08 11:00:31,980 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:00:31,980 INFO  L471      AbstractCegarLoop]: Abstraction has 2911 states and 4882 transitions.
[2025-03-08 11:00:31,980 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67)
[2025-03-08 11:00:31,981 INFO  L276                IsEmpty]: Start isEmpty. Operand 2911 states and 4882 transitions.
[2025-03-08 11:00:31,986 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2025-03-08 11:00:31,986 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:00:31,986 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:31,986 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 11:00:31,987 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:00:31,990 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:00:31,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -1335031430, now seen corresponding path program 1 times
[2025-03-08 11:00:31,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:00:31,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528861009]
[2025-03-08 11:00:31,990 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:00:31,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:00:32,007 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 11:00:32,120 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 11:00:32,120 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:00:32,120 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:00:32,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 156 proven. 42 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked.
[2025-03-08 11:00:32,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:00:32,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528861009]
[2025-03-08 11:00:32,304 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528861009] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 11:00:32,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859534877]
[2025-03-08 11:00:32,305 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:00:32,305 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 11:00:32,305 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:00:32,312 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:00:32,314 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:00:32,406 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 11:00:32,485 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 11:00:32,485 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:00:32,485 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:00:32,490 INFO  L256         TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-03-08 11:00:32,498 INFO  L279         TraceCheckSpWp]: Computing forward predicates...