./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.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_loopvsstraightlinecode_100-while_file-26.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 0cc8a0783ec7e65aec5bb1b8ce7f7837d17a7d27f4f67ff4962ce15c1b498ac3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:56:01,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:56:02,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:56:02,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:56:02,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:56:02,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:56:02,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:56:02,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:56:02,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:56:02,030 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:56:02,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:56:02,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:56:02,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:56:02,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:56:02,031 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:56:02,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:56:02,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:56:02,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:56:02,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:56:02,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:56:02,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:56:02,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:56:02,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:56:02,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:56:02,032 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:56:02,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:56:02,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:56:02,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:56:02,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:56:02,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:56:02,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:56:02,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:56:02,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:56:02,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:56:02,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:56:02,033 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:56:02,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:56:02,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:56:02,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:56:02,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:56:02,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:56:02,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:56:02,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:56:02,034 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 -> 0cc8a0783ec7e65aec5bb1b8ce7f7837d17a7d27f4f67ff4962ce15c1b498ac3 [2025-03-03 22:56:02,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:56:02,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:56:02,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:56:02,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:56:02,284 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:56:02,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i [2025-03-03 22:56:03,474 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4eac858/50e5a2988bc3443391a474297169cd76/FLAG8a2cf1eeb [2025-03-03 22:56:03,742 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:56:03,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i [2025-03-03 22:56:03,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4eac858/50e5a2988bc3443391a474297169cd76/FLAG8a2cf1eeb [2025-03-03 22:56:03,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4eac858/50e5a2988bc3443391a474297169cd76 [2025-03-03 22:56:03,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:56:03,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:56:03,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:56:03,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:56:03,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:56:03,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:56:03" (1/1) ... [2025-03-03 22:56:03,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f72b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:03, skipping insertion in model container [2025-03-03 22:56:03,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:56:03" (1/1) ... [2025-03-03 22:56:03,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:56:03,900 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_loopvsstraightlinecode_100-while_file-26.i[916,929] [2025-03-03 22:56:03,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:56:03,978 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:56:03,985 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_loopvsstraightlinecode_100-while_file-26.i[916,929] [2025-03-03 22:56:04,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:56:04,039 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:56:04,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04 WrapperNode [2025-03-03 22:56:04,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:56:04,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:56:04,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:56:04,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:56:04,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (1/1) ... [2025-03-03 22:56:04,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (1/1) ... [2025-03-03 22:56:04,085 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-03-03 22:56:04,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:56:04,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:56:04,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:56:04,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:56:04,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (1/1) ... [2025-03-03 22:56:04,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (1/1) ... [2025-03-03 22:56:04,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (1/1) ... [2025-03-03 22:56:04,117 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 22:56:04,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (1/1) ... [2025-03-03 22:56:04,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (1/1) ... [2025-03-03 22:56:04,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (1/1) ... [2025-03-03 22:56:04,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (1/1) ... [2025-03-03 22:56:04,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (1/1) ... [2025-03-03 22:56:04,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (1/1) ... [2025-03-03 22:56:04,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:56:04,151 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:56:04,151 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:56:04,151 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:56:04,152 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (1/1) ... [2025-03-03 22:56:04,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:56:04,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:56:04,181 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 22:56:04,186 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 22:56:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:56:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:56:04,200 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:56:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:56:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:56:04,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:56:04,264 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:56:04,265 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:56:04,649 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L205: havoc property_#t~ite22#1;havoc property_#t~bitwise21#1;havoc property_#t~short23#1; [2025-03-03 22:56:04,693 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-03 22:56:04,694 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:56:04,710 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:56:04,711 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:56:04,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:56:04 BoogieIcfgContainer [2025-03-03 22:56:04,711 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:56:04,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:56:04,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:56:04,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:56:04,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:56:03" (1/3) ... [2025-03-03 22:56:04,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f00309d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:56:04, skipping insertion in model container [2025-03-03 22:56:04,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:04" (2/3) ... [2025-03-03 22:56:04,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f00309d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:56:04, skipping insertion in model container [2025-03-03 22:56:04,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:56:04" (3/3) ... [2025-03-03 22:56:04,718 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-26.i [2025-03-03 22:56:04,729 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:56:04,731 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-26.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:56:04,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:56:04,785 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;@5576024a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:56:04,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:56:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 22:56:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 22:56:04,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:04,798 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:04,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:04,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:04,814 INFO L85 PathProgramCache]: Analyzing trace with hash -621787247, now seen corresponding path program 1 times [2025-03-03 22:56:04,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:04,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398121013] [2025-03-03 22:56:04,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:04,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:04,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 22:56:04,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 22:56:04,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:04,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-03 22:56:05,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:05,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398121013] [2025-03-03 22:56:05,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398121013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:56:05,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965237472] [2025-03-03 22:56:05,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:05,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:56:05,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:56:05,153 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 22:56:05,154 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 22:56:05,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 22:56:05,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 22:56:05,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:05,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:05,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:56:05,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:56:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-03 22:56:05,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:56:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965237472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:05,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:56:05,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:56:05,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316959966] [2025-03-03 22:56:05,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:05,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:56:05,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:05,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:56:05,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:56:05,348 INFO L87 Difference]: Start difference. First operand has 101 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:56:05,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:05,375 INFO L93 Difference]: Finished difference Result 196 states and 339 transitions. [2025-03-03 22:56:05,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:56:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 197 [2025-03-03 22:56:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:05,381 INFO L225 Difference]: With dead ends: 196 [2025-03-03 22:56:05,381 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 22:56:05,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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 22:56:05,385 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:05,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:56:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 22:56:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-03 22:56:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 22:56:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2025-03-03 22:56:05,418 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 197 [2025-03-03 22:56:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:05,420 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2025-03-03 22:56:05,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:56:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2025-03-03 22:56:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 22:56:05,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:05,423 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:05,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:56:05,623 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 22:56:05,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:05,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1715708559, now seen corresponding path program 1 times [2025-03-03 22:56:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:05,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909091546] [2025-03-03 22:56:05,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:05,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 22:56:05,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 22:56:05,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:05,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:56:06,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:06,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909091546] [2025-03-03 22:56:06,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909091546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:06,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:06,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:56:06,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654938862] [2025-03-03 22:56:06,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:06,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:56:06,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:06,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:56:06,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:56:06,106 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:56:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:06,165 INFO L93 Difference]: Finished difference Result 288 states and 450 transitions. [2025-03-03 22:56:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:56:06,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2025-03-03 22:56:06,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:06,169 INFO L225 Difference]: With dead ends: 288 [2025-03-03 22:56:06,171 INFO L226 Difference]: Without dead ends: 193 [2025-03-03 22:56:06,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:56:06,174 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 146 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:06,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 395 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:56:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-03 22:56:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 99. [2025-03-03 22:56:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 67 states have internal predecessors, (93), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 22:56:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2025-03-03 22:56:06,196 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 197 [2025-03-03 22:56:06,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:06,197 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2025-03-03 22:56:06,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:56:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2025-03-03 22:56:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 22:56:06,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:06,200 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:06,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:56:06,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:06,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1205174382, now seen corresponding path program 1 times [2025-03-03 22:56:06,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:06,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418209215] [2025-03-03 22:56:06,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:06,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:06,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 22:56:06,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 22:56:06,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:06,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:56:06,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:06,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418209215] [2025-03-03 22:56:06,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418209215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:06,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:06,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:56:06,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66317166] [2025-03-03 22:56:06,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:06,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:56:06,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:06,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:56:06,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:56:06,942 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:56:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:07,115 INFO L93 Difference]: Finished difference Result 301 states and 459 transitions. [2025-03-03 22:56:07,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:56:07,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2025-03-03 22:56:07,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:07,119 INFO L225 Difference]: With dead ends: 301 [2025-03-03 22:56:07,120 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 22:56:07,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:56:07,122 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 130 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:07,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 514 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:56:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 22:56:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 173. [2025-03-03 22:56:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 134 states have (on average 1.455223880597015) internal successors, (195), 135 states have internal predecessors, (195), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 22:56:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 267 transitions. [2025-03-03 22:56:07,146 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 267 transitions. Word has length 197 [2025-03-03 22:56:07,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:07,146 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 267 transitions. [2025-03-03 22:56:07,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:56:07,147 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 267 transitions. [2025-03-03 22:56:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 22:56:07,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:07,163 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:07,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:56:07,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:07,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1309325759, now seen corresponding path program 1 times [2025-03-03 22:56:07,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:07,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742970585] [2025-03-03 22:56:07,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:07,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:07,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 22:56:07,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 22:56:07,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:07,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:56:07,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:07,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742970585] [2025-03-03 22:56:07,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742970585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:07,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:07,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:56:07,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100287478] [2025-03-03 22:56:07,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:07,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:56:07,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:07,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:56:07,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:56:07,422 INFO L87 Difference]: Start difference. First operand 173 states and 267 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:56:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:07,638 INFO L93 Difference]: Finished difference Result 561 states and 864 transitions. [2025-03-03 22:56:07,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:56:07,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2025-03-03 22:56:07,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:07,644 INFO L225 Difference]: With dead ends: 561 [2025-03-03 22:56:07,645 INFO L226 Difference]: Without dead ends: 391 [2025-03-03 22:56:07,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:56:07,646 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 157 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:07,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 574 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:56:07,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-03 22:56:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 321. [2025-03-03 22:56:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 244 states have (on average 1.4467213114754098) internal successors, (353), 246 states have internal predecessors, (353), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:56:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 497 transitions. [2025-03-03 22:56:07,690 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 497 transitions. Word has length 198 [2025-03-03 22:56:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:07,691 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 497 transitions. [2025-03-03 22:56:07,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:56:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 497 transitions. [2025-03-03 22:56:07,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 22:56:07,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:07,692 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:07,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:56:07,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:07,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:07,693 INFO L85 PathProgramCache]: Analyzing trace with hash -767883584, now seen corresponding path program 1 times [2025-03-03 22:56:07,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:07,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377489026] [2025-03-03 22:56:07,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:07,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:07,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 22:56:07,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 22:56:07,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:07,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:56:08,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:08,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377489026] [2025-03-03 22:56:08,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377489026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:08,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:08,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:56:08,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864390334] [2025-03-03 22:56:08,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:08,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:56:08,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:08,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:56:08,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:56:08,005 INFO L87 Difference]: Start difference. First operand 321 states and 497 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:56:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:08,247 INFO L93 Difference]: Finished difference Result 809 states and 1255 transitions. [2025-03-03 22:56:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:56:08,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2025-03-03 22:56:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:08,250 INFO L225 Difference]: With dead ends: 809 [2025-03-03 22:56:08,251 INFO L226 Difference]: Without dead ends: 491 [2025-03-03 22:56:08,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:56:08,252 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 116 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:08,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 586 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:56:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-03 22:56:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2025-03-03 22:56:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 374 states have (on average 1.4411764705882353) internal successors, (539), 377 states have internal predecessors, (539), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 22:56:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 755 transitions. [2025-03-03 22:56:08,289 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 755 transitions. Word has length 198 [2025-03-03 22:56:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:08,289 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 755 transitions. [2025-03-03 22:56:08,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:56:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 755 transitions. [2025-03-03 22:56:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 22:56:08,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:08,291 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:08,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:56:08,291 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:08,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1176707809, now seen corresponding path program 1 times [2025-03-03 22:56:08,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:08,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501084333] [2025-03-03 22:56:08,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:08,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:08,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 22:56:08,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 22:56:08,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:08,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:56:13,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:13,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501084333] [2025-03-03 22:56:13,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501084333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:13,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:13,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 22:56:13,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458937172] [2025-03-03 22:56:13,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:13,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 22:56:13,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:13,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 22:56:13,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:56:13,645 INFO L87 Difference]: Start difference. First operand 489 states and 755 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 22:56:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:15,085 INFO L93 Difference]: Finished difference Result 1639 states and 2511 transitions. [2025-03-03 22:56:15,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:56:15,086 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 198 [2025-03-03 22:56:15,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:15,092 INFO L225 Difference]: With dead ends: 1639 [2025-03-03 22:56:15,092 INFO L226 Difference]: Without dead ends: 1153 [2025-03-03 22:56:15,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 22:56:15,096 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 894 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:15,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 856 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 22:56:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-03-03 22:56:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 885. [2025-03-03 22:56:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 694 states have (on average 1.4524495677233429) internal successors, (1008), 699 states have internal predecessors, (1008), 180 states have call successors, (180), 10 states have call predecessors, (180), 10 states have return successors, (180), 175 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-03 22:56:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1368 transitions. [2025-03-03 22:56:15,162 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1368 transitions. Word has length 198 [2025-03-03 22:56:15,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:15,162 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1368 transitions. [2025-03-03 22:56:15,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 22:56:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1368 transitions. [2025-03-03 22:56:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 22:56:15,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:15,168 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:15,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:56:15,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:15,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:15,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1470110816, now seen corresponding path program 1 times [2025-03-03 22:56:15,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:15,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436554664] [2025-03-03 22:56:15,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:15,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:15,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 22:56:15,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 22:56:15,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:15,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:56:15,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:15,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436554664] [2025-03-03 22:56:15,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436554664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:15,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:15,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:56:15,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110619571] [2025-03-03 22:56:15,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:15,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:56:15,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:15,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:56:15,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:56:15,596 INFO L87 Difference]: Start difference. First operand 885 states and 1368 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:56:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:16,412 INFO L93 Difference]: Finished difference Result 2191 states and 3380 transitions. [2025-03-03 22:56:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:56:16,413 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2025-03-03 22:56:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:16,419 INFO L225 Difference]: With dead ends: 2191 [2025-03-03 22:56:16,419 INFO L226 Difference]: Without dead ends: 1309 [2025-03-03 22:56:16,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:56:16,422 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 426 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:16,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 915 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 22:56:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2025-03-03 22:56:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1281. [2025-03-03 22:56:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1014 states have (on average 1.4487179487179487) internal successors, (1469), 1021 states have internal predecessors, (1469), 252 states have call successors, (252), 14 states have call predecessors, (252), 14 states have return successors, (252), 245 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-03 22:56:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1973 transitions. [2025-03-03 22:56:16,488 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1973 transitions. Word has length 198 [2025-03-03 22:56:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:16,489 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1973 transitions. [2025-03-03 22:56:16,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:56:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1973 transitions. [2025-03-03 22:56:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 22:56:16,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:16,491 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:16,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:56:16,491 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:16,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:16,491 INFO L85 PathProgramCache]: Analyzing trace with hash 272699519, now seen corresponding path program 1 times [2025-03-03 22:56:16,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:16,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712494142] [2025-03-03 22:56:16,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:16,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:16,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 22:56:16,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 22:56:16,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:16,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:56:24,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:24,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712494142] [2025-03-03 22:56:24,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712494142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:24,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:24,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 22:56:24,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353701430] [2025-03-03 22:56:24,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:24,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 22:56:24,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:24,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 22:56:24,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-03 22:56:24,309 INFO L87 Difference]: Start difference. First operand 1281 states and 1973 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:56:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:29,133 INFO L93 Difference]: Finished difference Result 5252 states and 7919 transitions. [2025-03-03 22:56:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 22:56:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2025-03-03 22:56:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:29,147 INFO L225 Difference]: With dead ends: 5252 [2025-03-03 22:56:29,147 INFO L226 Difference]: Without dead ends: 3974 [2025-03-03 22:56:29,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 22:56:29,152 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1356 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:29,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 1073 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 22:56:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2025-03-03 22:56:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 1723. [2025-03-03 22:56:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1418 states have (on average 1.464033850493653) internal successors, (2076), 1426 states have internal predecessors, (2076), 288 states have call successors, (288), 16 states have call predecessors, (288), 16 states have return successors, (288), 280 states have call predecessors, (288), 288 states have call successors, (288) [2025-03-03 22:56:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2652 transitions. [2025-03-03 22:56:29,249 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2652 transitions. Word has length 198 [2025-03-03 22:56:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:29,250 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2652 transitions. [2025-03-03 22:56:29,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:56:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2652 transitions. [2025-03-03 22:56:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 22:56:29,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:29,254 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:29,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 22:56:29,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:29,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1160203200, now seen corresponding path program 1 times [2025-03-03 22:56:29,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:29,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487530277] [2025-03-03 22:56:29,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:29,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 22:56:29,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 22:56:29,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:29,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat