./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.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 ba821d92d2796d52ea5c7f089d2638cf5b82e930c6cce78adee479c044ea4833 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:10:27,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:10:27,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:10:27,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:10:27,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:10:27,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:10:27,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:10:27,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:10:27,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:10:27,463 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:10:27,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:10:27,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:10:27,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:10:27,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:10:27,463 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:10:27,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:10:27,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:10:27,464 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:10:27,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:10:27,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:10:27,465 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:10:27,465 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:10:27,465 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:10:27,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:10:27,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:10:27,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:10:27,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:10:27,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:10:27,465 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 -> ba821d92d2796d52ea5c7f089d2638cf5b82e930c6cce78adee479c044ea4833 [2025-03-04 00:10:27,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:10:27,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:10:27,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:10:27,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:10:27,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:10:27,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.i [2025-03-04 00:10:28,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba08153d0/69de77bc8c3f493e8caad00b373f718d/FLAGb7639482a [2025-03-04 00:10:29,265 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:10:29,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.i [2025-03-04 00:10:29,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba08153d0/69de77bc8c3f493e8caad00b373f718d/FLAGb7639482a [2025-03-04 00:10:29,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba08153d0/69de77bc8c3f493e8caad00b373f718d [2025-03-04 00:10:29,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:10:29,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:10:29,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:10:29,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:10:29,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:10:29,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:29,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@546739e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29, skipping insertion in model container [2025-03-04 00:10:29,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:29,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:10:29,652 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_operatoramount_amount250_file-37.i[916,929] [2025-03-04 00:10:29,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:10:29,781 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:10:29,790 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_operatoramount_amount250_file-37.i[916,929] [2025-03-04 00:10:29,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:10:29,875 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:10:29,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29 WrapperNode [2025-03-04 00:10:29,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:10:29,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:10:29,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:10:29,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:10:29,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:29,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:29,946 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 385 [2025-03-04 00:10:29,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:10:29,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:10:29,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:10:29,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:10:29,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:29,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:29,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:30,000 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-04 00:10:30,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:30,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:30,020 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:30,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:30,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:30,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:30,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:10:30,037 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:10:30,037 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:10:30,037 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:10:30,038 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:30,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:10:30,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:30,064 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-04 00:10:30,067 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-04 00:10:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:10:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:10:30,084 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:10:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:10:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:10:30,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:10:30,175 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:10:30,176 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:10:30,786 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L336: havoc property_#t~bitwise35#1;havoc property_#t~short36#1;havoc property_#t~bitwise37#1;havoc property_#t~short38#1; [2025-03-04 00:10:30,842 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-04 00:10:30,842 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:10:30,860 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:10:30,863 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:10:30,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:10:30 BoogieIcfgContainer [2025-03-04 00:10:30,863 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:10:30,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:10:30,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:10:30,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:10:30,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:10:29" (1/3) ... [2025-03-04 00:10:30,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741d4790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:10:30, skipping insertion in model container [2025-03-04 00:10:30,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29" (2/3) ... [2025-03-04 00:10:30,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741d4790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:10:30, skipping insertion in model container [2025-03-04 00:10:30,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:10:30" (3/3) ... [2025-03-04 00:10:30,872 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-37.i [2025-03-04 00:10:30,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:10:30,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-37.i that has 2 procedures, 161 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:10:30,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:10:30,947 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;@6368a89b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:10:30,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:10:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 108 states have internal predecessors, (156), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 00:10:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:10:30,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:30,991 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:30,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:30,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash -522544107, now seen corresponding path program 1 times [2025-03-04 00:10:31,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:31,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987916325] [2025-03-04 00:10:31,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:31,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:10:31,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:10:31,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:31,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-04 00:10:31,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:31,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987916325] [2025-03-04 00:10:31,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987916325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:31,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520458306] [2025-03-04 00:10:31,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:31,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:31,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:31,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:31,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:10:31,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:10:31,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:10:31,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:31,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:31,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:10:31,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-04 00:10:31,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:10:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520458306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:31,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:10:31,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:10:31,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092638408] [2025-03-04 00:10:31,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:31,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:10:31,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:31,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:10:31,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:10:31,774 INFO L87 Difference]: Start difference. First operand has 161 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 108 states have internal predecessors, (156), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-04 00:10:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:31,817 INFO L93 Difference]: Finished difference Result 316 states and 562 transitions. [2025-03-04 00:10:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:10:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) Word has length 333 [2025-03-04 00:10:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:31,826 INFO L225 Difference]: With dead ends: 316 [2025-03-04 00:10:31,827 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 00:10:31,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:10:31,834 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:31,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:10:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 00:10:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-04 00:10:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 105 states have (on average 1.438095238095238) internal successors, (151), 105 states have internal predecessors, (151), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 00:10:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 253 transitions. [2025-03-04 00:10:31,882 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 253 transitions. Word has length 333 [2025-03-04 00:10:31,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:31,883 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 253 transitions. [2025-03-04 00:10:31,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-04 00:10:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 253 transitions. [2025-03-04 00:10:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:10:31,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:31,892 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:31,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:32,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:10:32,094 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:32,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:32,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1694187790, now seen corresponding path program 1 times [2025-03-04 00:10:32,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:32,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531661110] [2025-03-04 00:10:32,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:32,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:32,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:10:32,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:10:32,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:32,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:10:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:32,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531661110] [2025-03-04 00:10:32,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531661110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:32,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:32,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:10:32,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355615323] [2025-03-04 00:10:32,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:32,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:10:32,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:32,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:10:32,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:32,469 INFO L87 Difference]: Start difference. First operand 158 states and 253 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:10:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:32,563 INFO L93 Difference]: Finished difference Result 466 states and 749 transitions. [2025-03-04 00:10:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:10:32,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-04 00:10:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:32,567 INFO L225 Difference]: With dead ends: 466 [2025-03-04 00:10:32,569 INFO L226 Difference]: Without dead ends: 311 [2025-03-04 00:10:32,571 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-04 00:10:32,573 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 246 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:32,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 723 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:10:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-04 00:10:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2025-03-04 00:10:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 204 states have (on average 1.4313725490196079) internal successors, (292), 204 states have internal predecessors, (292), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-04 00:10:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 496 transitions. [2025-03-04 00:10:32,628 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 496 transitions. Word has length 333 [2025-03-04 00:10:32,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:32,630 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 496 transitions. [2025-03-04 00:10:32,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:10:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 496 transitions. [2025-03-04 00:10:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:10:32,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:32,635 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:32,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:10:32,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:32,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1343387853, now seen corresponding path program 1 times [2025-03-04 00:10:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:32,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607056434] [2025-03-04 00:10:32,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:32,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:32,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:10:32,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:10:32,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:32,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:10:33,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:33,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607056434] [2025-03-04 00:10:33,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607056434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:33,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:33,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:10:33,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042821058] [2025-03-04 00:10:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:33,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:10:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:33,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:10:33,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:10:33,513 INFO L87 Difference]: Start difference. First operand 309 states and 496 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-04 00:10:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:34,213 INFO L93 Difference]: Finished difference Result 1005 states and 1599 transitions. [2025-03-04 00:10:34,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:10:34,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 333 [2025-03-04 00:10:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:34,221 INFO L225 Difference]: With dead ends: 1005 [2025-03-04 00:10:34,221 INFO L226 Difference]: Without dead ends: 699 [2025-03-04 00:10:34,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:10:34,223 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 867 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:34,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 816 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:10:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-04 00:10:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 627. [2025-03-04 00:10:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 414 states have (on average 1.4154589371980677) internal successors, (586), 414 states have internal predecessors, (586), 204 states have call successors, (204), 8 states have call predecessors, (204), 8 states have return successors, (204), 204 states have call predecessors, (204), 204 states have call successors, (204) [2025-03-04 00:10:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 994 transitions. [2025-03-04 00:10:34,333 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 994 transitions. Word has length 333 [2025-03-04 00:10:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:34,334 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 994 transitions. [2025-03-04 00:10:34,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-04 00:10:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 994 transitions. [2025-03-04 00:10:34,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:10:34,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:34,340 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:34,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:10:34,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:34,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2107107572, now seen corresponding path program 1 times [2025-03-04 00:10:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:34,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106930706] [2025-03-04 00:10:34,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:34,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:34,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:10:34,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:10:34,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:34,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:10:34,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:34,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106930706] [2025-03-04 00:10:34,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106930706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:34,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:34,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:10:34,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88745376] [2025-03-04 00:10:34,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:34,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:10:34,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:34,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:10:34,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:10:34,880 INFO L87 Difference]: Start difference. First operand 627 states and 994 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:10:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:35,130 INFO L93 Difference]: Finished difference Result 1845 states and 2881 transitions. [2025-03-04 00:10:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:10:35,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-04 00:10:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:35,139 INFO L225 Difference]: With dead ends: 1845 [2025-03-04 00:10:35,141 INFO L226 Difference]: Without dead ends: 1221 [2025-03-04 00:10:35,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:35,145 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 192 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:35,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 712 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:10:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-03-04 00:10:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 981. [2025-03-04 00:10:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 712 states have (on average 1.4438202247191012) internal successors, (1028), 716 states have internal predecessors, (1028), 252 states have call successors, (252), 16 states have call predecessors, (252), 16 states have return successors, (252), 248 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-04 00:10:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1532 transitions. [2025-03-04 00:10:35,262 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1532 transitions. Word has length 333 [2025-03-04 00:10:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:35,266 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1532 transitions. [2025-03-04 00:10:35,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:10:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1532 transitions. [2025-03-04 00:10:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:10:35,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:35,271 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:35,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:10:35,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:35,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1110035219, now seen corresponding path program 1 times [2025-03-04 00:10:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:35,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518727317] [2025-03-04 00:10:35,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:35,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:10:35,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:10:35,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:35,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:10:35,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:35,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518727317] [2025-03-04 00:10:35,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518727317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:35,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:35,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:10:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362721546] [2025-03-04 00:10:35,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:35,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:10:35,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:35,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:10:35,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:35,445 INFO L87 Difference]: Start difference. First operand 981 states and 1532 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:10:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:35,651 INFO L93 Difference]: Finished difference Result 2921 states and 4570 transitions. [2025-03-04 00:10:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:10:35,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-04 00:10:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:35,667 INFO L225 Difference]: With dead ends: 2921 [2025-03-04 00:10:35,668 INFO L226 Difference]: Without dead ends: 1943 [2025-03-04 00:10:35,670 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-04 00:10:35,672 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 242 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:35,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 526 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:10:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-03-04 00:10:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1941. [2025-03-04 00:10:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1404 states have (on average 1.4387464387464388) internal successors, (2020), 1412 states have internal predecessors, (2020), 504 states have call successors, (504), 32 states have call predecessors, (504), 32 states have return successors, (504), 496 states have call predecessors, (504), 504 states have call successors, (504) [2025-03-04 00:10:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 3028 transitions. [2025-03-04 00:10:35,892 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 3028 transitions. Word has length 333 [2025-03-04 00:10:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:35,893 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 3028 transitions. [2025-03-04 00:10:35,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:10:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 3028 transitions. [2025-03-04 00:10:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:10:35,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:35,901 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:35,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:10:35,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:35,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:35,904 INFO L85 PathProgramCache]: Analyzing trace with hash -967174124, now seen corresponding path program 1 times [2025-03-04 00:10:35,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:35,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387210117] [2025-03-04 00:10:35,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:35,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:35,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:10:35,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:10:35,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:35,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:10:36,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:36,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387210117] [2025-03-04 00:10:36,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387210117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:36,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:36,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:10:36,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656999996] [2025-03-04 00:10:36,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:36,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:10:36,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:36,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:10:36,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:36,206 INFO L87 Difference]: Start difference. First operand 1941 states and 3028 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:10:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:36,404 INFO L93 Difference]: Finished difference Result 5074 states and 7920 transitions. [2025-03-04 00:10:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:10:36,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-04 00:10:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:36,428 INFO L225 Difference]: With dead ends: 5074 [2025-03-04 00:10:36,428 INFO L226 Difference]: Without dead ends: 3136 [2025-03-04 00:10:36,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:36,435 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 138 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:36,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 535 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:10:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2025-03-04 00:10:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 3070. [2025-03-04 00:10:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2210 states have (on average 1.4389140271493213) internal successors, (3180), 2222 states have internal predecessors, (3180), 807 states have call successors, (807), 52 states have call predecessors, (807), 52 states have return successors, (807), 795 states have call predecessors, (807), 807 states have call successors, (807) [2025-03-04 00:10:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 4794 transitions. [2025-03-04 00:10:36,719 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 4794 transitions. Word has length 333 [2025-03-04 00:10:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:36,720 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 4794 transitions. [2025-03-04 00:10:36,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:10:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4794 transitions. [2025-03-04 00:10:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:10:36,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:36,725 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:36,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:10:36,725 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:36,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:36,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1648963308, now seen corresponding path program 1 times [2025-03-04 00:10:36,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:36,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929367800] [2025-03-04 00:10:36,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:36,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:10:37,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:10:37,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:37,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:10:37,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:37,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929367800] [2025-03-04 00:10:37,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929367800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:37,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:37,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:10:37,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003394134] [2025-03-04 00:10:37,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:37,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:10:37,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:37,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:10:37,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:10:37,574 INFO L87 Difference]: Start difference. First operand 3070 states and 4794 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:10:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:38,337 INFO L93 Difference]: Finished difference Result 9314 states and 14451 transitions. [2025-03-04 00:10:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:10:38,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-04 00:10:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:38,373 INFO L225 Difference]: With dead ends: 9314 [2025-03-04 00:10:38,373 INFO L226 Difference]: Without dead ends: 6368 [2025-03-04 00:10:38,384 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-04 00:10:38,385 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 294 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:38,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 762 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:10:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6368 states. [2025-03-04 00:10:38,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6368 to 5276. [2025-03-04 00:10:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5276 states, 3984 states have (on average 1.448293172690763) internal successors, (5770), 4020 states have internal predecessors, (5770), 1191 states have call successors, (1191), 100 states have call predecessors, (1191), 100 states have return successors, (1191), 1155 states have call predecessors, (1191), 1191 states have call successors, (1191) [2025-03-04 00:10:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 8152 transitions. [2025-03-04 00:10:38,736 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 8152 transitions. Word has length 333 [2025-03-04 00:10:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:38,738 INFO L471 AbstractCegarLoop]: Abstraction has 5276 states and 8152 transitions. [2025-03-04 00:10:38,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:10:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 8152 transitions. [2025-03-04 00:10:38,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:10:38,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:38,745 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:38,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:10:38,745 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:38,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:38,745 INFO L85 PathProgramCache]: Analyzing trace with hash 76517589, now seen corresponding path program 1 times [2025-03-04 00:10:38,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:38,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588157638] [2025-03-04 00:10:38,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:38,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:38,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:10:39,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:10:39,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:39,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:11:08,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:08,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588157638] [2025-03-04 00:11:08,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588157638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:08,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:08,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 00:11:08,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645476288] [2025-03-04 00:11:08,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:08,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:11:08,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:08,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:11:08,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:11:08,302 INFO L87 Difference]: Start difference. First operand 5276 states and 8152 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-04 00:11:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:11,841 INFO L93 Difference]: Finished difference Result 14430 states and 22172 transitions. [2025-03-04 00:11:11,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 00:11:11,842 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 333 [2025-03-04 00:11:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:11,888 INFO L225 Difference]: With dead ends: 14430 [2025-03-04 00:11:11,889 INFO L226 Difference]: Without dead ends: 9320 [2025-03-04 00:11:11,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=412, Invalid=920, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 00:11:11,906 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 2553 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2553 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:11,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2553 Valid, 1902 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 1925 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 00:11:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2025-03-04 00:11:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 8442. [2025-03-04 00:11:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8442 states, 6508 states have (on average 1.4417639827904118) internal successors, (9383), 6562 states have internal predecessors, (9383), 1761 states have call successors, (1761), 172 states have call predecessors, (1761), 172 states have return successors, (1761), 1707 states have call predecessors, (1761), 1761 states have call successors, (1761) [2025-03-04 00:11:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8442 states to 8442 states and 12905 transitions. [2025-03-04 00:11:12,420 INFO L78 Accepts]: Start accepts. Automaton has 8442 states and 12905 transitions. Word has length 333 [2025-03-04 00:11:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:12,422 INFO L471 AbstractCegarLoop]: Abstraction has 8442 states and 12905 transitions. [2025-03-04 00:11:12,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-04 00:11:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 8442 states and 12905 transitions. [2025-03-04 00:11:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:11:12,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:12,427 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:11:12,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:12,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1176778507, now seen corresponding path program 1 times [2025-03-04 00:11:12,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:12,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674334733] [2025-03-04 00:11:12,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:12,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:12,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:11:12,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:11:12,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:12,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:11:12,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:12,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674334733] [2025-03-04 00:11:12,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674334733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:12,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:12,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:11:12,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286076005] [2025-03-04 00:11:12,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:12,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:11:12,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:12,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:11:12,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:11:12,867 INFO L87 Difference]: Start difference. First operand 8442 states and 12905 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:11:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:13,493 INFO L93 Difference]: Finished difference Result 12114 states and 18700 transitions. [2025-03-04 00:11:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:11:13,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-04 00:11:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:13,534 INFO L225 Difference]: With dead ends: 12114 [2025-03-04 00:11:13,534 INFO L226 Difference]: Without dead ends: 9262 [2025-03-04 00:11:13,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:11:13,544 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 375 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:13,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1129 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:11:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9262 states. [2025-03-04 00:11:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9262 to 8466. [2025-03-04 00:11:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8466 states, 6532 states have (on average 1.4358542559706062) internal successors, (9379), 6586 states have internal predecessors, (9379), 1761 states have call successors, (1761), 172 states have call predecessors, (1761), 172 states have return successors, (1761), 1707 states have call predecessors, (1761), 1761 states have call successors, (1761) [2025-03-04 00:11:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8466 states to 8466 states and 12901 transitions. [2025-03-04 00:11:14,007 INFO L78 Accepts]: Start accepts. Automaton has 8466 states and 12901 transitions. Word has length 333 [2025-03-04 00:11:14,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:14,007 INFO L471 AbstractCegarLoop]: Abstraction has 8466 states and 12901 transitions. [2025-03-04 00:11:14,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:11:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 8466 states and 12901 transitions. [2025-03-04 00:11:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:11:14,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:14,012 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:14,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:11:14,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:14,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:14,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2000691754, now seen corresponding path program 1 times [2025-03-04 00:11:14,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:14,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007695207] [2025-03-04 00:11:14,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:14,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:11:14,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:11:14,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:14,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:11:42,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:42,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007695207] [2025-03-04 00:11:42,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007695207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:42,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:42,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 00:11:42,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791794881] [2025-03-04 00:11:42,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:42,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:11:42,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:42,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:11:42,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:11:42,309 INFO L87 Difference]: Start difference. First operand 8466 states and 12901 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-04 00:11:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:44,971 INFO L93 Difference]: Finished difference Result 15432 states and 23362 transitions. [2025-03-04 00:11:44,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 00:11:44,972 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 333 [2025-03-04 00:11:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:45,008 INFO L225 Difference]: With dead ends: 15432 [2025-03-04 00:11:45,009 INFO L226 Difference]: Without dead ends: 9898 [2025-03-04 00:11:45,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=324, Invalid=732, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 00:11:45,026 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 2017 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:45,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 1698 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 00:11:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9898 states. [2025-03-04 00:11:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9898 to 8486. [2025-03-04 00:11:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8486 states, 6552 states have (on average 1.4381868131868132) internal successors, (9423), 6606 states have internal predecessors, (9423), 1761 states have call successors, (1761), 172 states have call predecessors, (1761), 172 states have return successors, (1761), 1707 states have call predecessors, (1761), 1761 states have call successors, (1761) [2025-03-04 00:11:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8486 states to 8486 states and 12945 transitions. [2025-03-04 00:11:45,454 INFO L78 Accepts]: Start accepts. Automaton has 8486 states and 12945 transitions. Word has length 333 [2025-03-04 00:11:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:45,455 INFO L471 AbstractCegarLoop]: Abstraction has 8486 states and 12945 transitions. [2025-03-04 00:11:45,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-04 00:11:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 8486 states and 12945 transitions. [2025-03-04 00:11:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:11:45,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:45,460 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:45,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:11:45,461 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:45,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:45,462 INFO L85 PathProgramCache]: Analyzing trace with hash -755927273, now seen corresponding path program 1 times [2025-03-04 00:11:45,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:45,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826508021] [2025-03-04 00:11:45,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:45,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:45,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:11:45,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:11:45,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:45,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-04 00:11:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826508021] [2025-03-04 00:11:45,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826508021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:45,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:45,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:11:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771244339] [2025-03-04 00:11:45,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:45,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:11:45,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:45,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:11:45,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:45,615 INFO L87 Difference]: Start difference. First operand 8486 states and 12945 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:11:45,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:45,959 INFO L93 Difference]: Finished difference Result 14390 states and 21959 transitions. [2025-03-04 00:11:45,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:45,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-04 00:11:45,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:46,026 INFO L225 Difference]: With dead ends: 14390 [2025-03-04 00:11:46,026 INFO L226 Difference]: Without dead ends: 8864 [2025-03-04 00:11:46,035 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-04 00:11:46,036 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 241 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:46,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 726 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:11:46,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8864 states. [2025-03-04 00:11:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8864 to 8806. [2025-03-04 00:11:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8806 states, 6872 states have (on average 1.4294237485448196) internal successors, (9823), 6926 states have internal predecessors, (9823), 1761 states have call successors, (1761), 172 states have call predecessors, (1761), 172 states have return successors, (1761), 1707 states have call predecessors, (1761), 1761 states have call successors, (1761) [2025-03-04 00:11:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8806 states to 8806 states and 13345 transitions. [2025-03-04 00:11:46,452 INFO L78 Accepts]: Start accepts. Automaton has 8806 states and 13345 transitions. Word has length 333 [2025-03-04 00:11:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:46,454 INFO L471 AbstractCegarLoop]: Abstraction has 8806 states and 13345 transitions. [2025-03-04 00:11:46,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-04 00:11:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 8806 states and 13345 transitions. [2025-03-04 00:11:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 00:11:46,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:46,458 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:46,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:11:46,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:46,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1427955040, now seen corresponding path program 1 times [2025-03-04 00:11:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:46,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90634547] [2025-03-04 00:11:46,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:46,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-04 00:11:47,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-04 00:11:47,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:47,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat