./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.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 b28ed2134b8a500a12d5d4bc892752e1e825197b4bf6ff6b142642da12ed1a0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:08:54,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:08:54,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:08:54,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:08:54,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:08:54,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:08:54,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:08:54,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:08:54,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:08:54,198 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:08:54,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:08:54,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:08:54,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:08:54,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:08:54,199 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:08:54,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:08:54,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:08:54,200 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:08:54,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:08:54,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:08:54,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:08:54,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:08:54,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:08:54,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:08:54,201 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:08:54,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:08:54,201 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:08:54,201 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:08:54,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:08:54,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:08:54,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:08:54,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:08:54,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:08:54,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:08:54,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:08:54,202 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:08:54,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:08:54,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:08:54,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:08:54,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:08:54,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:08:54,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:08:54,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:08:54,203 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 -> b28ed2134b8a500a12d5d4bc892752e1e825197b4bf6ff6b142642da12ed1a0e [2025-03-03 21:08:54,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:08:54,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:08:54,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:08:54,426 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:08:54,426 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:08:54,427 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-81.i [2025-03-03 21:08:55,590 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd3043c88/b85cffe56e8846dfbdb1aba6789e0fb9/FLAGfe664368a [2025-03-03 21:08:55,845 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:08:55,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.i [2025-03-03 21:08:55,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd3043c88/b85cffe56e8846dfbdb1aba6789e0fb9/FLAGfe664368a [2025-03-03 21:08:56,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd3043c88/b85cffe56e8846dfbdb1aba6789e0fb9 [2025-03-03 21:08:56,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:08:56,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:08:56,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:08:56,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:08:56,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:08:56,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ce57e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56, skipping insertion in model container [2025-03-03 21:08:56,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:08:56,289 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-81.i[919,932] [2025-03-03 21:08:56,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:08:56,382 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:08:56,391 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-81.i[919,932] [2025-03-03 21:08:56,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:08:56,441 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:08:56,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56 WrapperNode [2025-03-03 21:08:56,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:08:56,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:08:56,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:08:56,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:08:56,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,489 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2025-03-03 21:08:56,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:08:56,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:08:56,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:08:56,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:08:56,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,528 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:08:56,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:08:56,559 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:08:56,559 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:08:56,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:08:56,560 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (1/1) ... [2025-03-03 21:08:56,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:08:56,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:56,587 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:08:56,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:08:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:08:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:08:56,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:08:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:08:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:08:56,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:08:56,669 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:08:56,671 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:08:57,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L187: havoc property_#t~bitwise25#1;havoc property_#t~short26#1; [2025-03-03 21:08:57,086 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:08:57,086 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:08:57,105 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:08:57,106 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:08:57,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:08:57 BoogieIcfgContainer [2025-03-03 21:08:57,106 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:08:57,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:08:57,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:08:57,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:08:57,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:08:56" (1/3) ... [2025-03-03 21:08:57,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44810c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:08:57, skipping insertion in model container [2025-03-03 21:08:57,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:56" (2/3) ... [2025-03-03 21:08:57,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44810c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:08:57, skipping insertion in model container [2025-03-03 21:08:57,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:08:57" (3/3) ... [2025-03-03 21:08:57,115 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.i [2025-03-03 21:08:57,125 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:08:57,126 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:08:57,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:08:57,178 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;@62e10fcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:08:57,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:08:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 21:08:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 21:08:57,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:57,197 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:57,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:57,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:57,202 INFO L85 PathProgramCache]: Analyzing trace with hash 263325644, now seen corresponding path program 1 times [2025-03-03 21:08:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:57,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038031375] [2025-03-03 21:08:57,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:57,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 21:08:57,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 21:08:57,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:57,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-03 21:08:57,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:57,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038031375] [2025-03-03 21:08:57,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038031375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:08:57,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444642429] [2025-03-03 21:08:57,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:57,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:08:57,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:57,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:08:57,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:08:57,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 21:08:57,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 21:08:57,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:57,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:57,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:08:57,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:08:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-03 21:08:57,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:08:57,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444642429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:57,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:08:57,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:08:57,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694270911] [2025-03-03 21:08:57,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:57,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:08:57,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:57,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:08:57,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:08:57,749 INFO L87 Difference]: Start difference. First operand has 105 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:08:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:57,777 INFO L93 Difference]: Finished difference Result 203 states and 356 transitions. [2025-03-03 21:08:57,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:08:57,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-03-03 21:08:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:57,786 INFO L225 Difference]: With dead ends: 203 [2025-03-03 21:08:57,786 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 21:08:57,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:08:57,795 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:57,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:08:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 21:08:57,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-03 21:08:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 21:08:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2025-03-03 21:08:57,838 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 202 [2025-03-03 21:08:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:57,839 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2025-03-03 21:08:57,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:08:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2025-03-03 21:08:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 21:08:57,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:57,842 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:57,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:08:58,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:08:58,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:58,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:58,044 INFO L85 PathProgramCache]: Analyzing trace with hash -587681913, now seen corresponding path program 1 times [2025-03-03 21:08:58,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:58,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65538739] [2025-03-03 21:08:58,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:58,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:58,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 21:08:58,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 21:08:58,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:58,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:08:59,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:59,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65538739] [2025-03-03 21:08:59,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65538739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:59,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:59,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:08:59,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12229207] [2025-03-03 21:08:59,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:59,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:08:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:59,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:08:59,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:08:59,148 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:08:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:59,352 INFO L93 Difference]: Finished difference Result 261 states and 409 transitions. [2025-03-03 21:08:59,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:08:59,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-03 21:08:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:59,356 INFO L225 Difference]: With dead ends: 261 [2025-03-03 21:08:59,356 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 21:08:59,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:08:59,357 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 85 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:59,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 509 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:08:59,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 21:08:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 129. [2025-03-03 21:08:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 96 states have internal predecessors, (143), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 21:08:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 205 transitions. [2025-03-03 21:08:59,372 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 205 transitions. Word has length 202 [2025-03-03 21:08:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:59,373 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 205 transitions. [2025-03-03 21:08:59,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:08:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 205 transitions. [2025-03-03 21:08:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 21:08:59,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:59,379 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:59,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:08:59,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:59,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:59,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1899830920, now seen corresponding path program 1 times [2025-03-03 21:08:59,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:59,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462195754] [2025-03-03 21:08:59,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:59,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:59,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 21:08:59,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 21:08:59,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:59,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:09:10,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462195754] [2025-03-03 21:09:10,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462195754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:10,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:10,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:09:10,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907983375] [2025-03-03 21:09:10,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:10,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:09:10,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:10,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:09:10,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:09:10,190 INFO L87 Difference]: Start difference. First operand 129 states and 205 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:09:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:12,796 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2025-03-03 21:09:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:09:12,798 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-03 21:09:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:12,802 INFO L225 Difference]: With dead ends: 458 [2025-03-03 21:09:12,805 INFO L226 Difference]: Without dead ends: 332 [2025-03-03 21:09:12,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-03-03 21:09:12,806 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 681 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:12,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 628 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 21:09:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-03 21:09:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 152. [2025-03-03 21:09:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.5126050420168067) internal successors, (180), 119 states have internal predecessors, (180), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 21:09:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 242 transitions. [2025-03-03 21:09:12,831 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 242 transitions. Word has length 202 [2025-03-03 21:09:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:12,832 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 242 transitions. [2025-03-03 21:09:12,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:09:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 242 transitions. [2025-03-03 21:09:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 21:09:12,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:12,836 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:12,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:09:12,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:12,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1394272295, now seen corresponding path program 1 times [2025-03-03 21:09:12,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:12,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820679395] [2025-03-03 21:09:12,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:12,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 21:09:12,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 21:09:12,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:12,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:09:13,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:13,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820679395] [2025-03-03 21:09:13,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820679395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:13,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:13,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:09:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379316449] [2025-03-03 21:09:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:13,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:09:13,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:13,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:09:13,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:09:13,020 INFO L87 Difference]: Start difference. First operand 152 states and 242 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:09:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:13,118 INFO L93 Difference]: Finished difference Result 372 states and 591 transitions. [2025-03-03 21:09:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:09:13,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-03 21:09:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:13,120 INFO L225 Difference]: With dead ends: 372 [2025-03-03 21:09:13,122 INFO L226 Difference]: Without dead ends: 223 [2025-03-03 21:09:13,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:09:13,123 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 67 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:13,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 443 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:09:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-03 21:09:13,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2025-03-03 21:09:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 182 states have (on average 1.489010989010989) internal successors, (271), 183 states have internal predecessors, (271), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-03 21:09:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 341 transitions. [2025-03-03 21:09:13,145 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 341 transitions. Word has length 202 [2025-03-03 21:09:13,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:13,146 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 341 transitions. [2025-03-03 21:09:13,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:09:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 341 transitions. [2025-03-03 21:09:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 21:09:13,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:13,148 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:13,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:09:13,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:13,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1041826679, now seen corresponding path program 1 times [2025-03-03 21:09:13,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:13,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10042590] [2025-03-03 21:09:13,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:13,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 21:09:13,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 21:09:13,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:13,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:09:19,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10042590] [2025-03-03 21:09:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10042590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:19,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:19,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:09:19,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832953928] [2025-03-03 21:09:19,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:19,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:09:19,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:19,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:09:19,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:09:19,644 INFO L87 Difference]: Start difference. First operand 220 states and 341 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:09:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:22,083 INFO L93 Difference]: Finished difference Result 850 states and 1291 transitions. [2025-03-03 21:09:22,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 21:09:22,084 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-03-03 21:09:22,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:22,087 INFO L225 Difference]: With dead ends: 850 [2025-03-03 21:09:22,087 INFO L226 Difference]: Without dead ends: 633 [2025-03-03 21:09:22,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2025-03-03 21:09:22,088 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1006 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:22,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 880 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:09:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-03 21:09:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 286. [2025-03-03 21:09:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 216 states have (on average 1.4490740740740742) internal successors, (313), 217 states have internal predecessors, (313), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:09:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 445 transitions. [2025-03-03 21:09:22,120 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 445 transitions. Word has length 202 [2025-03-03 21:09:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:22,121 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 445 transitions. [2025-03-03 21:09:22,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:09:22,121 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 445 transitions. [2025-03-03 21:09:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 21:09:22,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:22,123 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:22,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:09:22,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:22,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash 902758567, now seen corresponding path program 1 times [2025-03-03 21:09:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:22,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649377932] [2025-03-03 21:09:22,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:22,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:22,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 21:09:22,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 21:09:22,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:22,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:09:22,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:23,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649377932] [2025-03-03 21:09:23,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649377932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:23,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:23,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 21:09:23,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573265822] [2025-03-03 21:09:23,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:23,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:09:23,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:23,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:09:23,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:09:23,001 INFO L87 Difference]: Start difference. First operand 286 states and 445 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:09:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:23,560 INFO L93 Difference]: Finished difference Result 719 states and 1122 transitions. [2025-03-03 21:09:23,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:09:23,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-03 21:09:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:23,563 INFO L225 Difference]: With dead ends: 719 [2025-03-03 21:09:23,563 INFO L226 Difference]: Without dead ends: 502 [2025-03-03 21:09:23,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:09:23,564 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 270 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:23,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 730 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:09:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-03 21:09:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 328. [2025-03-03 21:09:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 259 states have internal predecessors, (384), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:09:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 516 transitions. [2025-03-03 21:09:23,588 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 516 transitions. Word has length 202 [2025-03-03 21:09:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:23,588 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 516 transitions. [2025-03-03 21:09:23,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:09:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 516 transitions. [2025-03-03 21:09:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 21:09:23,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:23,590 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:23,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:09:23,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:23,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:23,590 INFO L85 PathProgramCache]: Analyzing trace with hash -830475766, now seen corresponding path program 1 times [2025-03-03 21:09:23,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:23,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222087178] [2025-03-03 21:09:23,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:23,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:23,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 21:09:23,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 21:09:23,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:23,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:09:24,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:24,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222087178] [2025-03-03 21:09:24,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222087178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:24,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:24,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 21:09:24,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595183167] [2025-03-03 21:09:24,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:24,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:09:24,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:24,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:09:24,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:09:24,030 INFO L87 Difference]: Start difference. First operand 328 states and 516 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:09:24,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:24,607 INFO L93 Difference]: Finished difference Result 890 states and 1376 transitions. [2025-03-03 21:09:24,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:09:24,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-03-03 21:09:24,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:24,610 INFO L225 Difference]: With dead ends: 890 [2025-03-03 21:09:24,611 INFO L226 Difference]: Without dead ends: 673 [2025-03-03 21:09:24,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:09:24,612 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 778 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:24,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 906 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:09:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-03 21:09:24,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 331. [2025-03-03 21:09:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 261 states have (on average 1.4904214559386972) internal successors, (389), 262 states have internal predecessors, (389), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:09:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 521 transitions. [2025-03-03 21:09:24,641 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 521 transitions. Word has length 202 [2025-03-03 21:09:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:24,641 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 521 transitions. [2025-03-03 21:09:24,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:09:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 521 transitions. [2025-03-03 21:09:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 21:09:24,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:24,642 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:24,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:09:24,643 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:24,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1153502676, now seen corresponding path program 1 times [2025-03-03 21:09:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:24,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820492555] [2025-03-03 21:09:24,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:24,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:24,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 21:09:24,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 21:09:24,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:24,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:09:33,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:33,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820492555] [2025-03-03 21:09:33,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820492555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:33,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:33,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 21:09:33,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764798984] [2025-03-03 21:09:33,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:33,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:09:33,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:33,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:09:33,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:09:33,439 INFO L87 Difference]: Start difference. First operand 331 states and 521 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:09:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:35,719 INFO L93 Difference]: Finished difference Result 824 states and 1266 transitions. [2025-03-03 21:09:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 21:09:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2025-03-03 21:09:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:35,723 INFO L225 Difference]: With dead ends: 824 [2025-03-03 21:09:35,723 INFO L226 Difference]: Without dead ends: 607 [2025-03-03 21:09:35,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2025-03-03 21:09:35,725 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 924 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:35,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 699 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 21:09:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-03 21:09:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 359. [2025-03-03 21:09:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 289 states have (on average 1.4982698961937717) internal successors, (433), 290 states have internal predecessors, (433), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:09:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 565 transitions. [2025-03-03 21:09:35,758 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 565 transitions. Word has length 203 [2025-03-03 21:09:35,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:35,760 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 565 transitions. [2025-03-03 21:09:35,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:09:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 565 transitions. [2025-03-03 21:09:35,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 21:09:35,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:35,763 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:35,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:09:35,763 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:35,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:35,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2144392267, now seen corresponding path program 1 times [2025-03-03 21:09:35,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:35,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255778220] [2025-03-03 21:09:35,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:35,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:35,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 21:09:35,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 21:09:35,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:35,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:09:45,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:45,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255778220] [2025-03-03 21:09:45,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255778220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:45,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:45,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:09:45,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317848186] [2025-03-03 21:09:45,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:45,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:09:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:45,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:09:45,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:09:45,445 INFO L87 Difference]: Start difference. First operand 359 states and 565 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:09:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:47,821 INFO L93 Difference]: Finished difference Result 800 states and 1236 transitions. [2025-03-03 21:09:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:09:47,821 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-03 21:09:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:47,823 INFO L225 Difference]: With dead ends: 800 [2025-03-03 21:09:47,823 INFO L226 Difference]: Without dead ends: 583 [2025-03-03 21:09:47,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:09:47,824 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 724 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:47,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 715 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 21:09:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-03 21:09:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 359. [2025-03-03 21:09:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 289 states have (on average 1.4982698961937717) internal successors, (433), 290 states have internal predecessors, (433), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:09:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 565 transitions. [2025-03-03 21:09:47,852 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 565 transitions. Word has length 203 [2025-03-03 21:09:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:47,853 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 565 transitions. [2025-03-03 21:09:47,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:09:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 565 transitions. [2025-03-03 21:09:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 21:09:47,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:47,855 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:47,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:09:47,856 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:47,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1997974547, now seen corresponding path program 1 times [2025-03-03 21:09:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:47,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055139383] [2025-03-03 21:09:47,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:47,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 21:09:47,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 21:09:47,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:47,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:09:48,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:48,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055139383] [2025-03-03 21:09:48,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055139383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:48,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:48,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:09:48,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964753587] [2025-03-03 21:09:48,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:48,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:09:48,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:48,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:09:48,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:09:48,179 INFO L87 Difference]: Start difference. First operand 359 states and 565 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:09:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:48,482 INFO L93 Difference]: Finished difference Result 696 states and 1085 transitions. [2025-03-03 21:09:48,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:09:48,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-03 21:09:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:48,485 INFO L225 Difference]: With dead ends: 696 [2025-03-03 21:09:48,485 INFO L226 Difference]: Without dead ends: 467 [2025-03-03 21:09:48,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:09:48,486 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 175 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:48,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 575 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:09:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-03 21:09:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 359. [2025-03-03 21:09:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 289 states have (on average 1.4740484429065743) internal successors, (426), 290 states have internal predecessors, (426), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:09:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 558 transitions. [2025-03-03 21:09:48,510 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 558 transitions. Word has length 203 [2025-03-03 21:09:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:48,510 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 558 transitions. [2025-03-03 21:09:48,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:09:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 558 transitions. [2025-03-03 21:09:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 21:09:48,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:48,512 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:48,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:09:48,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:48,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1103408331, now seen corresponding path program 1 times [2025-03-03 21:09:48,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:48,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305203730] [2025-03-03 21:09:48,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:48,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:48,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 21:09:48,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 21:09:48,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:48,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:09:56,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:56,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305203730] [2025-03-03 21:09:56,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305203730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:56,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:56,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 21:09:56,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290550868] [2025-03-03 21:09:56,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:56,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 21:09:56,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:56,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 21:09:56,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:09:56,408 INFO L87 Difference]: Start difference. First operand 359 states and 558 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:09:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:58,206 INFO L93 Difference]: Finished difference Result 755 states and 1157 transitions. [2025-03-03 21:09:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:09:58,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-03 21:09:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:58,209 INFO L225 Difference]: With dead ends: 755 [2025-03-03 21:09:58,209 INFO L226 Difference]: Without dead ends: 538 [2025-03-03 21:09:58,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:09:58,211 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 503 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:58,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 670 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:09:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-03 21:09:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 361. [2025-03-03 21:09:58,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 291 states have (on average 1.470790378006873) internal successors, (428), 292 states have internal predecessors, (428), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:09:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 560 transitions. [2025-03-03 21:09:58,234 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 560 transitions. Word has length 203 [2025-03-03 21:09:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:58,234 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 560 transitions. [2025-03-03 21:09:58,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:09:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 560 transitions. [2025-03-03 21:09:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 21:09:58,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:58,238 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:58,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:09:58,238 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:58,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash 106335978, now seen corresponding path program 1 times [2025-03-03 21:09:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:58,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433700592] [2025-03-03 21:09:58,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:58,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:58,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 21:09:58,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 21:09:58,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:58,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:10:04,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:04,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433700592] [2025-03-03 21:10:04,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433700592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:04,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 21:10:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021456130] [2025-03-03 21:10:04,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:04,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 21:10:04,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:04,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 21:10:04,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:10:04,775 INFO L87 Difference]: Start difference. First operand 361 states and 560 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:10:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:07,022 INFO L93 Difference]: Finished difference Result 697 states and 1074 transitions. [2025-03-03 21:10:07,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:10:07,023 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-03 21:10:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:07,025 INFO L225 Difference]: With dead ends: 697 [2025-03-03 21:10:07,025 INFO L226 Difference]: Without dead ends: 459 [2025-03-03 21:10:07,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:10:07,026 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 260 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:07,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 531 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:10:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-03 21:10:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 360. [2025-03-03 21:10:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 290 states have (on average 1.4689655172413794) internal successors, (426), 291 states have internal predecessors, (426), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:10:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 558 transitions. [2025-03-03 21:10:07,048 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 558 transitions. Word has length 203 [2025-03-03 21:10:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:07,048 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 558 transitions. [2025-03-03 21:10:07,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:10:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 558 transitions. [2025-03-03 21:10:07,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 21:10:07,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:07,050 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:07,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:10:07,050 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:07,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:07,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1445947746, now seen corresponding path program 1 times [2025-03-03 21:10:07,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:07,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505679180] [2025-03-03 21:10:07,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:07,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:07,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 21:10:07,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 21:10:07,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:07,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:10:13,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:13,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505679180] [2025-03-03 21:10:13,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505679180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:13,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:13,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:10:13,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998016461] [2025-03-03 21:10:13,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:13,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:10:13,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:13,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:10:13,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:10:13,225 INFO L87 Difference]: Start difference. First operand 360 states and 558 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:10:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:15,667 INFO L93 Difference]: Finished difference Result 1193 states and 1800 transitions. [2025-03-03 21:10:15,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 21:10:15,668 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2025-03-03 21:10:15,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:15,671 INFO L225 Difference]: With dead ends: 1193 [2025-03-03 21:10:15,671 INFO L226 Difference]: Without dead ends: 955 [2025-03-03 21:10:15,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 21:10:15,672 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1137 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:15,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 1047 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:10:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-03 21:10:15,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 372. [2025-03-03 21:10:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 302 states have (on average 1.4735099337748345) internal successors, (445), 303 states have internal predecessors, (445), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:10:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 577 transitions. [2025-03-03 21:10:15,695 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 577 transitions. Word has length 203 [2025-03-03 21:10:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:15,695 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 577 transitions. [2025-03-03 21:10:15,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:10:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 577 transitions. [2025-03-03 21:10:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 21:10:15,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:15,696 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:15,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:10:15,697 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:15,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:15,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1951506371, now seen corresponding path program 1 times [2025-03-03 21:10:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:15,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022369844] [2025-03-03 21:10:15,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:15,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:15,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 21:10:15,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 21:10:15,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:15,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:10:21,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:21,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022369844] [2025-03-03 21:10:21,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022369844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:21,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:21,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:10:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622195550] [2025-03-03 21:10:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:21,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:10:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:21,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:10:21,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:10:21,135 INFO L87 Difference]: Start difference. First operand 372 states and 577 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:10:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:22,738 INFO L93 Difference]: Finished difference Result 998 states and 1536 transitions. [2025-03-03 21:10:22,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:10:22,739 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2025-03-03 21:10:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:22,741 INFO L225 Difference]: With dead ends: 998 [2025-03-03 21:10:22,741 INFO L226 Difference]: Without dead ends: 756 [2025-03-03 21:10:22,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2025-03-03 21:10:22,743 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1116 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:22,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 984 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:10:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-03-03 21:10:22,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 402. [2025-03-03 21:10:22,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 332 states have (on average 1.4819277108433735) internal successors, (492), 333 states have internal predecessors, (492), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:10:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 624 transitions. [2025-03-03 21:10:22,771 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 624 transitions. Word has length 203 [2025-03-03 21:10:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:22,772 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 624 transitions. [2025-03-03 21:10:22,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:10:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 624 transitions. [2025-03-03 21:10:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 21:10:22,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:22,773 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:22,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 21:10:22,774 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:22,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:22,774 INFO L85 PathProgramCache]: Analyzing trace with hash -92638049, now seen corresponding path program 1 times [2025-03-03 21:10:22,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:22,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084739228] [2025-03-03 21:10:22,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:22,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:22,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 21:10:22,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 21:10:22,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:22,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat