./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_codestructure_steplocals_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 87d97b8e30b2a31a4876e057488e2e87126da257ca4324c4e70a282f34f137aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:25:03,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:25:03,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:25:03,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:25:03,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:25:03,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:25:03,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:25:03,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:25:03,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:25:03,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:25:03,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:25:03,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:25:03,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:25:03,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:25:03,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:25:03,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:25:03,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:25:03,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:25:03,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:25:03,322 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:25:03,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:25:03,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:25:03,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:25:03,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:25:03,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:25:03,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:25:03,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:25:03,322 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 -> 87d97b8e30b2a31a4876e057488e2e87126da257ca4324c4e70a282f34f137aa [2025-03-16 23:25:03,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:25:03,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:25:03,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:25:03,550 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:25:03,550 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:25:03,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-81.i [2025-03-16 23:25:04,646 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b63bfac6/0fbeab8b6c36444aafae3ab5a15dbe9a/FLAG37d6047ad [2025-03-16 23:25:04,904 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:25:04,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-81.i [2025-03-16 23:25:04,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b63bfac6/0fbeab8b6c36444aafae3ab5a15dbe9a/FLAG37d6047ad [2025-03-16 23:25:05,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b63bfac6/0fbeab8b6c36444aafae3ab5a15dbe9a [2025-03-16 23:25:05,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:25:05,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:25:05,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:25:05,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:25:05,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:25:05,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77900e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05, skipping insertion in model container [2025-03-16 23:25:05,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:25:05,336 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_codestructure_steplocals_file-81.i[917,930] [2025-03-16 23:25:05,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:25:05,407 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:25:05,415 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_codestructure_steplocals_file-81.i[917,930] [2025-03-16 23:25:05,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:25:05,443 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:25:05,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05 WrapperNode [2025-03-16 23:25:05,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:25:05,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:25:05,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:25:05,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:25:05,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,483 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-03-16 23:25:05,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:25:05,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:25:05,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:25:05,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:25:05,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,510 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-16 23:25:05,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:25:05,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:25:05,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:25:05,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:25:05,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (1/1) ... [2025-03-16 23:25:05,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:25:05,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:25:05,560 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-16 23:25:05,564 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-16 23:25:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:25:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:25:05,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:25:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:25:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:25:05,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:25:05,634 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:25:05,635 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:25:05,884 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L138: havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-03-16 23:25:05,905 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 23:25:05,906 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:25:05,916 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:25:05,917 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:25:05,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:25:05 BoogieIcfgContainer [2025-03-16 23:25:05,917 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:25:05,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:25:05,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:25:05,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:25:05,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:25:05" (1/3) ... [2025-03-16 23:25:05,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584b1df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:25:05, skipping insertion in model container [2025-03-16 23:25:05,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:25:05" (2/3) ... [2025-03-16 23:25:05,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584b1df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:25:05, skipping insertion in model container [2025-03-16 23:25:05,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:25:05" (3/3) ... [2025-03-16 23:25:05,923 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-81.i [2025-03-16 23:25:05,933 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:25:05,934 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-81.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:25:05,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:25:05,979 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;@577f67e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:25:05,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:25:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-16 23:25:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-16 23:25:05,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:25:05,996 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:25:05,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:25:06,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:25:06,000 INFO L85 PathProgramCache]: Analyzing trace with hash -797509999, now seen corresponding path program 1 times [2025-03-16 23:25:06,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:25:06,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293307727] [2025-03-16 23:25:06,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:25:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:25:06,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-16 23:25:06,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-16 23:25:06,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:25:06,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:25:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:25:14,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:25:14,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293307727] [2025-03-16 23:25:14,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293307727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:25:14,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:25:14,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 23:25:14,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757035813] [2025-03-16 23:25:14,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:25:14,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 23:25:14,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:25:14,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 23:25:14,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:25:14,692 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:25:15,833 INFO L93 Difference]: Finished difference Result 291 states and 502 transitions. [2025-03-16 23:25:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 23:25:15,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 193 [2025-03-16 23:25:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:25:15,844 INFO L225 Difference]: With dead ends: 291 [2025-03-16 23:25:15,845 INFO L226 Difference]: Without dead ends: 211 [2025-03-16 23:25:15,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:25:15,849 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 254 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:25:15,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 504 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:25:15,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-16 23:25:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2025-03-16 23:25:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 83 states have internal predecessors, (115), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-16 23:25:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 191 transitions. [2025-03-16 23:25:15,907 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 191 transitions. Word has length 193 [2025-03-16 23:25:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:25:15,909 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 191 transitions. [2025-03-16 23:25:15,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 191 transitions. [2025-03-16 23:25:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-16 23:25:15,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:25:15,916 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:25:15,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 23:25:15,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:25:15,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:25:15,919 INFO L85 PathProgramCache]: Analyzing trace with hash -668427280, now seen corresponding path program 1 times [2025-03-16 23:25:15,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:25:15,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185903624] [2025-03-16 23:25:15,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:25:15,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:25:15,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-16 23:25:15,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-16 23:25:15,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:25:15,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:25:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:25:22,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:25:22,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185903624] [2025-03-16 23:25:22,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185903624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:25:22,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:25:22,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 23:25:22,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501897885] [2025-03-16 23:25:22,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:25:22,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 23:25:22,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:25:22,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 23:25:22,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:25:22,833 INFO L87 Difference]: Start difference. First operand 123 states and 191 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:25:24,137 INFO L93 Difference]: Finished difference Result 306 states and 464 transitions. [2025-03-16 23:25:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 23:25:24,137 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 193 [2025-03-16 23:25:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:25:24,139 INFO L225 Difference]: With dead ends: 306 [2025-03-16 23:25:24,139 INFO L226 Difference]: Without dead ends: 184 [2025-03-16 23:25:24,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:25:24,140 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 214 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:25:24,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 383 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 23:25:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-16 23:25:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 122. [2025-03-16 23:25:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 82 states have internal predecessors, (113), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-16 23:25:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 189 transitions. [2025-03-16 23:25:24,163 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 189 transitions. Word has length 193 [2025-03-16 23:25:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:25:24,165 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 189 transitions. [2025-03-16 23:25:24,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 189 transitions. [2025-03-16 23:25:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-16 23:25:24,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:25:24,167 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:25:24,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:25:24,167 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:25:24,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:25:24,167 INFO L85 PathProgramCache]: Analyzing trace with hash 710041810, now seen corresponding path program 1 times [2025-03-16 23:25:24,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:25:24,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450338053] [2025-03-16 23:25:24,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:25:24,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:25:24,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-16 23:25:24,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-16 23:25:24,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:25:24,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:25:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:25:24,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:25:24,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450338053] [2025-03-16 23:25:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450338053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:25:24,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:25:24,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:25:24,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91229186] [2025-03-16 23:25:24,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:25:24,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:25:24,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:25:24,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:25:24,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:25:24,313 INFO L87 Difference]: Start difference. First operand 122 states and 189 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:25:24,545 INFO L93 Difference]: Finished difference Result 335 states and 519 transitions. [2025-03-16 23:25:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:25:24,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 193 [2025-03-16 23:25:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:25:24,549 INFO L225 Difference]: With dead ends: 335 [2025-03-16 23:25:24,549 INFO L226 Difference]: Without dead ends: 214 [2025-03-16 23:25:24,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:25:24,550 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 65 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:25:24,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 326 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:25:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-16 23:25:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2025-03-16 23:25:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 131 states have (on average 1.3511450381679388) internal successors, (177), 133 states have internal predecessors, (177), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-16 23:25:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 329 transitions. [2025-03-16 23:25:24,584 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 329 transitions. Word has length 193 [2025-03-16 23:25:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:25:24,584 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 329 transitions. [2025-03-16 23:25:24,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 329 transitions. [2025-03-16 23:25:24,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 23:25:24,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:25:24,586 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:25:24,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:25:24,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:25:24,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:25:24,587 INFO L85 PathProgramCache]: Analyzing trace with hash -502470249, now seen corresponding path program 1 times [2025-03-16 23:25:24,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:25:24,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187728224] [2025-03-16 23:25:24,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:25:24,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:25:24,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 23:25:24,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 23:25:24,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:25:24,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:25:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:25:24,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:25:24,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187728224] [2025-03-16 23:25:24,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187728224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:25:24,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:25:24,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:25:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935284128] [2025-03-16 23:25:24,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:25:24,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:25:24,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:25:24,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:25:24,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:25:24,635 INFO L87 Difference]: Start difference. First operand 212 states and 329 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:25:24,698 INFO L93 Difference]: Finished difference Result 521 states and 803 transitions. [2025-03-16 23:25:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:25:24,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-16 23:25:24,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:25:24,701 INFO L225 Difference]: With dead ends: 521 [2025-03-16 23:25:24,701 INFO L226 Difference]: Without dead ends: 323 [2025-03-16 23:25:24,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:25:24,702 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 51 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:25:24,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 255 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:25:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-16 23:25:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2025-03-16 23:25:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 209 states have (on average 1.3397129186602872) internal successors, (280), 214 states have internal predecessors, (280), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-16 23:25:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 484 transitions. [2025-03-16 23:25:24,758 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 484 transitions. Word has length 194 [2025-03-16 23:25:24,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:25:24,759 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 484 transitions. [2025-03-16 23:25:24,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 484 transitions. [2025-03-16 23:25:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 23:25:24,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:25:24,761 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:25:24,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:25:24,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:25:24,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:25:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash 385033432, now seen corresponding path program 1 times [2025-03-16 23:25:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:25:24,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95181494] [2025-03-16 23:25:24,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:25:24,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:25:24,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 23:25:24,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 23:25:24,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:25:24,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:25:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:25:28,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:25:28,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95181494] [2025-03-16 23:25:28,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95181494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:25:28,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:25:28,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:25:28,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996289600] [2025-03-16 23:25:28,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:25:28,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:25:28,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:25:28,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:25:28,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:25:28,228 INFO L87 Difference]: Start difference. First operand 319 states and 484 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:25:28,669 INFO L93 Difference]: Finished difference Result 579 states and 863 transitions. [2025-03-16 23:25:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:25:28,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-16 23:25:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:25:28,673 INFO L225 Difference]: With dead ends: 579 [2025-03-16 23:25:28,673 INFO L226 Difference]: Without dead ends: 390 [2025-03-16 23:25:28,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:25:28,674 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 189 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:25:28,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 595 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:25:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-16 23:25:28,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 327. [2025-03-16 23:25:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 217 states have (on average 1.3456221198156681) internal successors, (292), 222 states have internal predecessors, (292), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-16 23:25:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 496 transitions. [2025-03-16 23:25:28,720 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 496 transitions. Word has length 194 [2025-03-16 23:25:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:25:28,720 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 496 transitions. [2025-03-16 23:25:28,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 496 transitions. [2025-03-16 23:25:28,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 23:25:28,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:25:28,722 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:25:28,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:25:28,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:25:28,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:25:28,726 INFO L85 PathProgramCache]: Analyzing trace with hash 91630425, now seen corresponding path program 1 times [2025-03-16 23:25:28,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:25:28,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425465315] [2025-03-16 23:25:28,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:25:28,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:25:28,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 23:25:28,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 23:25:28,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:25:28,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:25:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:25:32,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:25:32,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425465315] [2025-03-16 23:25:32,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425465315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:25:32,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:25:32,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:25:32,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279613064] [2025-03-16 23:25:32,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:25:32,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:25:32,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:25:32,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:25:32,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:25:32,395 INFO L87 Difference]: Start difference. First operand 327 states and 496 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:25:32,743 INFO L93 Difference]: Finished difference Result 558 states and 837 transitions. [2025-03-16 23:25:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:25:32,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-16 23:25:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:25:32,745 INFO L225 Difference]: With dead ends: 558 [2025-03-16 23:25:32,745 INFO L226 Difference]: Without dead ends: 361 [2025-03-16 23:25:32,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:25:32,747 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 188 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:25:32,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 495 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:25:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-16 23:25:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 322. [2025-03-16 23:25:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 212 states have (on average 1.3396226415094339) internal successors, (284), 217 states have internal predecessors, (284), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-16 23:25:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 488 transitions. [2025-03-16 23:25:32,784 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 488 transitions. Word has length 194 [2025-03-16 23:25:32,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:25:32,784 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 488 transitions. [2025-03-16 23:25:32,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 488 transitions. [2025-03-16 23:25:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 23:25:32,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:25:32,786 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:25:32,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:25:32,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:25:32,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:25:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1935686312, now seen corresponding path program 1 times [2025-03-16 23:25:32,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:25:32,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718395800] [2025-03-16 23:25:32,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:25:32,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:25:32,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 23:25:32,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 23:25:32,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:25:32,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:25:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:25:40,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:25:40,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718395800] [2025-03-16 23:25:40,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718395800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:25:40,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:25:40,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:25:40,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169420047] [2025-03-16 23:25:40,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:25:40,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:25:40,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:25:40,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:25:40,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:25:40,989 INFO L87 Difference]: Start difference. First operand 322 states and 488 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:25:43,472 INFO L93 Difference]: Finished difference Result 621 states and 917 transitions. [2025-03-16 23:25:43,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 23:25:43,473 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-16 23:25:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:25:43,475 INFO L225 Difference]: With dead ends: 621 [2025-03-16 23:25:43,475 INFO L226 Difference]: Without dead ends: 429 [2025-03-16 23:25:43,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2025-03-16 23:25:43,480 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 352 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:25:43,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 767 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 23:25:43,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-16 23:25:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 328. [2025-03-16 23:25:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 218 states have (on average 1.353211009174312) internal successors, (295), 223 states have internal predecessors, (295), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-16 23:25:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 499 transitions. [2025-03-16 23:25:43,523 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 499 transitions. Word has length 194 [2025-03-16 23:25:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:25:43,524 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 499 transitions. [2025-03-16 23:25:43,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 499 transitions. [2025-03-16 23:25:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 23:25:43,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:25:43,525 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:25:43,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:25:43,526 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:25:43,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:25:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash 562329625, now seen corresponding path program 1 times [2025-03-16 23:25:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:25:43,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670883622] [2025-03-16 23:25:43,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:25:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:25:43,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 23:25:43,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 23:25:43,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:25:43,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:25:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:25:43,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:25:43,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670883622] [2025-03-16 23:25:43,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670883622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:25:43,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:25:43,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 23:25:43,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801559660] [2025-03-16 23:25:43,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:25:43,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 23:25:43,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:25:43,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 23:25:43,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 23:25:43,680 INFO L87 Difference]: Start difference. First operand 328 states and 499 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:25:43,952 INFO L93 Difference]: Finished difference Result 731 states and 1108 transitions. [2025-03-16 23:25:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:25:43,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-16 23:25:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:25:43,957 INFO L225 Difference]: With dead ends: 731 [2025-03-16 23:25:43,958 INFO L226 Difference]: Without dead ends: 533 [2025-03-16 23:25:43,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:25:43,959 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 216 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:25:43,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 486 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:25:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-16 23:25:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 372. [2025-03-16 23:25:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 255 states have (on average 1.3647058823529412) internal successors, (348), 261 states have internal predecessors, (348), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 102 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-16 23:25:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 564 transitions. [2025-03-16 23:25:44,024 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 564 transitions. Word has length 194 [2025-03-16 23:25:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:25:44,025 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 564 transitions. [2025-03-16 23:25:44,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 564 transitions. [2025-03-16 23:25:44,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 23:25:44,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:25:44,027 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:25:44,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:25:44,028 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:25:44,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:25:44,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1806603593, now seen corresponding path program 1 times [2025-03-16 23:25:44,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:25:44,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075999581] [2025-03-16 23:25:44,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:25:44,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:25:44,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 23:25:44,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 23:25:44,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:25:44,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:25:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:25:49,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:25:49,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075999581] [2025-03-16 23:25:49,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075999581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:25:49,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:25:49,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:25:49,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083992173] [2025-03-16 23:25:49,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:25:49,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:25:49,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:25:49,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:25:49,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:25:49,554 INFO L87 Difference]: Start difference. First operand 372 states and 564 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:25:51,456 INFO L93 Difference]: Finished difference Result 906 states and 1333 transitions. [2025-03-16 23:25:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 23:25:51,459 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-16 23:25:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:25:51,464 INFO L225 Difference]: With dead ends: 906 [2025-03-16 23:25:51,464 INFO L226 Difference]: Without dead ends: 535 [2025-03-16 23:25:51,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2025-03-16 23:25:51,466 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 432 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:25:51,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 753 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 23:25:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-16 23:25:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 318. [2025-03-16 23:25:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 213 states have (on average 1.3474178403755868) internal successors, (287), 217 states have internal predecessors, (287), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-16 23:25:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 479 transitions. [2025-03-16 23:25:51,518 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 479 transitions. Word has length 194 [2025-03-16 23:25:51,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:25:51,519 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 479 transitions. [2025-03-16 23:25:51,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 479 transitions. [2025-03-16 23:25:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 23:25:51,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:25:51,520 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:25:51,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 23:25:51,521 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:25:51,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:25:51,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2065877977, now seen corresponding path program 1 times [2025-03-16 23:25:51,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:25:51,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659424302] [2025-03-16 23:25:51,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:25:51,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:25:51,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 23:25:51,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 23:25:51,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:25:51,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:25:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:25:51,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:25:51,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659424302] [2025-03-16 23:25:51,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659424302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:25:51,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:25:51,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:25:51,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182440772] [2025-03-16 23:25:51,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:25:51,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:25:51,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:25:51,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:25:51,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:25:51,619 INFO L87 Difference]: Start difference. First operand 318 states and 479 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:25:51,720 INFO L93 Difference]: Finished difference Result 641 states and 959 transitions. [2025-03-16 23:25:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:25:51,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-16 23:25:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:25:51,723 INFO L225 Difference]: With dead ends: 641 [2025-03-16 23:25:51,723 INFO L226 Difference]: Without dead ends: 324 [2025-03-16 23:25:51,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-16 23:25:51,724 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 70 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:25:51,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 338 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:25:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-16 23:25:51,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 300. [2025-03-16 23:25:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 200 states have (on average 1.32) internal successors, (264), 203 states have internal predecessors, (264), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 23:25:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 444 transitions. [2025-03-16 23:25:51,761 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 444 transitions. Word has length 194 [2025-03-16 23:25:51,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:25:51,762 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 444 transitions. [2025-03-16 23:25:51,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 444 transitions. [2025-03-16 23:25:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 23:25:51,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:25:51,763 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:25:51,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 23:25:51,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:25:51,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:25:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash 268926618, now seen corresponding path program 1 times [2025-03-16 23:25:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:25:51,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082179659] [2025-03-16 23:25:51,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:25:51,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:25:51,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 23:25:51,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 23:25:51,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:25:51,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:25:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:25:55,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:25:55,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082179659] [2025-03-16 23:25:55,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082179659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:25:55,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:25:55,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:25:55,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170021488] [2025-03-16 23:25:55,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:25:55,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:25:55,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:25:55,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:25:55,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:25:55,559 INFO L87 Difference]: Start difference. First operand 300 states and 444 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:25:56,018 INFO L93 Difference]: Finished difference Result 663 states and 973 transitions. [2025-03-16 23:25:56,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:25:56,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-16 23:25:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:25:56,021 INFO L225 Difference]: With dead ends: 663 [2025-03-16 23:25:56,021 INFO L226 Difference]: Without dead ends: 364 [2025-03-16 23:25:56,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:25:56,023 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 110 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:25:56,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 462 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:25:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-16 23:25:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 311. [2025-03-16 23:25:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 211 states have (on average 1.3270142180094786) internal successors, (280), 214 states have internal predecessors, (280), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 23:25:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 460 transitions. [2025-03-16 23:25:56,071 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 460 transitions. Word has length 194 [2025-03-16 23:25:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:25:56,072 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 460 transitions. [2025-03-16 23:25:56,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:25:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 460 transitions. [2025-03-16 23:25:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 23:25:56,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:25:56,073 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:25:56,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 23:25:56,073 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:25:56,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:25:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash 398009337, now seen corresponding path program 1 times [2025-03-16 23:25:56,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:25:56,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540715381] [2025-03-16 23:25:56,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:25:56,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:25:56,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 23:25:56,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 23:25:56,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:25:56,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:26:00,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:00,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540715381] [2025-03-16 23:26:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540715381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:00,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:26:00,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:26:00,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177770991] [2025-03-16 23:26:00,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:00,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:26:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:00,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:26:00,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:26:00,099 INFO L87 Difference]: Start difference. First operand 311 states and 460 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:26:00,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:26:00,586 INFO L93 Difference]: Finished difference Result 663 states and 975 transitions. [2025-03-16 23:26:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:26:00,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-16 23:26:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:26:00,589 INFO L225 Difference]: With dead ends: 663 [2025-03-16 23:26:00,589 INFO L226 Difference]: Without dead ends: 353 [2025-03-16 23:26:00,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:26:00,591 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 54 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:26:00,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 538 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:26:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-16 23:26:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2025-03-16 23:26:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 211 states have (on average 1.3270142180094786) internal successors, (280), 214 states have internal predecessors, (280), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 23:26:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 460 transitions. [2025-03-16 23:26:00,640 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 460 transitions. Word has length 194 [2025-03-16 23:26:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:26:00,641 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 460 transitions. [2025-03-16 23:26:00,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:26:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 460 transitions. [2025-03-16 23:26:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 23:26:00,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:00,642 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:26:00,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 23:26:00,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:00,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash -125500745, now seen corresponding path program 1 times [2025-03-16 23:26:00,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:00,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385233630] [2025-03-16 23:26:00,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:00,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:00,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 23:26:00,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 23:26:00,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:00,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:26:03,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:03,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385233630] [2025-03-16 23:26:03,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385233630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:03,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:26:03,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:26:03,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506313180] [2025-03-16 23:26:03,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:03,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:26:03,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:03,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:26:03,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:26:03,500 INFO L87 Difference]: Start difference. First operand 311 states and 460 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:26:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:26:03,884 INFO L93 Difference]: Finished difference Result 732 states and 1070 transitions. [2025-03-16 23:26:03,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:26:03,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-16 23:26:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:26:03,887 INFO L225 Difference]: With dead ends: 732 [2025-03-16 23:26:03,887 INFO L226 Difference]: Without dead ends: 422 [2025-03-16 23:26:03,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:26:03,888 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 123 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:26:03,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 378 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:26:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-16 23:26:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 332. [2025-03-16 23:26:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 232 states have (on average 1.331896551724138) internal successors, (309), 235 states have internal predecessors, (309), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 23:26:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 489 transitions. [2025-03-16 23:26:03,928 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 489 transitions. Word has length 194 [2025-03-16 23:26:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:26:03,928 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 489 transitions. [2025-03-16 23:26:03,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:26:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 489 transitions. [2025-03-16 23:26:03,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 23:26:03,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:03,929 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:26:03,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 23:26:03,929 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:03,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:03,929 INFO L85 PathProgramCache]: Analyzing trace with hash -418903752, now seen corresponding path program 1 times [2025-03-16 23:26:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786958401] [2025-03-16 23:26:03,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:03,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:03,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 23:26:03,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 23:26:03,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:03,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-16 23:26:07,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:07,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786958401] [2025-03-16 23:26:07,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786958401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:07,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:26:07,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:26:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370276233] [2025-03-16 23:26:07,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:07,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:26:07,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:07,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:26:07,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:26:07,108 INFO L87 Difference]: Start difference. First operand 332 states and 489 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:26:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:26:07,568 INFO L93 Difference]: Finished difference Result 714 states and 1046 transitions. [2025-03-16 23:26:07,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:26:07,569 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-16 23:26:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:26:07,571 INFO L225 Difference]: With dead ends: 714 [2025-03-16 23:26:07,571 INFO L226 Difference]: Without dead ends: 383 [2025-03-16 23:26:07,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:26:07,573 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 164 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:26:07,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 221 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:26:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-16 23:26:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 330. [2025-03-16 23:26:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 230 states have (on average 1.3347826086956522) internal successors, (307), 233 states have internal predecessors, (307), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 23:26:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 487 transitions. [2025-03-16 23:26:07,619 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 487 transitions. Word has length 194 [2025-03-16 23:26:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:26:07,620 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 487 transitions. [2025-03-16 23:26:07,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-16 23:26:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 487 transitions. [2025-03-16 23:26:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-16 23:26:07,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:07,621 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:26:07,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 23:26:07,621 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:07,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1565637615, now seen corresponding path program 1 times [2025-03-16 23:26:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:07,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616015618] [2025-03-16 23:26:07,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:07,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:07,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 23:26:07,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 23:26:07,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:07,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat