./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-67.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-67.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 83ed3ec8bcd09c585992790b95e2966a76e5b0e36e2946c8579c171a77252508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:01:08,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:01:08,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:01:08,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:01:08,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:01:08,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:01:08,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:01:08,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:01:08,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:01:08,248 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:01:08,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:01:08,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:01:08,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:01:08,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:01:08,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:01:08,250 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:01:08,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:01:08,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:01:08,250 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 -> 83ed3ec8bcd09c585992790b95e2966a76e5b0e36e2946c8579c171a77252508 [2025-03-03 23:01:08,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:01:08,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:01:08,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:01:08,475 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:01:08,475 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:01:08,477 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-67.i [2025-03-03 23:01:09,576 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de48d9b4/916735959cfe4e9f8300d9b91221a3a0/FLAGf3051e9fb [2025-03-03 23:01:09,848 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:01:09,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-67.i [2025-03-03 23:01:09,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de48d9b4/916735959cfe4e9f8300d9b91221a3a0/FLAGf3051e9fb [2025-03-03 23:01:09,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de48d9b4/916735959cfe4e9f8300d9b91221a3a0 [2025-03-03 23:01:09,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:01:09,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:01:09,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:01:09,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:01:09,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:01:09,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:09" (1/1) ... [2025-03-03 23:01:09,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33211a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:09, skipping insertion in model container [2025-03-03 23:01:09,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:09" (1/1) ... [2025-03-03 23:01:09,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:01:10,007 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-67.i[916,929] [2025-03-03 23:01:10,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:01:10,097 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:01:10,106 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-67.i[916,929] [2025-03-03 23:01:10,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:01:10,154 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:01:10,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10 WrapperNode [2025-03-03 23:01:10,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:01:10,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:01:10,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:01:10,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:01:10,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (1/1) ... [2025-03-03 23:01:10,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (1/1) ... [2025-03-03 23:01:10,213 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-03-03 23:01:10,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:01:10,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:01:10,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:01:10,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:01:10,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (1/1) ... [2025-03-03 23:01:10,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (1/1) ... [2025-03-03 23:01:10,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (1/1) ... [2025-03-03 23:01:10,257 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 23:01:10,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (1/1) ... [2025-03-03 23:01:10,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (1/1) ... [2025-03-03 23:01:10,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (1/1) ... [2025-03-03 23:01:10,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (1/1) ... [2025-03-03 23:01:10,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (1/1) ... [2025-03-03 23:01:10,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (1/1) ... [2025-03-03 23:01:10,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:01:10,275 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:01:10,275 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:01:10,275 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:01:10,279 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (1/1) ... [2025-03-03 23:01:10,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:01:10,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:10,304 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 23:01:10,306 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 23:01:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:01:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:01:10,323 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:01:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:01:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:01:10,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:01:10,398 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:01:10,399 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:01:10,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L209: havoc property_#t~bitwise22#1; [2025-03-03 23:01:10,753 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 23:01:10,753 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:01:10,767 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:01:10,768 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:01:10,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:01:10 BoogieIcfgContainer [2025-03-03 23:01:10,768 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:01:10,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:01:10,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:01:10,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:01:10,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:01:09" (1/3) ... [2025-03-03 23:01:10,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd7de94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:01:10, skipping insertion in model container [2025-03-03 23:01:10,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:10" (2/3) ... [2025-03-03 23:01:10,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd7de94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:01:10, skipping insertion in model container [2025-03-03 23:01:10,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:01:10" (3/3) ... [2025-03-03 23:01:10,776 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-67.i [2025-03-03 23:01:10,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:01:10,790 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-67.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:01:10,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:01:10,844 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;@66658a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:01:10,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:01:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 23:01:10,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 23:01:10,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:10,859 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:10,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:10,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:10,863 INFO L85 PathProgramCache]: Analyzing trace with hash -26673458, now seen corresponding path program 1 times [2025-03-03 23:01:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:10,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115405630] [2025-03-03 23:01:10,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:10,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 23:01:10,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 23:01:10,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:10,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-03 23:01:11,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:11,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115405630] [2025-03-03 23:01:11,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115405630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:01:11,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263954303] [2025-03-03 23:01:11,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:11,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:11,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:11,192 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 23:01:11,194 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 23:01:11,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 23:01:11,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 23:01:11,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:11,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:11,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:01:11,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:01:11,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-03 23:01:11,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:01:11,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263954303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:11,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:01:11,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:01:11,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984903304] [2025-03-03 23:01:11,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:11,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:01:11,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:11,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:01:11,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:01:11,419 INFO L87 Difference]: Start difference. First operand has 104 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 23:01:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:11,453 INFO L93 Difference]: Finished difference Result 202 states and 354 transitions. [2025-03-03 23:01:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:01:11,455 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2025-03-03 23:01:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:11,463 INFO L225 Difference]: With dead ends: 202 [2025-03-03 23:01:11,464 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 23:01:11,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 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 23:01:11,470 INFO L435 NwaCegarLoop]: 157 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, 157 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 23:01:11,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:01:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 23:01:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-03 23:01:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 23:01:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 159 transitions. [2025-03-03 23:01:11,514 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 159 transitions. Word has length 203 [2025-03-03 23:01:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:11,515 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 159 transitions. [2025-03-03 23:01:11,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 23:01:11,515 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 159 transitions. [2025-03-03 23:01:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 23:01:11,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:11,519 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:11,526 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 23:01:11,723 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 23:01:11,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:11,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:11,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1087712691, now seen corresponding path program 1 times [2025-03-03 23:01:11,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:11,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641671507] [2025-03-03 23:01:11,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:11,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 23:01:11,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 23:01:11,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:11,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 23:01:11,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:11,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641671507] [2025-03-03 23:01:11,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641671507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:11,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:11,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:01:11,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975074107] [2025-03-03 23:01:11,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:11,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:01:11,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:11,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:01:11,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:01:11,951 INFO L87 Difference]: Start difference. First operand 101 states and 159 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:12,065 INFO L93 Difference]: Finished difference Result 293 states and 463 transitions. [2025-03-03 23:01:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:01:12,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-03 23:01:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:12,069 INFO L225 Difference]: With dead ends: 293 [2025-03-03 23:01:12,071 INFO L226 Difference]: Without dead ends: 195 [2025-03-03 23:01:12,072 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 23:01:12,072 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 137 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:12,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 379 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:01:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-03 23:01:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2025-03-03 23:01:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 128 states have (on average 1.375) internal successors, (176), 128 states have internal predecessors, (176), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 23:01:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2025-03-03 23:01:12,099 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 203 [2025-03-03 23:01:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:12,099 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2025-03-03 23:01:12,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2025-03-03 23:01:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 23:01:12,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:12,102 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:12,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:01:12,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:12,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1423252549, now seen corresponding path program 1 times [2025-03-03 23:01:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:12,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755361343] [2025-03-03 23:01:12,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:12,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:12,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 23:01:12,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 23:01:12,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:12,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 23:01:12,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:12,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755361343] [2025-03-03 23:01:12,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755361343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:12,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:12,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:01:12,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605210658] [2025-03-03 23:01:12,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:12,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:01:12,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:12,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:01:12,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:01:12,740 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:13,016 INFO L93 Difference]: Finished difference Result 605 states and 938 transitions. [2025-03-03 23:01:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:01:13,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-03-03 23:01:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:13,021 INFO L225 Difference]: With dead ends: 605 [2025-03-03 23:01:13,022 INFO L226 Difference]: Without dead ends: 415 [2025-03-03 23:01:13,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 23:01:13,024 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 168 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:13,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 443 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:01:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-03 23:01:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 397. [2025-03-03 23:01:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 268 states have (on average 1.3694029850746268) internal successors, (367), 268 states have internal predecessors, (367), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-03 23:01:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 615 transitions. [2025-03-03 23:01:13,077 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 615 transitions. Word has length 204 [2025-03-03 23:01:13,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:13,078 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 615 transitions. [2025-03-03 23:01:13,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 615 transitions. [2025-03-03 23:01:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 23:01:13,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:13,082 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:13,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:01:13,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash -885811789, now seen corresponding path program 1 times [2025-03-03 23:01:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:13,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311660424] [2025-03-03 23:01:13,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:13,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 23:01:13,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 23:01:13,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:13,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 23:01:13,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:13,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311660424] [2025-03-03 23:01:13,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311660424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:13,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:13,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:01:13,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632612777] [2025-03-03 23:01:13,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:13,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:01:13,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:13,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:01:13,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:01:13,468 INFO L87 Difference]: Start difference. First operand 397 states and 615 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:13,758 INFO L93 Difference]: Finished difference Result 809 states and 1247 transitions. [2025-03-03 23:01:13,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:01:13,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 23:01:13,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:13,764 INFO L225 Difference]: With dead ends: 809 [2025-03-03 23:01:13,764 INFO L226 Difference]: Without dead ends: 415 [2025-03-03 23:01:13,765 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 23:01:13,766 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 163 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:13,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 446 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:01:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-03 23:01:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 399. [2025-03-03 23:01:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 270 states have (on average 1.3518518518518519) internal successors, (365), 270 states have internal predecessors, (365), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-03 23:01:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 613 transitions. [2025-03-03 23:01:13,832 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 613 transitions. Word has length 206 [2025-03-03 23:01:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:13,833 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 613 transitions. [2025-03-03 23:01:13,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 613 transitions. [2025-03-03 23:01:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:01:13,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:13,836 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:13,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:01:13,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:13,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1225925250, now seen corresponding path program 1 times [2025-03-03 23:01:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:13,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679401518] [2025-03-03 23:01:13,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:13,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:13,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:01:13,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:01:13,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:13,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 23:01:17,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:17,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679401518] [2025-03-03 23:01:17,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679401518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:17,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:17,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:01:17,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698062992] [2025-03-03 23:01:17,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:17,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:01:17,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:17,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:01:17,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:01:17,753 INFO L87 Difference]: Start difference. First operand 399 states and 613 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:18,867 INFO L93 Difference]: Finished difference Result 1192 states and 1825 transitions. [2025-03-03 23:01:18,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:01:18,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-03 23:01:18,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:18,875 INFO L225 Difference]: With dead ends: 1192 [2025-03-03 23:01:18,875 INFO L226 Difference]: Without dead ends: 999 [2025-03-03 23:01:18,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:01:18,878 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 405 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:18,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 936 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 23:01:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-03-03 23:01:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 784. [2025-03-03 23:01:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 559 states have (on average 1.4007155635062611) internal successors, (783), 559 states have internal predecessors, (783), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217) [2025-03-03 23:01:18,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1217 transitions. [2025-03-03 23:01:18,965 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1217 transitions. Word has length 208 [2025-03-03 23:01:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:18,966 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1217 transitions. [2025-03-03 23:01:18,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1217 transitions. [2025-03-03 23:01:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:01:18,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:18,968 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:18,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:01:18,968 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:18,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:18,969 INFO L85 PathProgramCache]: Analyzing trace with hash -571026109, now seen corresponding path program 1 times [2025-03-03 23:01:18,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:18,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314245062] [2025-03-03 23:01:18,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:18,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:18,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:01:18,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:01:18,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:18,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 23:01:19,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:19,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314245062] [2025-03-03 23:01:19,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314245062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:19,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:19,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:01:19,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459366884] [2025-03-03 23:01:19,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:19,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:01:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:19,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:01:19,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:01:19,096 INFO L87 Difference]: Start difference. First operand 784 states and 1217 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:19,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:19,217 INFO L93 Difference]: Finished difference Result 1856 states and 2888 transitions. [2025-03-03 23:01:19,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:01:19,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-03 23:01:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:19,224 INFO L225 Difference]: With dead ends: 1856 [2025-03-03 23:01:19,224 INFO L226 Difference]: Without dead ends: 1142 [2025-03-03 23:01:19,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 23:01:19,227 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 93 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:19,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 617 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:01:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-03-03 23:01:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1140. [2025-03-03 23:01:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 819 states have (on average 1.4017094017094016) internal successors, (1148), 819 states have internal predecessors, (1148), 310 states have call successors, (310), 10 states have call predecessors, (310), 10 states have return successors, (310), 310 states have call predecessors, (310), 310 states have call successors, (310) [2025-03-03 23:01:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1768 transitions. [2025-03-03 23:01:19,310 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1768 transitions. Word has length 208 [2025-03-03 23:01:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:19,313 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1768 transitions. [2025-03-03 23:01:19,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1768 transitions. [2025-03-03 23:01:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:01:19,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:19,315 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:19,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:01:19,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:19,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:19,315 INFO L85 PathProgramCache]: Analyzing trace with hash 715391073, now seen corresponding path program 1 times [2025-03-03 23:01:19,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:19,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592704428] [2025-03-03 23:01:19,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:19,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:19,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:01:19,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:01:19,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:19,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 23:01:20,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:20,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592704428] [2025-03-03 23:01:20,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592704428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:20,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:20,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:01:20,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131007395] [2025-03-03 23:01:20,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:20,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:01:20,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:20,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:01:20,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:01:20,715 INFO L87 Difference]: Start difference. First operand 1140 states and 1768 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:21,169 INFO L93 Difference]: Finished difference Result 1778 states and 2765 transitions. [2025-03-03 23:01:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:01:21,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-03 23:01:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:21,177 INFO L225 Difference]: With dead ends: 1778 [2025-03-03 23:01:21,177 INFO L226 Difference]: Without dead ends: 1433 [2025-03-03 23:01:21,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:01:21,179 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 195 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:21,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 776 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:01:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-03-03 23:01:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1418. [2025-03-03 23:01:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1033 states have (on average 1.4133591481122942) internal successors, (1460), 1033 states have internal predecessors, (1460), 372 states have call successors, (372), 12 states have call predecessors, (372), 12 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2025-03-03 23:01:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2204 transitions. [2025-03-03 23:01:21,276 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2204 transitions. Word has length 208 [2025-03-03 23:01:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:21,277 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2204 transitions. [2025-03-03 23:01:21,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2204 transitions. [2025-03-03 23:01:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 23:01:21,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:21,279 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:21,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 23:01:21,279 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:21,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:21,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1601810859, now seen corresponding path program 1 times [2025-03-03 23:01:21,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:21,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227885203] [2025-03-03 23:01:21,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:21,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 23:01:21,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 23:01:21,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:21,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 23:01:21,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:21,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227885203] [2025-03-03 23:01:21,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227885203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:21,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:21,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:01:21,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221994515] [2025-03-03 23:01:21,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:21,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:01:21,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:21,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:01:21,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:01:21,473 INFO L87 Difference]: Start difference. First operand 1418 states and 2204 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:21,647 INFO L93 Difference]: Finished difference Result 2643 states and 4077 transitions. [2025-03-03 23:01:21,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:01:21,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-03-03 23:01:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:21,654 INFO L225 Difference]: With dead ends: 2643 [2025-03-03 23:01:21,655 INFO L226 Difference]: Without dead ends: 1292 [2025-03-03 23:01:21,658 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 23:01:21,658 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 184 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:21,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 602 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:01:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-03-03 23:01:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1232. [2025-03-03 23:01:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 847 states have (on average 1.3565525383707202) internal successors, (1149), 847 states have internal predecessors, (1149), 372 states have call successors, (372), 12 states have call predecessors, (372), 12 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2025-03-03 23:01:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1893 transitions. [2025-03-03 23:01:21,740 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1893 transitions. Word has length 209 [2025-03-03 23:01:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:21,741 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 1893 transitions. [2025-03-03 23:01:21,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:01:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1893 transitions. [2025-03-03 23:01:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 23:01:21,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:21,742 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:21,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 23:01:21,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1931518511, now seen corresponding path program 1 times [2025-03-03 23:01:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178646878] [2025-03-03 23:01:21,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:21,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 23:01:21,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 23:01:21,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:21,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:59,519 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 23:02:07,667 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 23:02:19,770 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 23:02:35,795 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)