./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_50-while_file-86.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 e1047099521e87044ce5ae27d41e430db32c7eb9b2cde271d3abaa7b618de5ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:00:52,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:00:53,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:00:53,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:00:53,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:00:53,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:00:53,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:00:53,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:00:53,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:00:53,050 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:00:53,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:00:53,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:00:53,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:00:53,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:00:53,052 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:00:53,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:00:53,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:00:53,052 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:00:53,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:00:53,053 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:00:53,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:00:53,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:00:53,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:00:53,054 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:00:53,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:00:53,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:00:53,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:00:53,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:00:53,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:00:53,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:00:53,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:00:53,054 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 -> e1047099521e87044ce5ae27d41e430db32c7eb9b2cde271d3abaa7b618de5ae [2025-03-08 15:00:53,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:00:53,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:00:53,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:00:53,283 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:00:53,283 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:00:53,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-86.i [2025-03-08 15:00:54,431 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d582a76bb/a80ae77155944ef79ed3fc3796defbdf/FLAG23829c38e [2025-03-08 15:00:54,637 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:00:54,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-86.i [2025-03-08 15:00:54,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d582a76bb/a80ae77155944ef79ed3fc3796defbdf/FLAG23829c38e [2025-03-08 15:00:54,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d582a76bb/a80ae77155944ef79ed3fc3796defbdf [2025-03-08 15:00:54,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:00:54,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:00:54,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:00:54,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:00:54,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:00:54,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33bf08ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54, skipping insertion in model container [2025-03-08 15:00:54,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:00:54,776 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_50-while_file-86.i[915,928] [2025-03-08 15:00:54,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:00:54,824 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:00:54,832 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_50-while_file-86.i[915,928] [2025-03-08 15:00:54,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:00:54,876 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:00:54,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54 WrapperNode [2025-03-08 15:00:54,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:00:54,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:00:54,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:00:54,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:00:54,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,907 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-08 15:00:54,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:00:54,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:00:54,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:00:54,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:00:54,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,936 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-08 15:00:54,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:00:54,946 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:00:54,946 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:00:54,946 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:00:54,947 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (1/1) ... [2025-03-08 15:00:54,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:00:54,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:00:54,971 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-08 15:00:54,976 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-08 15:00:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:00:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:00:54,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:00:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:00:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:00:54,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:00:55,045 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:00:55,046 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:00:55,300 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 15:00:55,300 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:00:55,310 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:00:55,311 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:00:55,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:00:55 BoogieIcfgContainer [2025-03-08 15:00:55,311 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:00:55,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:00:55,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:00:55,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:00:55,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:00:54" (1/3) ... [2025-03-08 15:00:55,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da893c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:00:55, skipping insertion in model container [2025-03-08 15:00:55,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:00:54" (2/3) ... [2025-03-08 15:00:55,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da893c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:00:55, skipping insertion in model container [2025-03-08 15:00:55,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:00:55" (3/3) ... [2025-03-08 15:00:55,318 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-86.i [2025-03-08 15:00:55,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:00:55,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-86.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:00:55,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:00:55,376 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;@5384c886, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:00:55,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:00:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 15:00:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 15:00:55,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:00:55,386 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:00:55,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:00:55,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:00:55,390 INFO L85 PathProgramCache]: Analyzing trace with hash -24679608, now seen corresponding path program 1 times [2025-03-08 15:00:55,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:00:55,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050480338] [2025-03-08 15:00:55,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:00:55,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:00:55,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 15:00:55,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 15:00:55,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:00:55,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:00:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 15:00:55,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:00:55,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050480338] [2025-03-08 15:00:55,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050480338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:00:55,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37992648] [2025-03-08 15:00:55,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:00:55,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:00:55,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:00:55,608 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-08 15:00:55,610 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-08 15:00:55,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 15:00:55,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 15:00:55,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:00:55,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:00:55,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:00:55,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:00:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 15:00:55,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:00:55,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37992648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:00:55,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:00:55,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:00:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135796148] [2025-03-08 15:00:55,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:00:55,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:00:55,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:00:55,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:00:55,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:00:55,765 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:00:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:00:55,780 INFO L93 Difference]: Finished difference Result 102 states and 170 transitions. [2025-03-08 15:00:55,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:00:55,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2025-03-08 15:00:55,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:00:55,787 INFO L225 Difference]: With dead ends: 102 [2025-03-08 15:00:55,787 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 15:00:55,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-08 15:00:55,791 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:00:55,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:00:55,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 15:00:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 15:00:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 15:00:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2025-03-08 15:00:55,815 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 101 [2025-03-08 15:00:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:00:55,815 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2025-03-08 15:00:55,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:00:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2025-03-08 15:00:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 15:00:55,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:00:55,818 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:00:55,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:00:56,018 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-08 15:00:56,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:00:56,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:00:56,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1543714601, now seen corresponding path program 1 times [2025-03-08 15:00:56,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:00:56,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677110664] [2025-03-08 15:00:56,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:00:56,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:00:56,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 15:00:56,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 15:00:56,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:00:56,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:00:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 15:00:56,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:00:56,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677110664] [2025-03-08 15:00:56,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677110664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:00:56,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:00:56,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:00:56,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407798242] [2025-03-08 15:00:56,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:00:56,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:00:56,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:00:56,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:00:56,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:00:56,333 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:00:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:00:56,479 INFO L93 Difference]: Finished difference Result 148 states and 220 transitions. [2025-03-08 15:00:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:00:56,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2025-03-08 15:00:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:00:56,481 INFO L225 Difference]: With dead ends: 148 [2025-03-08 15:00:56,481 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 15:00:56,482 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-08 15:00:56,482 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 67 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:00:56,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 240 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:00:56,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 15:00:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2025-03-08 15:00:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 15:00:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2025-03-08 15:00:56,497 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 101 [2025-03-08 15:00:56,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:00:56,497 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2025-03-08 15:00:56,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:00:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2025-03-08 15:00:56,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 15:00:56,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:00:56,498 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:00:56,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:00:56,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:00:56,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:00:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1038155976, now seen corresponding path program 1 times [2025-03-08 15:00:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:00:56,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376513300] [2025-03-08 15:00:56,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:00:56,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:00:56,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 15:00:56,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 15:00:56,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:00:56,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:01:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 15:01:01,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:01:01,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376513300] [2025-03-08 15:01:01,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376513300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:01:01,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:01:01,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 15:01:01,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188374912] [2025-03-08 15:01:01,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:01:01,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 15:01:01,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:01:01,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 15:01:01,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:01:01,284 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:01:03,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:01:03,638 INFO L93 Difference]: Finished difference Result 204 states and 296 transitions. [2025-03-08 15:01:03,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:01:03,638 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2025-03-08 15:01:03,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:01:03,640 INFO L225 Difference]: With dead ends: 204 [2025-03-08 15:01:03,640 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 15:01:03,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-03-08 15:01:03,641 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 292 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:01:03,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 387 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:01:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 15:01:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 97. [2025-03-08 15:01:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 15:01:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2025-03-08 15:01:03,658 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 101 [2025-03-08 15:01:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:01:03,658 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2025-03-08 15:01:03,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:01:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2025-03-08 15:01:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 15:01:03,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:01:03,659 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:01:03,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:01:03,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:01:03,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:01:03,660 INFO L85 PathProgramCache]: Analyzing trace with hash -758795383, now seen corresponding path program 1 times [2025-03-08 15:01:03,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:01:03,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578887348] [2025-03-08 15:01:03,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:01:03,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:01:03,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 15:01:03,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 15:01:03,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:01:03,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:01:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 15:01:03,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:01:03,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578887348] [2025-03-08 15:01:03,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578887348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:01:03,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:01:03,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:01:03,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891832480] [2025-03-08 15:01:03,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:01:03,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:01:03,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:01:03,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:01:03,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:01:03,716 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:01:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:01:03,751 INFO L93 Difference]: Finished difference Result 192 states and 283 transitions. [2025-03-08 15:01:03,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:01:03,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2025-03-08 15:01:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:01:03,753 INFO L225 Difference]: With dead ends: 192 [2025-03-08 15:01:03,753 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 15:01:03,754 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-08 15:01:03,754 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 67 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:01:03,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 150 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:01:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 15:01:03,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2025-03-08 15:01:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:01:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 207 transitions. [2025-03-08 15:01:03,773 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 207 transitions. Word has length 101 [2025-03-08 15:01:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:01:03,773 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 207 transitions. [2025-03-08 15:01:03,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:01:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 207 transitions. [2025-03-08 15:01:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 15:01:03,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:01:03,776 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:01:03,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:01:03,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:01:03,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:01:03,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2089107076, now seen corresponding path program 1 times [2025-03-08 15:01:03,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:01:03,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556992806] [2025-03-08 15:01:03,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:01:03,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:01:03,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 15:01:03,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 15:01:03,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:01:03,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:01:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 15:01:11,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:01:11,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556992806] [2025-03-08 15:01:11,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556992806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:01:11,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:01:11,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 15:01:11,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265276434] [2025-03-08 15:01:11,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:01:11,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:01:11,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:01:11,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:01:11,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:01:11,902 INFO L87 Difference]: Start difference. First operand 142 states and 207 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:01:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:01:17,305 INFO L93 Difference]: Finished difference Result 192 states and 265 transitions. [2025-03-08 15:01:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 15:01:17,306 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-03-08 15:01:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:01:17,308 INFO L225 Difference]: With dead ends: 192 [2025-03-08 15:01:17,308 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 15:01:17,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2025-03-08 15:01:17,309 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 217 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:01:17,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 491 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 15:01:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 15:01:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 143. [2025-03-08 15:01:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 94 states have internal predecessors, (118), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:01:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 208 transitions. [2025-03-08 15:01:17,332 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 208 transitions. Word has length 102 [2025-03-08 15:01:17,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:01:17,333 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 208 transitions. [2025-03-08 15:01:17,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:01:17,333 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 208 transitions. [2025-03-08 15:01:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 15:01:17,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:01:17,334 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:01:17,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:01:17,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:01:17,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:01:17,335 INFO L85 PathProgramCache]: Analyzing trace with hash 647069625, now seen corresponding path program 1 times [2025-03-08 15:01:17,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:01:17,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708866095] [2025-03-08 15:01:17,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:01:17,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:01:17,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 15:01:17,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 15:01:17,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:01:17,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:01:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 15:01:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:01:17,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708866095] [2025-03-08 15:01:17,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708866095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:01:17,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:01:17,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:01:17,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018777532] [2025-03-08 15:01:17,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:01:17,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:01:17,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:01:17,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:01:17,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:01:17,417 INFO L87 Difference]: Start difference. First operand 143 states and 208 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:01:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:01:17,435 INFO L93 Difference]: Finished difference Result 247 states and 361 transitions. [2025-03-08 15:01:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:01:17,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-03-08 15:01:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:01:17,439 INFO L225 Difference]: With dead ends: 247 [2025-03-08 15:01:17,439 INFO L226 Difference]: Without dead ends: 151 [2025-03-08 15:01:17,440 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-08 15:01:17,442 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:01:17,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:01:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-08 15:01:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2025-03-08 15:01:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:01:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2025-03-08 15:01:17,458 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 102 [2025-03-08 15:01:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:01:17,458 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2025-03-08 15:01:17,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:01:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2025-03-08 15:01:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 15:01:17,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:01:17,459 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:01:17,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:01:17,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:01:17,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:01:17,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1534573306, now seen corresponding path program 1 times [2025-03-08 15:01:17,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:01:17,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763030667] [2025-03-08 15:01:17,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:01:17,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:01:17,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 15:01:17,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 15:01:17,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:01:17,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:01:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 15:01:21,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:01:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763030667] [2025-03-08 15:01:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763030667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:01:21,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:01:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 15:01:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132732463] [2025-03-08 15:01:21,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:01:21,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:01:21,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:01:21,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:01:21,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:01:21,716 INFO L87 Difference]: Start difference. First operand 143 states and 205 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:01:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:01:24,418 INFO L93 Difference]: Finished difference Result 193 states and 261 transitions. [2025-03-08 15:01:24,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 15:01:24,419 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2025-03-08 15:01:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:01:24,420 INFO L225 Difference]: With dead ends: 193 [2025-03-08 15:01:24,420 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 15:01:24,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2025-03-08 15:01:24,421 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 318 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:01:24,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 401 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:01:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 15:01:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 143. [2025-03-08 15:01:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:01:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2025-03-08 15:01:24,435 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 102 [2025-03-08 15:01:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:01:24,435 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2025-03-08 15:01:24,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:01:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2025-03-08 15:01:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 15:01:24,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:01:24,436 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:01:24,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:01:24,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:01:24,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:01:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash 20518040, now seen corresponding path program 1 times [2025-03-08 15:01:24,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:01:24,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910295193] [2025-03-08 15:01:24,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:01:24,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:01:24,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 15:01:24,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 15:01:24,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:01:24,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:01:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 15:01:27,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:01:27,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910295193] [2025-03-08 15:01:27,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910295193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:01:27,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:01:27,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 15:01:27,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955480436] [2025-03-08 15:01:27,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:01:27,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:01:27,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:01:27,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:01:27,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:01:27,740 INFO L87 Difference]: Start difference. First operand 143 states and 205 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:01:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:01:29,235 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2025-03-08 15:01:29,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 15:01:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-03-08 15:01:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:01:29,237 INFO L225 Difference]: With dead ends: 213 [2025-03-08 15:01:29,237 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 15:01:29,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 15:01:29,238 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 207 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:01:29,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 496 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:01:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 15:01:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 153. [2025-03-08 15:01:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:01:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2025-03-08 15:01:29,249 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102 [2025-03-08 15:01:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:01:29,250 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2025-03-08 15:01:29,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:01:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2025-03-08 15:01:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 15:01:29,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:01:29,252 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:01:29,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:01:29,253 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:01:29,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:01:29,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1786936423, now seen corresponding path program 1 times [2025-03-08 15:01:29,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:01:29,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079836507] [2025-03-08 15:01:29,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:01:29,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:01:29,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 15:01:29,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 15:01:29,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:01:29,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:01:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 15:01:33,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:01:33,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079836507] [2025-03-08 15:01:33,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079836507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:01:33,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:01:33,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 15:01:33,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483265516] [2025-03-08 15:01:33,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:01:33,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:01:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:01:33,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:01:33,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:01:33,944 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:01:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:01:38,927 INFO L93 Difference]: Finished difference Result 207 states and 278 transitions. [2025-03-08 15:01:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 15:01:38,927 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-03-08 15:01:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:01:38,928 INFO L225 Difference]: With dead ends: 207 [2025-03-08 15:01:38,928 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 15:01:38,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-03-08 15:01:38,929 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 182 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:01:38,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 455 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:01:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 15:01:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 153. [2025-03-08 15:01:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:01:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2025-03-08 15:01:38,938 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102 [2025-03-08 15:01:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:01:38,938 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2025-03-08 15:01:38,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 15:01:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2025-03-08 15:01:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 15:01:38,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:01:38,939 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:01:38,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:01:38,939 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:01:38,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:01:38,940 INFO L85 PathProgramCache]: Analyzing trace with hash 677202278, now seen corresponding path program 1 times [2025-03-08 15:01:38,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:01:38,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324161342] [2025-03-08 15:01:38,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:01:38,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:01:38,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 15:01:38,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 15:01:38,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:01:38,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:01:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 15:01:49,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:01:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324161342] [2025-03-08 15:01:49,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324161342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:01:49,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:01:49,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 15:01:49,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49210127] [2025-03-08 15:01:49,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:01:49,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 15:01:49,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:01:49,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 15:01:49,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:01:49,630 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 15:02:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:02:00,763 INFO L93 Difference]: Finished difference Result 216 states and 289 transitions. [2025-03-08 15:02:00,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 15:02:00,764 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103 [2025-03-08 15:02:00,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:02:00,765 INFO L225 Difference]: With dead ends: 216 [2025-03-08 15:02:00,765 INFO L226 Difference]: Without dead ends: 214 [2025-03-08 15:02:00,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=336, Invalid=924, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 15:02:00,766 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 162 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:02:00,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 538 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 15:02:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-08 15:02:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 157. [2025-03-08 15:02:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 108 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:02:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 223 transitions. [2025-03-08 15:02:00,775 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 223 transitions. Word has length 103 [2025-03-08 15:02:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:02:00,776 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 223 transitions. [2025-03-08 15:02:00,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 15:02:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 223 transitions. [2025-03-08 15:02:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 15:02:00,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:00,777 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:02:00,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:02:00,777 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:00,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:00,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1130252185, now seen corresponding path program 1 times [2025-03-08 15:02:00,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:02:00,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893937704] [2025-03-08 15:02:00,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:00,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:02:00,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 15:02:00,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 15:02:00,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:00,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 15:02:08,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:02:08,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893937704] [2025-03-08 15:02:08,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893937704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:02:08,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:02:08,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 15:02:08,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774578131] [2025-03-08 15:02:08,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:02:08,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 15:02:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:02:08,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 15:02:08,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:02:08,925 INFO L87 Difference]: Start difference. First operand 157 states and 223 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 15:02:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:02:14,916 INFO L93 Difference]: Finished difference Result 210 states and 283 transitions. [2025-03-08 15:02:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 15:02:14,917 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103 [2025-03-08 15:02:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:02:14,918 INFO L225 Difference]: With dead ends: 210 [2025-03-08 15:02:14,918 INFO L226 Difference]: Without dead ends: 208 [2025-03-08 15:02:14,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=358, Invalid=974, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 15:02:14,919 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 171 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:02:14,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 510 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 15:02:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-08 15:02:14,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 154. [2025-03-08 15:02:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 105 states have internal predecessors, (129), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:02:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 219 transitions. [2025-03-08 15:02:14,927 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 219 transitions. Word has length 103 [2025-03-08 15:02:14,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:02:14,928 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 219 transitions. [2025-03-08 15:02:14,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 15:02:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 219 transitions. [2025-03-08 15:02:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 15:02:14,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:14,929 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:02:14,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:02:14,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:14,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:14,929 INFO L85 PathProgramCache]: Analyzing trace with hash 414928266, now seen corresponding path program 1 times [2025-03-08 15:02:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:02:14,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142507940] [2025-03-08 15:02:14,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:02:14,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 15:02:14,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 15:02:14,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:14,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 15:02:19,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:02:19,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142507940] [2025-03-08 15:02:19,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142507940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:02:19,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:02:19,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 15:02:19,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989693918] [2025-03-08 15:02:19,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:02:19,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 15:02:19,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:02:19,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 15:02:19,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:02:19,548 INFO L87 Difference]: Start difference. First operand 154 states and 219 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:02:22,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:02:22,532 INFO L93 Difference]: Finished difference Result 198 states and 268 transitions. [2025-03-08 15:02:22,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 15:02:22,533 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103 [2025-03-08 15:02:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:02:22,534 INFO L225 Difference]: With dead ends: 198 [2025-03-08 15:02:22,534 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 15:02:22,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2025-03-08 15:02:22,535 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 233 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:02:22,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 420 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 15:02:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 15:02:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 151. [2025-03-08 15:02:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:02:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 215 transitions. [2025-03-08 15:02:22,546 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 215 transitions. Word has length 103 [2025-03-08 15:02:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:02:22,546 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 215 transitions. [2025-03-08 15:02:22,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:02:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 215 transitions. [2025-03-08 15:02:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 15:02:22,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:22,547 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:02:22,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:02:22,548 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:22,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash 724778797, now seen corresponding path program 1 times [2025-03-08 15:02:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:02:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113707606] [2025-03-08 15:02:22,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:02:22,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 15:02:22,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 15:02:22,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:22,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat