./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.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-pr-ci_file-66.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 0cbadd5c8de40e45d11c8c9bd5d5aa33e26bba45cb60181d9a1abcae7f03bb4b
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 12:18:25,849 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 12:18:25,894 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 12:18:25,897 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 12:18:25,897 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 12:18:25,912 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 12:18:25,913 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 12:18:25,913 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 12:18:25,913 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 12:18:25,913 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 12:18:25,914 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 12:18:25,914 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 12:18:25,914 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 12:18:25,914 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 12:18:25,915 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 12:18:25,915 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 12:18:25,915 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 12:18:25,915 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 12:18:25,915 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 12:18:25,915 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 12:18:25,915 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 12:18:25,915 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 12:18:25,915 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 12:18:25,915 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 12:18:25,916 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 12:18:25,916 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 12:18:25,916 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 12:18:25,916 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 12:18:25,916 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 12:18:25,916 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 12:18:25,916 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 12:18:25,916 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 12:18:25,916 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 12:18:25,917 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 12:18:25,917 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 12:18:25,917 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 12:18:25,917 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 12:18:25,917 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 12:18:25,917 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 12:18:25,917 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 12:18:25,917 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 12:18:25,917 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 12:18:25,917 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 12:18:25,917 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 -> 0cbadd5c8de40e45d11c8c9bd5d5aa33e26bba45cb60181d9a1abcae7f03bb4b
[2025-03-08 12:18:26,142 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 12:18:26,150 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 12:18:26,151 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 12:18:26,153 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 12:18:26,153 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 12:18:26,154 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-pr-ci_file-66.i
[2025-03-08 12:18:27,321 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efa41098/eb42e7ec2a084647afa4d92159478bdb/FLAGd2bf15578
[2025-03-08 12:18:27,569 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 12:18:27,569 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i
[2025-03-08 12:18:27,580 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efa41098/eb42e7ec2a084647afa4d92159478bdb/FLAGd2bf15578
[2025-03-08 12:18:27,594 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efa41098/eb42e7ec2a084647afa4d92159478bdb
[2025-03-08 12:18:27,596 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 12:18:27,598 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 12:18:27,601 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 12:18:27,601 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 12:18:27,605 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 12:18:27,607 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,608 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e16a5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27, skipping insertion in model container
[2025-03-08 12:18:27,608 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,625 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 12:18:27,727 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-pr-ci_file-66.i[919,932]
[2025-03-08 12:18:27,769 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 12:18:27,777 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 12:18:27,786 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-pr-ci_file-66.i[919,932]
[2025-03-08 12:18:27,813 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 12:18:27,825 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 12:18:27,826 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27 WrapperNode
[2025-03-08 12:18:27,826 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 12:18:27,827 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 12:18:27,827 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 12:18:27,827 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 12:18:27,831 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,844 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,871 INFO  L138                Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177
[2025-03-08 12:18:27,876 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 12:18:27,876 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 12:18:27,877 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 12:18:27,877 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 12:18:27,883 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,883 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,885 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,905 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 12:18:27,906 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,906 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,913 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,918 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,920 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,920 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,922 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 12:18:27,927 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 12:18:27,927 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 12:18:27,927 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 12:18:27,928 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (1/1) ...
[2025-03-08 12:18:27,932 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 12:18:27,941 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 12:18:27,954 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 12:18:27,960 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 12:18:27,975 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 12:18:27,975 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 12:18:27,975 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 12:18:27,975 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 12:18:27,975 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 12:18:27,975 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 12:18:28,037 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 12:18:28,039 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 12:18:28,322 INFO  L?                        ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2025-03-08 12:18:28,323 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 12:18:28,331 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 12:18:28,331 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 12:18:28,332 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:18:28 BoogieIcfgContainer
[2025-03-08 12:18:28,332 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 12:18:28,334 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 12:18:28,334 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 12:18:28,337 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 12:18:28,337 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:18:27" (1/3) ...
[2025-03-08 12:18:28,338 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aedd63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:18:28, skipping insertion in model container
[2025-03-08 12:18:28,338 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:27" (2/3) ...
[2025-03-08 12:18:28,340 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aedd63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:18:28, skipping insertion in model container
[2025-03-08 12:18:28,340 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:18:28" (3/3) ...
[2025-03-08 12:18:28,341 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i
[2025-03-08 12:18:28,351 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 12:18:28,354 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 12:18:28,406 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 12:18:28,418 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;@33c03ec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 12:18:28,418 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 12:18:28,421 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2025-03-08 12:18:28,431 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-03-08 12:18:28,431 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:28,431 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:28,432 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:28,436 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:28,436 INFO  L85        PathProgramCache]: Analyzing trace with hash 1479191098, now seen corresponding path program 1 times
[2025-03-08 12:18:28,443 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:28,443 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789987882]
[2025-03-08 12:18:28,443 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:28,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:28,524 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-08 12:18:28,555 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-08 12:18:28,558 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:28,560 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:28,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked.
[2025-03-08 12:18:28,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:28,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789987882]
[2025-03-08 12:18:28,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789987882] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 12:18:28,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039332584]
[2025-03-08 12:18:28,726 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:28,726 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 12:18:28,727 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 12:18:28,730 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 12:18:28,732 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 12:18:28,807 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-08 12:18:28,874 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-08 12:18:28,874 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:28,874 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:28,877 INFO  L256         TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 12:18:28,886 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 12:18:28,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked.
[2025-03-08 12:18:28,915 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 12:18:28,915 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039332584] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:28,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 12:18:28,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 12:18:28,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824692100]
[2025-03-08 12:18:28,919 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:28,922 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 12:18:28,922 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:28,937 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 12:18:28,938 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 12:18:28,940 INFO  L87              Difference]: Start difference. First operand  has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand  has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 12:18:28,966 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:28,967 INFO  L93              Difference]: Finished difference Result 154 states and 269 transitions.
[2025-03-08 12:18:28,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 12:18:28,969 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149
[2025-03-08 12:18:28,969 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:28,973 INFO  L225             Difference]: With dead ends: 154
[2025-03-08 12:18:28,973 INFO  L226             Difference]: Without dead ends: 77
[2025-03-08 12:18:28,975 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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 12:18:28,977 INFO  L435           NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:28,978 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 12:18:28,986 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2025-03-08 12:18:29,001 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77.
[2025-03-08 12:18:29,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 77 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 53 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2025-03-08 12:18:29,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions.
[2025-03-08 12:18:29,009 INFO  L78                 Accepts]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 149
[2025-03-08 12:18:29,009 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:29,010 INFO  L471      AbstractCegarLoop]: Abstraction has 77 states and 121 transitions.
[2025-03-08 12:18:29,010 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 12:18:29,010 INFO  L276                IsEmpty]: Start isEmpty. Operand 77 states and 121 transitions.
[2025-03-08 12:18:29,015 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-03-08 12:18:29,015 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:29,015 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:29,024 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 12:18:29,216 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 12:18:29,216 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:29,217 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:29,217 INFO  L85        PathProgramCache]: Analyzing trace with hash 2111041848, now seen corresponding path program 1 times
[2025-03-08 12:18:29,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:29,218 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937968578]
[2025-03-08 12:18:29,218 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:29,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:29,233 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-08 12:18:29,313 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-08 12:18:29,313 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:29,313 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:29,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:29,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:29,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937968578]
[2025-03-08 12:18:29,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937968578] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:29,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:29,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 12:18:29,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33322815]
[2025-03-08 12:18:29,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:29,713 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 12:18:29,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:29,713 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 12:18:29,713 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 12:18:29,714 INFO  L87              Difference]: Start difference. First operand 77 states and 121 transitions. Second operand  has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:30,103 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:30,103 INFO  L93              Difference]: Finished difference Result 251 states and 405 transitions.
[2025-03-08 12:18:30,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 12:18:30,104 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149
[2025-03-08 12:18:30,104 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:30,105 INFO  L225             Difference]: With dead ends: 251
[2025-03-08 12:18:30,106 INFO  L226             Difference]: Without dead ends: 177
[2025-03-08 12:18:30,106 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90
[2025-03-08 12:18:30,107 INFO  L435           NwaCegarLoop]: 124 mSDtfsCounter, 148 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:30,107 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 453 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 12:18:30,108 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 177 states.
[2025-03-08 12:18:30,133 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 139.
[2025-03-08 12:18:30,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 139 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44)
[2025-03-08 12:18:30,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 217 transitions.
[2025-03-08 12:18:30,136 INFO  L78                 Accepts]: Start accepts. Automaton has 139 states and 217 transitions. Word has length 149
[2025-03-08 12:18:30,137 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:30,137 INFO  L471      AbstractCegarLoop]: Abstraction has 139 states and 217 transitions.
[2025-03-08 12:18:30,137 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:30,137 INFO  L276                IsEmpty]: Start isEmpty. Operand 139 states and 217 transitions.
[2025-03-08 12:18:30,138 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-03-08 12:18:30,138 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:30,138 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:30,138 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 12:18:30,138 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:30,141 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:30,141 INFO  L85        PathProgramCache]: Analyzing trace with hash 1266569977, now seen corresponding path program 1 times
[2025-03-08 12:18:30,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:30,142 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811854710]
[2025-03-08 12:18:30,143 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:30,143 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:30,158 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-08 12:18:30,228 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-08 12:18:30,229 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:30,229 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:30,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:30,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:30,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811854710]
[2025-03-08 12:18:30,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811854710] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:30,940 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:30,940 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 12:18:30,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125812113]
[2025-03-08 12:18:30,940 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:30,940 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 12:18:30,940 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:30,941 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 12:18:30,941 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-03-08 12:18:30,941 INFO  L87              Difference]: Start difference. First operand 139 states and 217 transitions. Second operand  has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 12:18:31,319 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:31,319 INFO  L93              Difference]: Finished difference Result 263 states and 424 transitions.
[2025-03-08 12:18:31,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 12:18:31,320 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149
[2025-03-08 12:18:31,322 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:31,323 INFO  L225             Difference]: With dead ends: 263
[2025-03-08 12:18:31,323 INFO  L226             Difference]: Without dead ends: 189
[2025-03-08 12:18:31,324 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132
[2025-03-08 12:18:31,324 INFO  L435           NwaCegarLoop]: 107 mSDtfsCounter, 161 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:31,326 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 412 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 12:18:31,326 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 189 states.
[2025-03-08 12:18:31,350 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 144.
[2025-03-08 12:18:31,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 144 states, 96 states have (on average 1.4375) internal successors, (138), 96 states have internal predecessors, (138), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44)
[2025-03-08 12:18:31,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 226 transitions.
[2025-03-08 12:18:31,353 INFO  L78                 Accepts]: Start accepts. Automaton has 144 states and 226 transitions. Word has length 149
[2025-03-08 12:18:31,354 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:31,354 INFO  L471      AbstractCegarLoop]: Abstraction has 144 states and 226 transitions.
[2025-03-08 12:18:31,354 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 12:18:31,355 INFO  L276                IsEmpty]: Start isEmpty. Operand 144 states and 226 transitions.
[2025-03-08 12:18:31,356 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-08 12:18:31,357 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:31,357 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:31,357 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 12:18:31,357 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:31,358 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:31,358 INFO  L85        PathProgramCache]: Analyzing trace with hash -884279417, now seen corresponding path program 1 times
[2025-03-08 12:18:31,358 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:31,358 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889195106]
[2025-03-08 12:18:31,358 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:31,358 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:31,369 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-08 12:18:31,444 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-08 12:18:31,444 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:31,445 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:34,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:34,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:34,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889195106]
[2025-03-08 12:18:34,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889195106] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:34,330 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:34,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2025-03-08 12:18:34,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104498286]
[2025-03-08 12:18:34,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:34,331 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-03-08 12:18:34,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:34,332 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-03-08 12:18:34,332 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210
[2025-03-08 12:18:34,332 INFO  L87              Difference]: Start difference. First operand 144 states and 226 transitions. Second operand  has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:35,389 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:35,389 INFO  L93              Difference]: Finished difference Result 388 states and 593 transitions.
[2025-03-08 12:18:35,391 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-08 12:18:35,391 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150
[2025-03-08 12:18:35,391 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:35,393 INFO  L225             Difference]: With dead ends: 388
[2025-03-08 12:18:35,393 INFO  L226             Difference]: Without dead ends: 314
[2025-03-08 12:18:35,393 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272
[2025-03-08 12:18:35,394 INFO  L435           NwaCegarLoop]: 88 mSDtfsCounter, 238 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:35,394 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 735 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 12:18:35,397 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 314 states.
[2025-03-08 12:18:35,421 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 222.
[2025-03-08 12:18:35,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 222 states, 169 states have (on average 1.4911242603550297) internal successors, (252), 170 states have internal predecessors, (252), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48)
[2025-03-08 12:18:35,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 348 transitions.
[2025-03-08 12:18:35,425 INFO  L78                 Accepts]: Start accepts. Automaton has 222 states and 348 transitions. Word has length 150
[2025-03-08 12:18:35,425 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:35,425 INFO  L471      AbstractCegarLoop]: Abstraction has 222 states and 348 transitions.
[2025-03-08 12:18:35,426 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:35,426 INFO  L276                IsEmpty]: Start isEmpty. Operand 222 states and 348 transitions.
[2025-03-08 12:18:35,427 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-08 12:18:35,428 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:35,428 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:35,428 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 12:18:35,428 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:35,428 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:35,429 INFO  L85        PathProgramCache]: Analyzing trace with hash -883355896, now seen corresponding path program 1 times
[2025-03-08 12:18:35,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:35,429 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498330314]
[2025-03-08 12:18:35,429 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:35,429 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:35,440 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-08 12:18:35,492 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-08 12:18:35,492 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:35,492 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:39,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:39,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:39,193 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498330314]
[2025-03-08 12:18:39,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498330314] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:39,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:39,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2025-03-08 12:18:39,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279332312]
[2025-03-08 12:18:39,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:39,194 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-03-08 12:18:39,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:39,194 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-03-08 12:18:39,194 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240
[2025-03-08 12:18:39,194 INFO  L87              Difference]: Start difference. First operand 222 states and 348 transitions. Second operand  has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:40,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:40,180 INFO  L93              Difference]: Finished difference Result 314 states and 464 transitions.
[2025-03-08 12:18:40,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-08 12:18:40,181 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150
[2025-03-08 12:18:40,182 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:40,183 INFO  L225             Difference]: With dead ends: 314
[2025-03-08 12:18:40,183 INFO  L226             Difference]: Without dead ends: 312
[2025-03-08 12:18:40,184 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306
[2025-03-08 12:18:40,188 INFO  L435           NwaCegarLoop]: 94 mSDtfsCounter, 266 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:40,188 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 639 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 12:18:40,189 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 312 states.
[2025-03-08 12:18:40,204 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 222.
[2025-03-08 12:18:40,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 222 states, 169 states have (on average 1.4911242603550297) internal successors, (252), 170 states have internal predecessors, (252), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48)
[2025-03-08 12:18:40,209 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 348 transitions.
[2025-03-08 12:18:40,210 INFO  L78                 Accepts]: Start accepts. Automaton has 222 states and 348 transitions. Word has length 150
[2025-03-08 12:18:40,211 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:40,211 INFO  L471      AbstractCegarLoop]: Abstraction has 222 states and 348 transitions.
[2025-03-08 12:18:40,212 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:40,212 INFO  L276                IsEmpty]: Start isEmpty. Operand 222 states and 348 transitions.
[2025-03-08 12:18:40,213 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-08 12:18:40,213 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:40,213 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:40,213 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 12:18:40,213 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:40,213 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:40,214 INFO  L85        PathProgramCache]: Analyzing trace with hash -755196698, now seen corresponding path program 1 times
[2025-03-08 12:18:40,214 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:40,214 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208966894]
[2025-03-08 12:18:40,215 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:40,215 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:40,221 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-08 12:18:40,283 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-08 12:18:40,284 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:40,284 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:42,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:42,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:42,930 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208966894]
[2025-03-08 12:18:42,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208966894] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:42,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:42,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2025-03-08 12:18:42,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540871818]
[2025-03-08 12:18:42,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:42,931 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-03-08 12:18:42,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:42,932 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-03-08 12:18:42,932 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210
[2025-03-08 12:18:42,932 INFO  L87              Difference]: Start difference. First operand 222 states and 348 transitions. Second operand  has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:43,934 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:43,934 INFO  L93              Difference]: Finished difference Result 323 states and 475 transitions.
[2025-03-08 12:18:43,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-08 12:18:43,938 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150
[2025-03-08 12:18:43,938 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:43,940 INFO  L225             Difference]: With dead ends: 323
[2025-03-08 12:18:43,940 INFO  L226             Difference]: Without dead ends: 321
[2025-03-08 12:18:43,942 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272
[2025-03-08 12:18:43,942 INFO  L435           NwaCegarLoop]: 93 mSDtfsCounter, 276 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:43,943 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 547 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 12:18:43,943 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 321 states.
[2025-03-08 12:18:43,958 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 230.
[2025-03-08 12:18:43,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 230 states, 177 states have (on average 1.4915254237288136) internal successors, (264), 178 states have internal predecessors, (264), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48)
[2025-03-08 12:18:43,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 360 transitions.
[2025-03-08 12:18:43,961 INFO  L78                 Accepts]: Start accepts. Automaton has 230 states and 360 transitions. Word has length 150
[2025-03-08 12:18:43,961 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:43,961 INFO  L471      AbstractCegarLoop]: Abstraction has 230 states and 360 transitions.
[2025-03-08 12:18:43,961 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:43,962 INFO  L276                IsEmpty]: Start isEmpty. Operand 230 states and 360 transitions.
[2025-03-08 12:18:43,963 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-08 12:18:43,963 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:43,963 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:43,963 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 12:18:43,963 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:43,964 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:43,964 INFO  L85        PathProgramCache]: Analyzing trace with hash -754273177, now seen corresponding path program 1 times
[2025-03-08 12:18:43,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:43,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624220997]
[2025-03-08 12:18:43,964 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:43,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:43,972 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-08 12:18:44,028 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-08 12:18:44,029 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:44,029 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:47,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:47,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:47,777 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624220997]
[2025-03-08 12:18:47,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624220997] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:47,777 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:47,777 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2025-03-08 12:18:47,777 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579246121]
[2025-03-08 12:18:47,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:47,777 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-03-08 12:18:47,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:47,778 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-03-08 12:18:47,778 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240
[2025-03-08 12:18:47,778 INFO  L87              Difference]: Start difference. First operand 230 states and 360 transitions. Second operand  has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:48,978 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:48,978 INFO  L93              Difference]: Finished difference Result 321 states and 473 transitions.
[2025-03-08 12:18:48,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-08 12:18:48,979 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150
[2025-03-08 12:18:48,979 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:48,981 INFO  L225             Difference]: With dead ends: 321
[2025-03-08 12:18:48,984 INFO  L226             Difference]: Without dead ends: 319
[2025-03-08 12:18:48,984 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306
[2025-03-08 12:18:48,985 INFO  L435           NwaCegarLoop]: 103 mSDtfsCounter, 290 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:48,985 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 628 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 12:18:48,986 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 319 states.
[2025-03-08 12:18:48,997 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 222.
[2025-03-08 12:18:48,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 222 states, 169 states have (on average 1.4911242603550297) internal successors, (252), 170 states have internal predecessors, (252), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48)
[2025-03-08 12:18:48,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 348 transitions.
[2025-03-08 12:18:49,000 INFO  L78                 Accepts]: Start accepts. Automaton has 222 states and 348 transitions. Word has length 150
[2025-03-08 12:18:49,001 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:49,001 INFO  L471      AbstractCegarLoop]: Abstraction has 222 states and 348 transitions.
[2025-03-08 12:18:49,001 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:49,001 INFO  L276                IsEmpty]: Start isEmpty. Operand 222 states and 348 transitions.
[2025-03-08 12:18:49,002 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-08 12:18:49,002 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:49,002 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:49,002 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 12:18:49,002 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:49,003 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:49,003 INFO  L85        PathProgramCache]: Analyzing trace with hash 469030280, now seen corresponding path program 1 times
[2025-03-08 12:18:49,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:49,003 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134142580]
[2025-03-08 12:18:49,003 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:49,003 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:49,009 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-08 12:18:49,015 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-08 12:18:49,015 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:49,015 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:49,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:49,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:49,043 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134142580]
[2025-03-08 12:18:49,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134142580] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:49,043 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:49,043 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 12:18:49,043 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811787413]
[2025-03-08 12:18:49,043 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:49,044 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 12:18:49,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:49,044 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 12:18:49,044 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 12:18:49,044 INFO  L87              Difference]: Start difference. First operand 222 states and 348 transitions. Second operand  has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:49,089 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:49,089 INFO  L93              Difference]: Finished difference Result 494 states and 777 transitions.
[2025-03-08 12:18:49,091 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 12:18:49,092 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150
[2025-03-08 12:18:49,092 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:49,094 INFO  L225             Difference]: With dead ends: 494
[2025-03-08 12:18:49,096 INFO  L226             Difference]: Without dead ends: 348
[2025-03-08 12:18:49,097 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 12:18:49,097 INFO  L435           NwaCegarLoop]: 213 mSDtfsCounter, 101 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:49,097 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 316 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 12:18:49,098 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 348 states.
[2025-03-08 12:18:49,124 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346.
[2025-03-08 12:18:49,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 346 states, 265 states have (on average 1.441509433962264) internal successors, (382), 267 states have internal predecessors, (382), 74 states have call successors, (74), 6 states have call predecessors, (74), 6 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74)
[2025-03-08 12:18:49,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 530 transitions.
[2025-03-08 12:18:49,128 INFO  L78                 Accepts]: Start accepts. Automaton has 346 states and 530 transitions. Word has length 150
[2025-03-08 12:18:49,128 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:49,128 INFO  L471      AbstractCegarLoop]: Abstraction has 346 states and 530 transitions.
[2025-03-08 12:18:49,128 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:49,128 INFO  L276                IsEmpty]: Start isEmpty. Operand 346 states and 530 transitions.
[2025-03-08 12:18:49,129 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-08 12:18:49,129 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:49,129 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:49,129 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 12:18:49,130 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:49,131 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:49,131 INFO  L85        PathProgramCache]: Analyzing trace with hash -1327921079, now seen corresponding path program 1 times
[2025-03-08 12:18:49,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:49,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466113209]
[2025-03-08 12:18:49,131 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:49,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:49,137 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-08 12:18:49,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-08 12:18:49,144 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:49,144 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:49,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:49,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:49,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466113209]
[2025-03-08 12:18:49,195 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466113209] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:49,195 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:49,195 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 12:18:49,195 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850538004]
[2025-03-08 12:18:49,195 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:49,195 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 12:18:49,195 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:49,196 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 12:18:49,196 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 12:18:49,196 INFO  L87              Difference]: Start difference. First operand 346 states and 530 transitions. Second operand  has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:49,370 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:49,370 INFO  L93              Difference]: Finished difference Result 780 states and 1175 transitions.
[2025-03-08 12:18:49,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 12:18:49,370 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150
[2025-03-08 12:18:49,371 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:49,373 INFO  L225             Difference]: With dead ends: 780
[2025-03-08 12:18:49,373 INFO  L226             Difference]: Without dead ends: 527
[2025-03-08 12:18:49,374 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 12:18:49,374 INFO  L435           NwaCegarLoop]: 143 mSDtfsCounter, 101 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:49,375 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 400 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 12:18:49,376 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 527 states.
[2025-03-08 12:18:49,411 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 476.
[2025-03-08 12:18:49,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 476 states, 366 states have (on average 1.4262295081967213) internal successors, (522), 369 states have internal predecessors, (522), 100 states have call successors, (100), 9 states have call predecessors, (100), 9 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100)
[2025-03-08 12:18:49,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 722 transitions.
[2025-03-08 12:18:49,414 INFO  L78                 Accepts]: Start accepts. Automaton has 476 states and 722 transitions. Word has length 150
[2025-03-08 12:18:49,414 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:49,414 INFO  L471      AbstractCegarLoop]: Abstraction has 476 states and 722 transitions.
[2025-03-08 12:18:49,414 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:49,414 INFO  L276                IsEmpty]: Start isEmpty. Operand 476 states and 722 transitions.
[2025-03-08 12:18:49,415 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-08 12:18:49,416 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:49,416 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:49,416 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 12:18:49,416 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:49,416 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:49,417 INFO  L85        PathProgramCache]: Analyzing trace with hash -1198838360, now seen corresponding path program 1 times
[2025-03-08 12:18:49,417 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:49,417 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669172052]
[2025-03-08 12:18:49,417 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:49,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:49,424 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-08 12:18:49,450 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-08 12:18:49,451 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:49,451 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:50,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:50,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:50,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669172052]
[2025-03-08 12:18:50,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669172052] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:50,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:50,901 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-08 12:18:50,901 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841235942]
[2025-03-08 12:18:50,901 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:50,902 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-08 12:18:50,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:50,902 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-08 12:18:50,902 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156
[2025-03-08 12:18:50,902 INFO  L87              Difference]: Start difference. First operand 476 states and 722 transitions. Second operand  has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:51,757 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:51,757 INFO  L93              Difference]: Finished difference Result 646 states and 926 transitions.
[2025-03-08 12:18:51,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 12:18:51,758 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150
[2025-03-08 12:18:51,758 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:51,761 INFO  L225             Difference]: With dead ends: 646
[2025-03-08 12:18:51,761 INFO  L226             Difference]: Without dead ends: 644
[2025-03-08 12:18:51,761 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210
[2025-03-08 12:18:51,761 INFO  L435           NwaCegarLoop]: 126 mSDtfsCounter, 326 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:51,762 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 682 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 12:18:51,762 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 644 states.
[2025-03-08 12:18:51,799 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 548.
[2025-03-08 12:18:51,802 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 548 states, 427 states have (on average 1.405152224824356) internal successors, (600), 432 states have internal predecessors, (600), 108 states have call successors, (108), 12 states have call predecessors, (108), 12 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108)
[2025-03-08 12:18:51,804 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 816 transitions.
[2025-03-08 12:18:51,805 INFO  L78                 Accepts]: Start accepts. Automaton has 548 states and 816 transitions. Word has length 150
[2025-03-08 12:18:51,806 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:51,806 INFO  L471      AbstractCegarLoop]: Abstraction has 548 states and 816 transitions.
[2025-03-08 12:18:51,806 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:51,806 INFO  L276                IsEmpty]: Start isEmpty. Operand 548 states and 816 transitions.
[2025-03-08 12:18:51,808 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-08 12:18:51,808 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:51,809 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:51,809 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 12:18:51,809 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:51,809 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:51,810 INFO  L85        PathProgramCache]: Analyzing trace with hash -1197914839, now seen corresponding path program 1 times
[2025-03-08 12:18:51,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:51,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913910972]
[2025-03-08 12:18:51,810 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:51,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:51,822 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-08 12:18:51,850 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-08 12:18:51,850 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:51,850 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:54,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:54,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:54,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913910972]
[2025-03-08 12:18:54,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913910972] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:54,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:54,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-03-08 12:18:54,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577610182]
[2025-03-08 12:18:54,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:54,336 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-08 12:18:54,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:54,336 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-08 12:18:54,337 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182
[2025-03-08 12:18:54,337 INFO  L87              Difference]: Start difference. First operand 548 states and 816 transitions. Second operand  has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:55,747 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:55,747 INFO  L93              Difference]: Finished difference Result 644 states and 924 transitions.
[2025-03-08 12:18:55,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-08 12:18:55,748 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150
[2025-03-08 12:18:55,748 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:55,750 INFO  L225             Difference]: With dead ends: 644
[2025-03-08 12:18:55,751 INFO  L226             Difference]: Without dead ends: 642
[2025-03-08 12:18:55,751 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240
[2025-03-08 12:18:55,751 INFO  L435           NwaCegarLoop]: 146 mSDtfsCounter, 342 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:55,751 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 803 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-08 12:18:55,753 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 642 states.
[2025-03-08 12:18:55,787 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 548.
[2025-03-08 12:18:55,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 548 states, 427 states have (on average 1.405152224824356) internal successors, (600), 432 states have internal predecessors, (600), 108 states have call successors, (108), 12 states have call predecessors, (108), 12 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108)
[2025-03-08 12:18:55,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 816 transitions.
[2025-03-08 12:18:55,791 INFO  L78                 Accepts]: Start accepts. Automaton has 548 states and 816 transitions. Word has length 150
[2025-03-08 12:18:55,792 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:55,792 INFO  L471      AbstractCegarLoop]: Abstraction has 548 states and 816 transitions.
[2025-03-08 12:18:55,792 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:18:55,792 INFO  L276                IsEmpty]: Start isEmpty. Operand 548 states and 816 transitions.
[2025-03-08 12:18:55,794 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-08 12:18:55,794 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:55,794 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:55,794 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 12:18:55,794 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:55,795 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:55,795 INFO  L85        PathProgramCache]: Analyzing trace with hash -1293103642, now seen corresponding path program 1 times
[2025-03-08 12:18:55,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:55,795 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119502144]
[2025-03-08 12:18:55,796 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:55,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:55,803 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-08 12:18:55,814 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-08 12:18:55,815 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:55,815 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:56,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:56,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:56,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119502144]
[2025-03-08 12:18:56,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119502144] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:56,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:56,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 12:18:56,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315620452]
[2025-03-08 12:18:56,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:56,032 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 12:18:56,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:56,032 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 12:18:56,032 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2025-03-08 12:18:56,033 INFO  L87              Difference]: Start difference. First operand 548 states and 816 transitions. Second operand  has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22)
[2025-03-08 12:18:56,335 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:56,335 INFO  L93              Difference]: Finished difference Result 1055 states and 1582 transitions.
[2025-03-08 12:18:56,336 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 12:18:56,336 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 150
[2025-03-08 12:18:56,336 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:56,340 INFO  L225             Difference]: With dead ends: 1055
[2025-03-08 12:18:56,340 INFO  L226             Difference]: Without dead ends: 602
[2025-03-08 12:18:56,341 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90
[2025-03-08 12:18:56,342 INFO  L435           NwaCegarLoop]: 106 mSDtfsCounter, 214 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:56,342 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 422 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 12:18:56,343 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 602 states.
[2025-03-08 12:18:56,374 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 547.
[2025-03-08 12:18:56,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 547 states, 426 states have (on average 1.4014084507042253) internal successors, (597), 431 states have internal predecessors, (597), 108 states have call successors, (108), 12 states have call predecessors, (108), 12 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108)
[2025-03-08 12:18:56,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 813 transitions.
[2025-03-08 12:18:56,378 INFO  L78                 Accepts]: Start accepts. Automaton has 547 states and 813 transitions. Word has length 150
[2025-03-08 12:18:56,378 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:56,378 INFO  L471      AbstractCegarLoop]: Abstraction has 547 states and 813 transitions.
[2025-03-08 12:18:56,378 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22)
[2025-03-08 12:18:56,379 INFO  L276                IsEmpty]: Start isEmpty. Operand 547 states and 813 transitions.
[2025-03-08 12:18:56,380 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-08 12:18:56,380 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:56,380 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:56,380 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 12:18:56,380 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:56,380 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:56,380 INFO  L85        PathProgramCache]: Analyzing trace with hash 1566006792, now seen corresponding path program 1 times
[2025-03-08 12:18:56,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:56,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679391410]
[2025-03-08 12:18:56,380 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:56,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:56,390 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-08 12:18:56,402 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-08 12:18:56,402 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:56,402 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:56,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:56,574 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:56,574 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679391410]
[2025-03-08 12:18:56,574 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679391410] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:56,574 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:56,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 12:18:56,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279229220]
[2025-03-08 12:18:56,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:56,575 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 12:18:56,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:56,576 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 12:18:56,576 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 12:18:56,576 INFO  L87              Difference]: Start difference. First operand 547 states and 813 transitions. Second operand  has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 12:18:56,808 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:56,808 INFO  L93              Difference]: Finished difference Result 985 states and 1449 transitions.
[2025-03-08 12:18:56,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 12:18:56,809 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150
[2025-03-08 12:18:56,809 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:56,813 INFO  L225             Difference]: With dead ends: 985
[2025-03-08 12:18:56,813 INFO  L226             Difference]: Without dead ends: 528
[2025-03-08 12:18:56,815 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-08 12:18:56,815 INFO  L435           NwaCegarLoop]: 117 mSDtfsCounter, 198 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:56,816 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 223 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 12:18:56,817 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2025-03-08 12:18:56,847 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 519.
[2025-03-08 12:18:56,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 519 states, 392 states have (on average 1.3596938775510203) internal successors, (533), 397 states have internal predecessors, (533), 112 states have call successors, (112), 14 states have call predecessors, (112), 14 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112)
[2025-03-08 12:18:56,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 757 transitions.
[2025-03-08 12:18:56,851 INFO  L78                 Accepts]: Start accepts. Automaton has 519 states and 757 transitions. Word has length 150
[2025-03-08 12:18:56,851 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:56,851 INFO  L471      AbstractCegarLoop]: Abstraction has 519 states and 757 transitions.
[2025-03-08 12:18:56,852 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 12:18:56,852 INFO  L276                IsEmpty]: Start isEmpty. Operand 519 states and 757 transitions.
[2025-03-08 12:18:56,854 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-08 12:18:56,854 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:56,855 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:56,855 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 12:18:56,855 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:56,855 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:56,855 INFO  L85        PathProgramCache]: Analyzing trace with hash -5532117, now seen corresponding path program 1 times
[2025-03-08 12:18:56,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:56,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690197791]
[2025-03-08 12:18:56,856 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:56,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:56,864 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-08 12:18:56,884 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-08 12:18:56,884 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:56,885 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:18:58,084 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:18:58,085 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:18:58,085 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690197791]
[2025-03-08 12:18:58,085 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690197791] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:18:58,085 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:18:58,085 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-08 12:18:58,085 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172517729]
[2025-03-08 12:18:58,085 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:18:58,085 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-08 12:18:58,085 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:18:58,086 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-08 12:18:58,086 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2025-03-08 12:18:58,086 INFO  L87              Difference]: Start difference. First operand 519 states and 757 transitions. Second operand  has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22)
[2025-03-08 12:18:59,925 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:18:59,925 INFO  L93              Difference]: Finished difference Result 1250 states and 1811 transitions.
[2025-03-08 12:18:59,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 12:18:59,926 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 150
[2025-03-08 12:18:59,926 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:18:59,929 INFO  L225             Difference]: With dead ends: 1250
[2025-03-08 12:18:59,929 INFO  L226             Difference]: Without dead ends: 819
[2025-03-08 12:18:59,930 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462
[2025-03-08 12:18:59,930 INFO  L435           NwaCegarLoop]: 153 mSDtfsCounter, 367 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 12:18:59,931 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 989 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 12:18:59,931 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 819 states.
[2025-03-08 12:18:59,969 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 623.
[2025-03-08 12:18:59,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 623 states, 484 states have (on average 1.3553719008264462) internal successors, (656), 493 states have internal predecessors, (656), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 111 states have call predecessors, (120), 120 states have call successors, (120)
[2025-03-08 12:18:59,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 896 transitions.
[2025-03-08 12:18:59,974 INFO  L78                 Accepts]: Start accepts. Automaton has 623 states and 896 transitions. Word has length 150
[2025-03-08 12:18:59,974 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:18:59,974 INFO  L471      AbstractCegarLoop]: Abstraction has 623 states and 896 transitions.
[2025-03-08 12:18:59,974 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22)
[2025-03-08 12:18:59,974 INFO  L276                IsEmpty]: Start isEmpty. Operand 623 states and 896 transitions.
[2025-03-08 12:18:59,975 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-03-08 12:18:59,975 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:18:59,976 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:59,976 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 12:18:59,976 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:18:59,976 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:18:59,977 INFO  L85        PathProgramCache]: Analyzing trace with hash -1486608171, now seen corresponding path program 1 times
[2025-03-08 12:18:59,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:18:59,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862829828]
[2025-03-08 12:18:59,977 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:18:59,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:18:59,984 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-03-08 12:18:59,997 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-03-08 12:18:59,998 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:18:59,998 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:19:00,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked.
[2025-03-08 12:19:00,080 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:19:00,080 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862829828]
[2025-03-08 12:19:00,080 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862829828] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 12:19:00,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980012528]
[2025-03-08 12:19:00,081 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:19:00,081 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 12:19:00,081 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 12:19:00,083 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 12:19:00,085 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 12:19:00,131 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-03-08 12:19:00,169 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-03-08 12:19:00,169 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:19:00,169 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:19:00,171 INFO  L256         TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-08 12:19:00,174 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 12:19:00,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 211 proven. 6 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked.
[2025-03-08 12:19:00,346 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 12:19:00,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked.
[2025-03-08 12:19:00,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980012528] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 12:19:00,514 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 12:19:00,514 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14
[2025-03-08 12:19:00,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510455519]
[2025-03-08 12:19:00,514 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 12:19:00,515 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-08 12:19:00,515 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:19:00,515 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-08 12:19:00,515 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182
[2025-03-08 12:19:00,516 INFO  L87              Difference]: Start difference. First operand 623 states and 896 transitions. Second operand  has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66)
[2025-03-08 12:19:01,011 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:19:01,011 INFO  L93              Difference]: Finished difference Result 1403 states and 2009 transitions.
[2025-03-08 12:19:01,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-03-08 12:19:01,011 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) Word has length 151
[2025-03-08 12:19:01,012 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:19:01,016 INFO  L225             Difference]: With dead ends: 1403
[2025-03-08 12:19:01,016 INFO  L226             Difference]: Without dead ends: 972
[2025-03-08 12:19:01,017 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756
[2025-03-08 12:19:01,017 INFO  L435           NwaCegarLoop]: 86 mSDtfsCounter, 297 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 12:19:01,017 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 534 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 12:19:01,018 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 972 states.
[2025-03-08 12:19:01,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 945.
[2025-03-08 12:19:01,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 945 states, 724 states have (on average 1.3232044198895028) internal successors, (958), 740 states have internal predecessors, (958), 192 states have call successors, (192), 28 states have call predecessors, (192), 28 states have return successors, (192), 176 states have call predecessors, (192), 192 states have call successors, (192)
[2025-03-08 12:19:01,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1342 transitions.
[2025-03-08 12:19:01,083 INFO  L78                 Accepts]: Start accepts. Automaton has 945 states and 1342 transitions. Word has length 151
[2025-03-08 12:19:01,083 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:19:01,083 INFO  L471      AbstractCegarLoop]: Abstraction has 945 states and 1342 transitions.
[2025-03-08 12:19:01,083 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66)
[2025-03-08 12:19:01,083 INFO  L276                IsEmpty]: Start isEmpty. Operand 945 states and 1342 transitions.
[2025-03-08 12:19:01,084 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-03-08 12:19:01,084 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:19:01,084 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:01,091 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-08 12:19:01,285 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,SelfDestructingSolverStorable14
[2025-03-08 12:19:01,285 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:19:01,285 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:19:01,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 1246469363, now seen corresponding path program 1 times
[2025-03-08 12:19:01,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:19:01,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763203182]
[2025-03-08 12:19:01,285 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:19:01,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:19:01,293 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-03-08 12:19:01,318 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-03-08 12:19:01,318 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:19:01,318 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:19:01,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked.
[2025-03-08 12:19:01,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:19:01,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763203182]
[2025-03-08 12:19:01,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763203182] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 12:19:01,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70623098]
[2025-03-08 12:19:01,381 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:19:01,381 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 12:19:01,381 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 12:19:01,382 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 12:19:01,384 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 12:19:01,427 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-03-08 12:19:01,461 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-03-08 12:19:01,461 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:19:01,461 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:19:01,462 INFO  L256         TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 12:19:01,465 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 12:19:01,576 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked.
[2025-03-08 12:19:01,577 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 12:19:01,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked.
[2025-03-08 12:19:01,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [70623098] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 12:19:01,700 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 12:19:01,700 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8
[2025-03-08 12:19:01,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593293054]
[2025-03-08 12:19:01,700 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 12:19:01,701 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 12:19:01,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:19:01,701 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 12:19:01,701 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-08 12:19:01,701 INFO  L87              Difference]: Start difference. First operand 945 states and 1342 transitions. Second operand  has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45)
[2025-03-08 12:19:01,847 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:19:01,847 INFO  L93              Difference]: Finished difference Result 1737 states and 2444 transitions.
[2025-03-08 12:19:01,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 12:19:01,848 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 151
[2025-03-08 12:19:01,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:19:01,852 INFO  L225             Difference]: With dead ends: 1737
[2025-03-08 12:19:01,852 INFO  L226             Difference]: Without dead ends: 987
[2025-03-08 12:19:01,854 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110
[2025-03-08 12:19:01,854 INFO  L435           NwaCegarLoop]: 89 mSDtfsCounter, 182 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 12:19:01,854 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 220 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 12:19:01,855 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 987 states.
[2025-03-08 12:19:01,921 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 973.
[2025-03-08 12:19:01,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 973 states, 745 states have (on average 1.2993288590604026) internal successors, (968), 761 states have internal predecessors, (968), 192 states have call successors, (192), 35 states have call predecessors, (192), 35 states have return successors, (192), 176 states have call predecessors, (192), 192 states have call successors, (192)
[2025-03-08 12:19:01,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1352 transitions.
[2025-03-08 12:19:01,926 INFO  L78                 Accepts]: Start accepts. Automaton has 973 states and 1352 transitions. Word has length 151
[2025-03-08 12:19:01,926 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:19:01,926 INFO  L471      AbstractCegarLoop]: Abstraction has 973 states and 1352 transitions.
[2025-03-08 12:19:01,927 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45)
[2025-03-08 12:19:01,927 INFO  L276                IsEmpty]: Start isEmpty. Operand 973 states and 1352 transitions.
[2025-03-08 12:19:01,927 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-03-08 12:19:01,927 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:19:01,928 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:01,934 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-08 12:19:02,132 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 12:19:02,132 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:19:02,133 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:19:02,133 INFO  L85        PathProgramCache]: Analyzing trace with hash 401997492, now seen corresponding path program 1 times
[2025-03-08 12:19:02,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:19:02,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472432820]
[2025-03-08 12:19:02,133 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:19:02,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:19:02,140 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-03-08 12:19:02,160 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-03-08 12:19:02,162 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:19:02,162 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:19:02,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:19:02,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:19:02,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472432820]
[2025-03-08 12:19:02,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472432820] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:19:02,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:19:02,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 12:19:02,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714133515]
[2025-03-08 12:19:02,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:19:02,392 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 12:19:02,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:19:02,392 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 12:19:02,393 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 12:19:02,393 INFO  L87              Difference]: Start difference. First operand 973 states and 1352 transitions. Second operand  has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:19:02,750 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:19:02,751 INFO  L93              Difference]: Finished difference Result 1615 states and 2237 transitions.
[2025-03-08 12:19:02,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 12:19:02,751 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151
[2025-03-08 12:19:02,752 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:19:02,755 INFO  L225             Difference]: With dead ends: 1615
[2025-03-08 12:19:02,755 INFO  L226             Difference]: Without dead ends: 993
[2025-03-08 12:19:02,757 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132
[2025-03-08 12:19:02,757 INFO  L435           NwaCegarLoop]: 113 mSDtfsCounter, 118 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 12:19:02,757 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 439 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 12:19:02,759 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 993 states.
[2025-03-08 12:19:02,826 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 973.
[2025-03-08 12:19:02,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 973 states, 744 states have (on average 1.2956989247311828) internal successors, (964), 760 states have internal predecessors, (964), 192 states have call successors, (192), 36 states have call predecessors, (192), 36 states have return successors, (192), 176 states have call predecessors, (192), 192 states have call successors, (192)
[2025-03-08 12:19:02,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1348 transitions.
[2025-03-08 12:19:02,831 INFO  L78                 Accepts]: Start accepts. Automaton has 973 states and 1348 transitions. Word has length 151
[2025-03-08 12:19:02,832 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:19:02,832 INFO  L471      AbstractCegarLoop]: Abstraction has 973 states and 1348 transitions.
[2025-03-08 12:19:02,832 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:19:02,832 INFO  L276                IsEmpty]: Start isEmpty. Operand 973 states and 1348 transitions.
[2025-03-08 12:19:02,833 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-03-08 12:19:02,833 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:19:02,833 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:02,833 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 12:19:02,833 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:19:02,834 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:19:02,834 INFO  L85        PathProgramCache]: Analyzing trace with hash 197299414, now seen corresponding path program 1 times
[2025-03-08 12:19:02,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:19:02,834 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868683937]
[2025-03-08 12:19:02,834 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:19:02,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:19:02,840 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-03-08 12:19:02,868 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-03-08 12:19:02,868 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:19:02,868 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:19:05,264 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:19:05,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:19:05,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868683937]
[2025-03-08 12:19:05,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868683937] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:19:05,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:19:05,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2025-03-08 12:19:05,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381007963]
[2025-03-08 12:19:05,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:19:05,265 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-03-08 12:19:05,265 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:19:05,265 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-03-08 12:19:05,266 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272
[2025-03-08 12:19:05,266 INFO  L87              Difference]: Start difference. First operand 973 states and 1348 transitions. Second operand  has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:19:06,296 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:19:06,296 INFO  L93              Difference]: Finished difference Result 1491 states and 2070 transitions.
[2025-03-08 12:19:06,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-03-08 12:19:06,296 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151
[2025-03-08 12:19:06,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:19:06,301 INFO  L225             Difference]: With dead ends: 1491
[2025-03-08 12:19:06,301 INFO  L226             Difference]: Without dead ends: 1182
[2025-03-08 12:19:06,302 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600
[2025-03-08 12:19:06,302 INFO  L435           NwaCegarLoop]: 127 mSDtfsCounter, 439 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 12:19:06,302 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 822 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 12:19:06,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1182 states.
[2025-03-08 12:19:06,425 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1023.
[2025-03-08 12:19:06,427 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1023 states, 789 states have (on average 1.2978453738910012) internal successors, (1024), 806 states have internal predecessors, (1024), 196 states have call successors, (196), 37 states have call predecessors, (196), 37 states have return successors, (196), 179 states have call predecessors, (196), 196 states have call successors, (196)
[2025-03-08 12:19:06,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1416 transitions.
[2025-03-08 12:19:06,431 INFO  L78                 Accepts]: Start accepts. Automaton has 1023 states and 1416 transitions. Word has length 151
[2025-03-08 12:19:06,432 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:19:06,432 INFO  L471      AbstractCegarLoop]: Abstraction has 1023 states and 1416 transitions.
[2025-03-08 12:19:06,432 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:19:06,432 INFO  L276                IsEmpty]: Start isEmpty. Operand 1023 states and 1416 transitions.
[2025-03-08 12:19:06,433 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-03-08 12:19:06,433 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:19:06,434 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:06,434 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 12:19:06,434 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:19:06,434 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:19:06,434 INFO  L85        PathProgramCache]: Analyzing trace with hash 198222935, now seen corresponding path program 1 times
[2025-03-08 12:19:06,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:19:06,435 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216329777]
[2025-03-08 12:19:06,435 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:19:06,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:19:06,443 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-03-08 12:19:06,471 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-03-08 12:19:06,471 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:19:06,471 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:19:10,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:19:10,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:19:10,128 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216329777]
[2025-03-08 12:19:10,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216329777] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:19:10,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:19:10,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2025-03-08 12:19:10,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966259954]
[2025-03-08 12:19:10,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:19:10,128 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-03-08 12:19:10,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:19:10,129 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-03-08 12:19:10,129 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380
[2025-03-08 12:19:10,129 INFO  L87              Difference]: Start difference. First operand 1023 states and 1416 transitions. Second operand  has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:19:13,746 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:19:13,746 INFO  L93              Difference]: Finished difference Result 1174 states and 1607 transitions.
[2025-03-08 12:19:13,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2025-03-08 12:19:13,747 INFO  L78                 Accepts]: Start accepts. Automaton has  has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151
[2025-03-08 12:19:13,747 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:19:13,751 INFO  L225             Difference]: With dead ends: 1174
[2025-03-08 12:19:13,751 INFO  L226             Difference]: Without dead ends: 1172
[2025-03-08 12:19:13,751 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=268, Invalid=1138, Unknown=0, NotChecked=0, Total=1406
[2025-03-08 12:19:13,752 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 374 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-03-08 12:19:13,752 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1060 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-03-08 12:19:13,753 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1172 states.
[2025-03-08 12:19:13,883 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1034.
[2025-03-08 12:19:13,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1034 states, 800 states have (on average 1.30125) internal successors, (1041), 817 states have internal predecessors, (1041), 196 states have call successors, (196), 37 states have call predecessors, (196), 37 states have return successors, (196), 179 states have call predecessors, (196), 196 states have call successors, (196)
[2025-03-08 12:19:13,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1433 transitions.
[2025-03-08 12:19:13,888 INFO  L78                 Accepts]: Start accepts. Automaton has 1034 states and 1433 transitions. Word has length 151
[2025-03-08 12:19:13,888 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:19:13,888 INFO  L471      AbstractCegarLoop]: Abstraction has 1034 states and 1433 transitions.
[2025-03-08 12:19:13,888 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:19:13,888 INFO  L276                IsEmpty]: Start isEmpty. Operand 1034 states and 1433 transitions.
[2025-03-08 12:19:13,889 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-03-08 12:19:13,889 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:19:13,889 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:13,889 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-08 12:19:13,890 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:19:13,890 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:19:13,890 INFO  L85        PathProgramCache]: Analyzing trace with hash 326382133, now seen corresponding path program 1 times
[2025-03-08 12:19:13,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:19:13,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612406537]
[2025-03-08 12:19:13,890 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:19:13,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:19:13,897 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-03-08 12:19:13,912 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-03-08 12:19:13,912 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:19:13,912 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:19:41,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:19:41,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:19:41,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612406537]
[2025-03-08 12:19:41,176 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612406537] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:19:41,176 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:19:41,176 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2025-03-08 12:19:41,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615500069]
[2025-03-08 12:19:41,176 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:19:41,177 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-03-08 12:19:41,177 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:19:41,177 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-03-08 12:19:41,177 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380
[2025-03-08 12:19:41,177 INFO  L87              Difference]: Start difference. First operand 1034 states and 1433 transitions. Second operand  has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:19:46,388 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:19:46,388 INFO  L93              Difference]: Finished difference Result 1185 states and 1620 transitions.
[2025-03-08 12:19:46,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2025-03-08 12:19:46,389 INFO  L78                 Accepts]: Start accepts. Automaton has  has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151
[2025-03-08 12:19:46,389 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:19:46,393 INFO  L225             Difference]: With dead ends: 1185
[2025-03-08 12:19:46,393 INFO  L226             Difference]: Without dead ends: 1183
[2025-03-08 12:19:46,394 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332
[2025-03-08 12:19:46,395 INFO  L435           NwaCegarLoop]: 137 mSDtfsCounter, 384 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-08 12:19:46,395 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 933 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-08 12:19:46,399 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1183 states.
[2025-03-08 12:19:46,476 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1034.
[2025-03-08 12:19:46,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1034 states, 800 states have (on average 1.30125) internal successors, (1041), 817 states have internal predecessors, (1041), 196 states have call successors, (196), 37 states have call predecessors, (196), 37 states have return successors, (196), 179 states have call predecessors, (196), 196 states have call successors, (196)
[2025-03-08 12:19:46,479 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1433 transitions.
[2025-03-08 12:19:46,480 INFO  L78                 Accepts]: Start accepts. Automaton has 1034 states and 1433 transitions. Word has length 151
[2025-03-08 12:19:46,481 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:19:46,481 INFO  L471      AbstractCegarLoop]: Abstraction has 1034 states and 1433 transitions.
[2025-03-08 12:19:46,481 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:19:46,481 INFO  L276                IsEmpty]: Start isEmpty. Operand 1034 states and 1433 transitions.
[2025-03-08 12:19:46,482 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-03-08 12:19:46,482 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:19:46,482 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:46,482 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-08 12:19:46,482 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:19:46,483 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:19:46,483 INFO  L85        PathProgramCache]: Analyzing trace with hash 327305654, now seen corresponding path program 1 times
[2025-03-08 12:19:46,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:19:46,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190322772]
[2025-03-08 12:19:46,483 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:19:46,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:19:46,490 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-03-08 12:19:46,509 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-03-08 12:19:46,509 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:19:46,510 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:19:51,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:19:51,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:19:51,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190322772]
[2025-03-08 12:19:51,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190322772] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:19:51,117 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:19:51,118 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2025-03-08 12:19:51,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468885779]
[2025-03-08 12:19:51,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:19:51,118 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-03-08 12:19:51,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:19:51,118 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-03-08 12:19:51,119 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380
[2025-03-08 12:19:51,119 INFO  L87              Difference]: Start difference. First operand 1034 states and 1433 transitions. Second operand  has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)