./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-35.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 c178e26bd16106920ac3430faa853163075f2c78c2a5a24c5798639d4db107ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:46:22,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:46:22,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:46:22,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:46:22,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:46:22,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:46:22,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:46:22,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:46:22,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:46:22,646 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:46:22,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:46:22,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:46:22,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:46:22,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:46:22,649 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:46:22,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:46:22,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:46:22,649 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:46:22,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:46:22,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:46:22,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:46:22,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:46:22,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:46:22,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:46:22,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:46:22,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:46:22,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:46:22,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:46:22,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:46:22,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:46:22,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:46:22,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:46:22,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:46:22,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:46:22,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:46:22,651 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:46:22,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:46:22,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:46:22,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:46:22,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:46:22,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:46:22,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:46:22,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:46:22,651 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 -> c178e26bd16106920ac3430faa853163075f2c78c2a5a24c5798639d4db107ab [2025-03-03 19:46:22,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:46:22,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:46:22,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:46:22,900 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:46:22,900 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:46:22,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-35.i [2025-03-03 19:46:24,113 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb1c6bfa/8e9a5704efe64c18b9355a78fe04ab85/FLAGc8f435d20 [2025-03-03 19:46:24,376 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:46:24,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-35.i [2025-03-03 19:46:24,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb1c6bfa/8e9a5704efe64c18b9355a78fe04ab85/FLAGc8f435d20 [2025-03-03 19:46:24,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb1c6bfa/8e9a5704efe64c18b9355a78fe04ab85 [2025-03-03 19:46:24,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:46:24,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:46:24,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:46:24,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:46:24,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:46:24,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:46:24" (1/1) ... [2025-03-03 19:46:24,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1507c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:24, skipping insertion in model container [2025-03-03 19:46:24,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:46:24" (1/1) ... [2025-03-03 19:46:24,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:46:24,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-35.i[916,929] [2025-03-03 19:46:24,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:46:24,929 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:46:24,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-35.i[916,929] [2025-03-03 19:46:24,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:46:25,003 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:46:25,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25 WrapperNode [2025-03-03 19:46:25,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:46:25,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:46:25,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:46:25,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:46:25,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (1/1) ... [2025-03-03 19:46:25,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (1/1) ... [2025-03-03 19:46:25,081 INFO L138 Inliner]: procedures = 26, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 626 [2025-03-03 19:46:25,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:46:25,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:46:25,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:46:25,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:46:25,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (1/1) ... [2025-03-03 19:46:25,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (1/1) ... [2025-03-03 19:46:25,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (1/1) ... [2025-03-03 19:46:25,133 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:46:25,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (1/1) ... [2025-03-03 19:46:25,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (1/1) ... [2025-03-03 19:46:25,147 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (1/1) ... [2025-03-03 19:46:25,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (1/1) ... [2025-03-03 19:46:25,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (1/1) ... [2025-03-03 19:46:25,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (1/1) ... [2025-03-03 19:46:25,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:46:25,167 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:46:25,168 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:46:25,168 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:46:25,169 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (1/1) ... [2025-03-03 19:46:25,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:46:25,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:25,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:46:25,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:46:25,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:46:25,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:46:25,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:46:25,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:46:25,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:46:25,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:46:25,326 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:46:25,328 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:46:26,072 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L465: havoc property_#t~bitwise68#1;havoc property_#t~short69#1; [2025-03-03 19:46:26,172 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-03 19:46:26,172 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:46:26,205 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:46:26,205 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:46:26,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:46:26 BoogieIcfgContainer [2025-03-03 19:46:26,206 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:46:26,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:46:26,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:46:26,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:46:26,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:46:24" (1/3) ... [2025-03-03 19:46:26,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ab8a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:46:26, skipping insertion in model container [2025-03-03 19:46:26,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:25" (2/3) ... [2025-03-03 19:46:26,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ab8a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:46:26, skipping insertion in model container [2025-03-03 19:46:26,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:46:26" (3/3) ... [2025-03-03 19:46:26,214 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-35.i [2025-03-03 19:46:26,225 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:46:26,227 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-35.i that has 2 procedures, 264 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:46:26,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:46:26,296 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;@28940377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:46:26,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:46:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 264 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 168 states have internal predecessors, (248), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 19:46:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2025-03-03 19:46:26,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:26,330 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:26,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:26,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1244844771, now seen corresponding path program 1 times [2025-03-03 19:46:26,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:26,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756020500] [2025-03-03 19:46:26,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:26,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 583 statements into 1 equivalence classes. [2025-03-03 19:46:26,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 583 of 583 statements. [2025-03-03 19:46:26,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:26,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2025-03-03 19:46:26,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:26,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756020500] [2025-03-03 19:46:26,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756020500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:46:26,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037887142] [2025-03-03 19:46:26,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:26,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:26,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:26,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:46:26,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:46:27,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 583 statements into 1 equivalence classes. [2025-03-03 19:46:27,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 583 of 583 statements. [2025-03-03 19:46:27,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:27,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:27,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:46:27,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:46:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2025-03-03 19:46:27,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:46:27,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037887142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:27,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:46:27,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:46:27,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749668313] [2025-03-03 19:46:27,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:27,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:46:27,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:27,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:46:27,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:46:27,308 INFO L87 Difference]: Start difference. First operand has 264 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 168 states have internal predecessors, (248), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) Second operand has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) [2025-03-03 19:46:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:27,373 INFO L93 Difference]: Finished difference Result 521 states and 959 transitions. [2025-03-03 19:46:27,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:46:27,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) Word has length 583 [2025-03-03 19:46:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:27,385 INFO L225 Difference]: With dead ends: 521 [2025-03-03 19:46:27,386 INFO L226 Difference]: Without dead ends: 260 [2025-03-03 19:46:27,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:46:27,391 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:27,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 414 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:46:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-03 19:46:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-03-03 19:46:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 164 states have (on average 1.4573170731707317) internal successors, (239), 164 states have internal predecessors, (239), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 19:46:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 427 transitions. [2025-03-03 19:46:27,464 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 427 transitions. Word has length 583 [2025-03-03 19:46:27,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:27,464 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 427 transitions. [2025-03-03 19:46:27,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) [2025-03-03 19:46:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 427 transitions. [2025-03-03 19:46:27,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2025-03-03 19:46:27,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:27,476 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:27,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:46:27,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:46:27,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:27,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash -639221728, now seen corresponding path program 1 times [2025-03-03 19:46:27,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:27,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028253652] [2025-03-03 19:46:27,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:27,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:27,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 583 statements into 1 equivalence classes. [2025-03-03 19:46:27,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 583 of 583 statements. [2025-03-03 19:46:27,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:27,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:46:28,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:28,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028253652] [2025-03-03 19:46:28,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028253652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:28,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:28,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:46:28,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537889823] [2025-03-03 19:46:28,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:28,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:46:28,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:28,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:46:28,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:46:28,287 INFO L87 Difference]: Start difference. First operand 260 states and 427 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:28,401 INFO L93 Difference]: Finished difference Result 664 states and 1085 transitions. [2025-03-03 19:46:28,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:46:28,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 583 [2025-03-03 19:46:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:28,409 INFO L225 Difference]: With dead ends: 664 [2025-03-03 19:46:28,410 INFO L226 Difference]: Without dead ends: 407 [2025-03-03 19:46:28,411 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-03 19:46:28,412 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 233 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:28,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 947 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:46:28,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-03 19:46:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 404. [2025-03-03 19:46:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 254 states have (on average 1.4291338582677164) internal successors, (363), 255 states have internal predecessors, (363), 147 states have call successors, (147), 2 states have call predecessors, (147), 2 states have return successors, (147), 146 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-03 19:46:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 657 transitions. [2025-03-03 19:46:28,478 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 657 transitions. Word has length 583 [2025-03-03 19:46:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:28,479 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 657 transitions. [2025-03-03 19:46:28,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 657 transitions. [2025-03-03 19:46:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2025-03-03 19:46:28,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:28,490 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:28,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:46:28,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:28,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:28,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1451399490, now seen corresponding path program 1 times [2025-03-03 19:46:28,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:28,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041197643] [2025-03-03 19:46:28,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:28,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 583 statements into 1 equivalence classes. [2025-03-03 19:46:28,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 583 of 583 statements. [2025-03-03 19:46:28,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:28,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:46:29,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:29,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041197643] [2025-03-03 19:46:29,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041197643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:29,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:29,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:46:29,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453587280] [2025-03-03 19:46:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:29,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:46:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:29,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:46:29,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:46:29,446 INFO L87 Difference]: Start difference. First operand 404 states and 657 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:30,065 INFO L93 Difference]: Finished difference Result 1244 states and 2018 transitions. [2025-03-03 19:46:30,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:46:30,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 583 [2025-03-03 19:46:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:30,077 INFO L225 Difference]: With dead ends: 1244 [2025-03-03 19:46:30,077 INFO L226 Difference]: Without dead ends: 843 [2025-03-03 19:46:30,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:46:30,079 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 376 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:30,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1476 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:46:30,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-03-03 19:46:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 803. [2025-03-03 19:46:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 504 states have (on average 1.4285714285714286) internal successors, (720), 506 states have internal predecessors, (720), 294 states have call successors, (294), 4 states have call predecessors, (294), 4 states have return successors, (294), 292 states have call predecessors, (294), 294 states have call successors, (294) [2025-03-03 19:46:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1308 transitions. [2025-03-03 19:46:30,188 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1308 transitions. Word has length 583 [2025-03-03 19:46:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:30,189 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1308 transitions. [2025-03-03 19:46:30,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1308 transitions. [2025-03-03 19:46:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-03-03 19:46:30,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:30,196 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:30,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:46:30,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:30,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1850224917, now seen corresponding path program 1 times [2025-03-03 19:46:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:30,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569967647] [2025-03-03 19:46:30,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:30,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-03 19:46:30,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-03 19:46:30,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:30,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:46:30,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:30,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569967647] [2025-03-03 19:46:30,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569967647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:30,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:30,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:46:30,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509282443] [2025-03-03 19:46:30,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:30,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:46:30,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:30,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:46:30,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:46:30,704 INFO L87 Difference]: Start difference. First operand 803 states and 1308 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:31,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:31,086 INFO L93 Difference]: Finished difference Result 2457 states and 3991 transitions. [2025-03-03 19:46:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:46:31,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 584 [2025-03-03 19:46:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:31,098 INFO L225 Difference]: With dead ends: 2457 [2025-03-03 19:46:31,098 INFO L226 Difference]: Without dead ends: 1657 [2025-03-03 19:46:31,101 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-03 19:46:31,102 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 379 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:31,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1241 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:46:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-03-03 19:46:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1601. [2025-03-03 19:46:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1004 states have (on average 1.4262948207171315) internal successors, (1432), 1008 states have internal predecessors, (1432), 588 states have call successors, (588), 8 states have call predecessors, (588), 8 states have return successors, (588), 584 states have call predecessors, (588), 588 states have call successors, (588) [2025-03-03 19:46:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2608 transitions. [2025-03-03 19:46:31,308 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2608 transitions. Word has length 584 [2025-03-03 19:46:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:31,310 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2608 transitions. [2025-03-03 19:46:31,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2608 transitions. [2025-03-03 19:46:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-03-03 19:46:31,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:31,315 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:31,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:46:31,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:31,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:31,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1600270508, now seen corresponding path program 1 times [2025-03-03 19:46:31,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:31,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721011454] [2025-03-03 19:46:31,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:31,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:31,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-03 19:46:31,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-03 19:46:31,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:31,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:46:31,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:31,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721011454] [2025-03-03 19:46:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721011454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:31,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:31,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:46:31,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806560797] [2025-03-03 19:46:31,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:31,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:46:31,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:31,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:46:31,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:46:31,701 INFO L87 Difference]: Start difference. First operand 1601 states and 2608 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:32,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:32,318 INFO L93 Difference]: Finished difference Result 5051 states and 8179 transitions. [2025-03-03 19:46:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:46:32,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 584 [2025-03-03 19:46:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:32,341 INFO L225 Difference]: With dead ends: 5051 [2025-03-03 19:46:32,342 INFO L226 Difference]: Without dead ends: 3453 [2025-03-03 19:46:32,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03 19:46:32,349 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 465 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:32,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1425 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:46:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2025-03-03 19:46:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 1957. [2025-03-03 19:46:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1296 states have (on average 1.4166666666666667) internal successors, (1836), 1308 states have internal predecessors, (1836), 644 states have call successors, (644), 16 states have call predecessors, (644), 16 states have return successors, (644), 632 states have call predecessors, (644), 644 states have call successors, (644) [2025-03-03 19:46:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3124 transitions. [2025-03-03 19:46:32,609 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3124 transitions. Word has length 584 [2025-03-03 19:46:32,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:32,611 INFO L471 AbstractCegarLoop]: Abstraction has 1957 states and 3124 transitions. [2025-03-03 19:46:32,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3124 transitions. [2025-03-03 19:46:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-03-03 19:46:32,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:32,616 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:32,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:46:32,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:32,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:32,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1306867501, now seen corresponding path program 1 times [2025-03-03 19:46:32,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:32,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693137654] [2025-03-03 19:46:32,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:32,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-03 19:46:32,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-03 19:46:32,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:32,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:46:33,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:33,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693137654] [2025-03-03 19:46:33,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693137654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:33,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:33,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:46:33,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450883571] [2025-03-03 19:46:33,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:33,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:46:33,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:33,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:46:33,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:46:33,636 INFO L87 Difference]: Start difference. First operand 1957 states and 3124 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:35,781 INFO L93 Difference]: Finished difference Result 9699 states and 15315 transitions. [2025-03-03 19:46:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 19:46:35,782 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 584 [2025-03-03 19:46:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:35,829 INFO L225 Difference]: With dead ends: 9699 [2025-03-03 19:46:35,829 INFO L226 Difference]: Without dead ends: 7745 [2025-03-03 19:46:35,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-03-03 19:46:35,842 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 1958 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:35,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 2384 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 19:46:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7745 states. [2025-03-03 19:46:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7745 to 5293. [2025-03-03 19:46:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5293 states, 3716 states have (on average 1.442411194833154) internal successors, (5360), 3756 states have internal predecessors, (5360), 1528 states have call successors, (1528), 48 states have call predecessors, (1528), 48 states have return successors, (1528), 1488 states have call predecessors, (1528), 1528 states have call successors, (1528) [2025-03-03 19:46:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 8416 transitions. [2025-03-03 19:46:36,357 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 8416 transitions. Word has length 584 [2025-03-03 19:46:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:36,359 INFO L471 AbstractCegarLoop]: Abstraction has 5293 states and 8416 transitions. [2025-03-03 19:46:36,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 8416 transitions. [2025-03-03 19:46:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-03-03 19:46:36,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:36,366 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:36,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:46:36,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:36,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:36,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1262618898, now seen corresponding path program 1 times [2025-03-03 19:46:36,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:36,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263881845] [2025-03-03 19:46:36,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:36,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:36,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-03 19:46:36,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-03 19:46:36,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:36,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:46:37,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:37,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263881845] [2025-03-03 19:46:37,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263881845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:37,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:37,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:46:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170851604] [2025-03-03 19:46:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:37,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:46:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:37,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:46:37,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:46:37,109 INFO L87 Difference]: Start difference. First operand 5293 states and 8416 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:38,373 INFO L93 Difference]: Finished difference Result 21693 states and 34172 transitions. [2025-03-03 19:46:38,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:46:38,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 584 [2025-03-03 19:46:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:38,478 INFO L225 Difference]: With dead ends: 21693 [2025-03-03 19:46:38,479 INFO L226 Difference]: Without dead ends: 16403 [2025-03-03 19:46:38,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:46:38,507 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 1020 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:38,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 2339 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:46:38,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16403 states. [2025-03-03 19:46:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16403 to 11897. [2025-03-03 19:46:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11897 states, 8944 states have (on average 1.4615384615384615) internal successors, (13072), 9064 states have internal predecessors, (13072), 2824 states have call successors, (2824), 128 states have call predecessors, (2824), 128 states have return successors, (2824), 2704 states have call predecessors, (2824), 2824 states have call successors, (2824) [2025-03-03 19:46:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11897 states to 11897 states and 18720 transitions. [2025-03-03 19:46:39,448 INFO L78 Accepts]: Start accepts. Automaton has 11897 states and 18720 transitions. Word has length 584 [2025-03-03 19:46:39,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:39,449 INFO L471 AbstractCegarLoop]: Abstraction has 11897 states and 18720 transitions. [2025-03-03 19:46:39,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 11897 states and 18720 transitions. [2025-03-03 19:46:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-03-03 19:46:39,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:39,457 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:39,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:46:39,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:39,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:39,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1101729293, now seen corresponding path program 1 times [2025-03-03 19:46:39,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:39,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70252592] [2025-03-03 19:46:39,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:39,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:39,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-03 19:46:39,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-03 19:46:39,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:39,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:46:41,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:41,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70252592] [2025-03-03 19:46:41,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70252592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:41,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:41,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 19:46:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303034289] [2025-03-03 19:46:41,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:41,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:46:41,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:41,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:46:41,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:46:41,127 INFO L87 Difference]: Start difference. First operand 11897 states and 18720 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:45,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:45,312 INFO L93 Difference]: Finished difference Result 32380 states and 50422 transitions. [2025-03-03 19:46:45,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 19:46:45,313 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 584 [2025-03-03 19:46:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:45,390 INFO L225 Difference]: With dead ends: 32380 [2025-03-03 19:46:45,391 INFO L226 Difference]: Without dead ends: 20486 [2025-03-03 19:46:45,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-03 19:46:45,427 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 1513 mSDsluCounter, 4744 mSDsCounter, 0 mSdLazyCounter, 2797 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 5586 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 2797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:45,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 5586 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 2797 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 19:46:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2025-03-03 19:46:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 15317. [2025-03-03 19:46:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15317 states, 11607 states have (on average 1.4504178512966313) internal successors, (16835), 11776 states have internal predecessors, (16835), 3517 states have call successors, (3517), 192 states have call predecessors, (3517), 192 states have return successors, (3517), 3348 states have call predecessors, (3517), 3517 states have call successors, (3517) [2025-03-03 19:46:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15317 states to 15317 states and 23869 transitions. [2025-03-03 19:46:46,355 INFO L78 Accepts]: Start accepts. Automaton has 15317 states and 23869 transitions. Word has length 584 [2025-03-03 19:46:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:46,357 INFO L471 AbstractCegarLoop]: Abstraction has 15317 states and 23869 transitions. [2025-03-03 19:46:46,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 15317 states and 23869 transitions. [2025-03-03 19:46:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-03-03 19:46:46,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:46,366 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:46,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:46:46,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:46,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:46,367 INFO L85 PathProgramCache]: Analyzing trace with hash 585886260, now seen corresponding path program 1 times [2025-03-03 19:46:46,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:46,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781686535] [2025-03-03 19:46:46,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:46,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:46,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-03-03 19:46:46,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-03-03 19:46:46,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:46,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:46:46,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:46,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781686535] [2025-03-03 19:46:46,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781686535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:46,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:46,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:46:46,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715790496] [2025-03-03 19:46:46,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:46,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:46:46,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:46,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:46:46,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:46:46,810 INFO L87 Difference]: Start difference. First operand 15317 states and 23869 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:47,884 INFO L93 Difference]: Finished difference Result 26921 states and 40990 transitions. [2025-03-03 19:46:47,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:46:47,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 585 [2025-03-03 19:46:47,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:47,947 INFO L225 Difference]: With dead ends: 26921 [2025-03-03 19:46:47,947 INFO L226 Difference]: Without dead ends: 19281 [2025-03-03 19:46:47,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:46:47,966 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 90 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:47,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1634 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:46:47,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19281 states. [2025-03-03 19:46:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19281 to 15317. [2025-03-03 19:46:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15317 states, 11607 states have (on average 1.4428362195227018) internal successors, (16747), 11776 states have internal predecessors, (16747), 3517 states have call successors, (3517), 192 states have call predecessors, (3517), 192 states have return successors, (3517), 3348 states have call predecessors, (3517), 3517 states have call successors, (3517) [2025-03-03 19:46:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15317 states to 15317 states and 23781 transitions. [2025-03-03 19:46:49,091 INFO L78 Accepts]: Start accepts. Automaton has 15317 states and 23781 transitions. Word has length 585 [2025-03-03 19:46:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:49,092 INFO L471 AbstractCegarLoop]: Abstraction has 15317 states and 23781 transitions. [2025-03-03 19:46:49,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:46:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 15317 states and 23781 transitions. [2025-03-03 19:46:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-03-03 19:46:49,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:49,104 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:49,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:46:49,104 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:49,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1221568203, now seen corresponding path program 1 times [2025-03-03 19:46:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:49,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514210088] [2025-03-03 19:46:49,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:49,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:49,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-03-03 19:46:49,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-03-03 19:46:49,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:49,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 222 proven. 57 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-03 19:46:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514210088] [2025-03-03 19:46:49,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514210088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:46:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120330826] [2025-03-03 19:46:49,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:49,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:49,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:49,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:46:49,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:46:49,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-03-03 19:46:49,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-03-03 19:46:49,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:49,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:49,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:46:49,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:46:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 5865 proven. 57 refuted. 0 times theorem prover too weak. 11562 trivial. 0 not checked. [2025-03-03 19:46:50,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:46:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 222 proven. 57 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-03 19:46:50,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120330826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:46:50,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:46:50,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 19:46:50,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805800920] [2025-03-03 19:46:50,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:46:50,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:46:50,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:50,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:46:50,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:46:50,575 INFO L87 Difference]: Start difference. First operand 15317 states and 23781 transitions. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 2 states have call successors, (113), 2 states have call predecessors, (113), 4 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) [2025-03-03 19:46:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:51,748 INFO L93 Difference]: Finished difference Result 31013 states and 47912 transitions. [2025-03-03 19:46:51,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:46:51,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 2 states have call successors, (113), 2 states have call predecessors, (113), 4 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) Word has length 585 [2025-03-03 19:46:51,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:51,826 INFO L225 Difference]: With dead ends: 31013 [2025-03-03 19:46:51,826 INFO L226 Difference]: Without dead ends: 15735 [2025-03-03 19:46:51,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1177 GetRequests, 1167 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:46:51,865 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 260 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:51,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 746 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:46:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15735 states. [2025-03-03 19:46:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15735 to 15349. [2025-03-03 19:46:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15349 states, 11631 states have (on average 1.4343564611813258) internal successors, (16683), 11800 states have internal predecessors, (16683), 3517 states have call successors, (3517), 200 states have call predecessors, (3517), 200 states have return successors, (3517), 3348 states have call predecessors, (3517), 3517 states have call successors, (3517) [2025-03-03 19:46:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15349 states to 15349 states and 23717 transitions. [2025-03-03 19:46:52,972 INFO L78 Accepts]: Start accepts. Automaton has 15349 states and 23717 transitions. Word has length 585 [2025-03-03 19:46:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:52,972 INFO L471 AbstractCegarLoop]: Abstraction has 15349 states and 23717 transitions. [2025-03-03 19:46:52,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 2 states have call successors, (113), 2 states have call predecessors, (113), 4 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) [2025-03-03 19:46:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 15349 states and 23717 transitions. [2025-03-03 19:46:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-03-03 19:46:52,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:52,981 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:52,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:46:53,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 19:46:53,185 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:53,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:53,185 INFO L85 PathProgramCache]: Analyzing trace with hash -825620189, now seen corresponding path program 1 times [2025-03-03 19:46:53,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:53,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840465371] [2025-03-03 19:46:53,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:53,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:53,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-03 19:46:53,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-03 19:46:53,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:53,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 99 proven. 180 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-03 19:46:54,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:54,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840465371] [2025-03-03 19:46:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840465371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:46:54,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374001581] [2025-03-03 19:46:54,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:54,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:54,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:54,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:46:54,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:46:54,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-03 19:46:54,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-03 19:46:54,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:54,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:54,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 19:46:54,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:46:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 8141 proven. 354 refuted. 0 times theorem prover too weak. 8989 trivial. 0 not checked. [2025-03-03 19:46:55,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:46:56,696 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 99 proven. 180 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-03 19:46:56,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374001581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:46:56,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:46:56,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 32 [2025-03-03 19:46:56,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850616269] [2025-03-03 19:46:56,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:46:56,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 19:46:56,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:56,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 19:46:56,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2025-03-03 19:46:56,700 INFO L87 Difference]: Start difference. First operand 15349 states and 23717 transitions. Second operand has 32 states, 32 states have (on average 8.21875) internal successors, (263), 32 states have internal predecessors, (263), 4 states have call successors, (214), 3 states have call predecessors, (214), 5 states have return successors, (215), 4 states have call predecessors, (215), 4 states have call successors, (215) [2025-03-03 19:47:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:47:10,101 INFO L93 Difference]: Finished difference Result 130484 states and 196154 transitions. [2025-03-03 19:47:10,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-03 19:47:10,102 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.21875) internal successors, (263), 32 states have internal predecessors, (263), 4 states have call successors, (214), 3 states have call predecessors, (214), 5 states have return successors, (215), 4 states have call predecessors, (215), 4 states have call successors, (215) Word has length 586 [2025-03-03 19:47:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:47:10,466 INFO L225 Difference]: With dead ends: 130484 [2025-03-03 19:47:10,466 INFO L226 Difference]: Without dead ends: 115174 [2025-03-03 19:47:10,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1261 GetRequests, 1164 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1907, Invalid=7795, Unknown=0, NotChecked=0, Total=9702 [2025-03-03 19:47:10,545 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 3876 mSDsluCounter, 6532 mSDsCounter, 0 mSdLazyCounter, 6160 mSolverCounterSat, 1393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3934 SdHoareTripleChecker+Valid, 7000 SdHoareTripleChecker+Invalid, 7553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1393 IncrementalHoareTripleChecker+Valid, 6160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:47:10,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3934 Valid, 7000 Invalid, 7553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1393 Valid, 6160 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 19:47:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115174 states. [2025-03-03 19:47:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115174 to 35894. [2025-03-03 19:47:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35894 states, 27805 states have (on average 1.4343103758316849) internal successors, (39881), 28238 states have internal predecessors, (39881), 7535 states have call successors, (7535), 553 states have call predecessors, (7535), 553 states have return successors, (7535), 7102 states have call predecessors, (7535), 7535 states have call successors, (7535) [2025-03-03 19:47:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35894 states to 35894 states and 54951 transitions. [2025-03-03 19:47:14,248 INFO L78 Accepts]: Start accepts. Automaton has 35894 states and 54951 transitions. Word has length 586 [2025-03-03 19:47:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:14,249 INFO L471 AbstractCegarLoop]: Abstraction has 35894 states and 54951 transitions. [2025-03-03 19:47:14,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.21875) internal successors, (263), 32 states have internal predecessors, (263), 4 states have call successors, (214), 3 states have call predecessors, (214), 5 states have return successors, (215), 4 states have call predecessors, (215), 4 states have call successors, (215) [2025-03-03 19:47:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 35894 states and 54951 transitions. [2025-03-03 19:47:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-03-03 19:47:14,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:14,265 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:47:14,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:47:14,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:47:14,469 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:14,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1124680066, now seen corresponding path program 1 times [2025-03-03 19:47:14,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:14,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145551535] [2025-03-03 19:47:14,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:14,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:14,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-03 19:47:14,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-03 19:47:14,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:14,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 99 proven. 180 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-03 19:47:16,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:16,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145551535] [2025-03-03 19:47:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145551535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:47:16,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189273153] [2025-03-03 19:47:16,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:16,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:47:16,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:47:16,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:47:16,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 19:47:16,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-03 19:47:16,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-03 19:47:16,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:16,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:16,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 19:47:16,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:47:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 8141 proven. 354 refuted. 0 times theorem prover too weak. 8989 trivial. 0 not checked. [2025-03-03 19:47:18,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:47:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 198 proven. 357 refuted. 0 times theorem prover too weak. 16929 trivial. 0 not checked. [2025-03-03 19:47:20,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189273153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:47:20,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:47:20,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 49 [2025-03-03 19:47:20,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831525407] [2025-03-03 19:47:20,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:47:20,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 19:47:20,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:20,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 19:47:20,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 19:47:20,232 INFO L87 Difference]: Start difference. First operand 35894 states and 54951 transitions. Second operand has 49 states, 48 states have (on average 6.708333333333333) internal successors, (322), 47 states have internal predecessors, (322), 8 states have call successors, (282), 4 states have call predecessors, (282), 8 states have return successors, (282), 8 states have call predecessors, (282), 8 states have call successors, (282)