./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_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-1loop_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 f6ff634e5a2ddc2f99bfdcb8104b17cc6d633ac176eb1b09b8fd9ed3cc24553b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:49:15,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:49:15,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:49:15,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:49:15,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:49:15,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:49:15,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:49:15,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:49:15,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:49:15,122 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:49:15,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:49:15,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:49:15,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:49:15,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:49:15,123 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:49:15,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:49:15,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:49:15,124 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:49:15,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:49:15,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:49:15,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:49:15,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:49:15,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:49:15,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:49:15,125 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:49:15,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:49:15,125 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:49:15,125 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:49:15,125 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:49:15,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:49:15,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:49:15,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:49:15,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:49:15,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:49:15,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:49:15,126 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:49:15,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:49:15,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:49:15,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:49:15,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:49:15,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:49:15,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:49:15,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:49:15,126 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 -> f6ff634e5a2ddc2f99bfdcb8104b17cc6d633ac176eb1b09b8fd9ed3cc24553b [2025-03-08 14:49:15,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:49:15,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:49:15,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:49:15,347 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:49:15,347 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:49:15,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i [2025-03-08 14:49:16,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9d2ef46e/f6444cbd10ce4c6981cee185685d57e3/FLAG8e4ea3aab [2025-03-08 14:49:16,731 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:49:16,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i [2025-03-08 14:49:16,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9d2ef46e/f6444cbd10ce4c6981cee185685d57e3/FLAG8e4ea3aab [2025-03-08 14:49:17,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9d2ef46e/f6444cbd10ce4c6981cee185685d57e3 [2025-03-08 14:49:17,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:49:17,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:49:17,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:49:17,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:49:17,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:49:17,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@782066b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17, skipping insertion in model container [2025-03-08 14:49:17,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:49:17,206 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-1loop_file-86.i[915,928] [2025-03-08 14:49:17,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:49:17,259 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:49:17,269 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-1loop_file-86.i[915,928] [2025-03-08 14:49:17,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:49:17,317 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:49:17,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17 WrapperNode [2025-03-08 14:49:17,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:49:17,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:49:17,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:49:17,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:49:17,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,363 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-08 14:49:17,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:49:17,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:49:17,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:49:17,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:49:17,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,399 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 14:49:17,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,411 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:49:17,421 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:49:17,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:49:17,421 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:49:17,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (1/1) ... [2025-03-08 14:49:17,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:49:17,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:49:17,450 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 14:49:17,454 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 14:49:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:49:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:49:17,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:49:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:49:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:49:17,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:49:17,523 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:49:17,524 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:49:17,778 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-08 14:49:17,778 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:49:17,786 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:49:17,786 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:49:17,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:49:17 BoogieIcfgContainer [2025-03-08 14:49:17,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:49:17,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:49:17,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:49:17,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:49:17,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:49:17" (1/3) ... [2025-03-08 14:49:17,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648be4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:49:17, skipping insertion in model container [2025-03-08 14:49:17,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:17" (2/3) ... [2025-03-08 14:49:17,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648be4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:49:17, skipping insertion in model container [2025-03-08 14:49:17,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:49:17" (3/3) ... [2025-03-08 14:49:17,796 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-86.i [2025-03-08 14:49:17,810 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:49:17,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-86.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:49:17,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:49:17,870 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;@4b64de81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:49:17,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:49:17,874 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 14:49:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 14:49:17,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:49:17,882 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 14:49:17,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:49:17,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:49:17,886 INFO L85 PathProgramCache]: Analyzing trace with hash -24679608, now seen corresponding path program 1 times [2025-03-08 14:49:17,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:49:17,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934224374] [2025-03-08 14:49:17,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:17,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:49:17,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 14:49:17,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 14:49:17,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:17,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:49:18,113 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 14:49:18,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:49:18,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934224374] [2025-03-08 14:49:18,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934224374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:49:18,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689756508] [2025-03-08 14:49:18,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:18,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:49:18,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:49:18,118 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 14:49:18,120 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 14:49:18,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 14:49:18,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 14:49:18,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:18,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:49:18,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:49:18,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:49:18,277 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 14:49:18,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:49:18,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689756508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:49:18,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:49:18,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:49:18,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733572860] [2025-03-08 14:49:18,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:49:18,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:49:18,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:49:18,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:49:18,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:49:18,302 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 14:49:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:49:18,316 INFO L93 Difference]: Finished difference Result 105 states and 172 transitions. [2025-03-08 14:49:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:49:18,317 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 14:49:18,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:49:18,322 INFO L225 Difference]: With dead ends: 105 [2025-03-08 14:49:18,323 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 14:49:18,325 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 14:49:18,327 INFO L435 NwaCegarLoop]: 78 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, 78 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 14:49:18,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:49:18,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 14:49:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 14:49:18,353 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 14:49:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2025-03-08 14:49:18,358 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 101 [2025-03-08 14:49:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:49:18,358 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2025-03-08 14:49:18,359 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 14:49:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2025-03-08 14:49:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 14:49:18,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:49:18,361 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 14:49:18,368 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 14:49:18,562 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 14:49:18,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:49:18,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:49:18,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1543714601, now seen corresponding path program 1 times [2025-03-08 14:49:18,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:49:18,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755177271] [2025-03-08 14:49:18,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:18,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:49:18,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 14:49:18,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 14:49:18,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:18,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:49:18,861 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 14:49:18,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:49:18,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755177271] [2025-03-08 14:49:18,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755177271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:49:18,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:49:18,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:49:18,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219149586] [2025-03-08 14:49:18,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:49:18,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:49:18,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:49:18,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:49:18,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:49:18,863 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 14:49:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:49:19,041 INFO L93 Difference]: Finished difference Result 148 states and 220 transitions. [2025-03-08 14:49:19,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:49:19,042 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 14:49:19,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:49:19,043 INFO L225 Difference]: With dead ends: 148 [2025-03-08 14:49:19,043 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 14:49:19,046 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 14:49:19,047 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 14:49:19,047 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 14:49:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 14:49:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2025-03-08 14:49:19,067 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 14:49:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2025-03-08 14:49:19,068 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 101 [2025-03-08 14:49:19,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:49:19,068 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2025-03-08 14:49:19,068 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 14:49:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2025-03-08 14:49:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 14:49:19,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:49:19,072 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 14:49:19,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:49:19,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:49:19,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:49:19,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1038155976, now seen corresponding path program 1 times [2025-03-08 14:49:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:49:19,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330616114] [2025-03-08 14:49:19,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:49:19,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 14:49:19,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 14:49:19,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:19,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:49:24,770 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 14:49:24,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:49:24,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330616114] [2025-03-08 14:49:24,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330616114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:49:24,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:49:24,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 14:49:24,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985156386] [2025-03-08 14:49:24,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:49:24,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 14:49:24,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:49:24,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 14:49:24,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 14:49:24,772 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 14:49:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:49:26,796 INFO L93 Difference]: Finished difference Result 195 states and 281 transitions. [2025-03-08 14:49:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 14:49:26,797 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 14:49:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:49:26,799 INFO L225 Difference]: With dead ends: 195 [2025-03-08 14:49:26,799 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 14:49:26,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2025-03-08 14:49:26,800 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 295 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:49:26,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 368 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 14:49:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 14:49:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 97. [2025-03-08 14:49:26,817 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 14:49:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2025-03-08 14:49:26,820 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 101 [2025-03-08 14:49:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:49:26,820 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2025-03-08 14:49:26,820 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 14:49:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2025-03-08 14:49:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 14:49:26,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:49:26,822 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 14:49:26,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:49:26,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:49:26,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:49:26,823 INFO L85 PathProgramCache]: Analyzing trace with hash -758795383, now seen corresponding path program 1 times [2025-03-08 14:49:26,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:49:26,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641770579] [2025-03-08 14:49:26,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:26,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:49:26,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 14:49:26,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 14:49:26,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:26,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:49:26,866 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 14:49:26,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:49:26,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641770579] [2025-03-08 14:49:26,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641770579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:49:26,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:49:26,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:49:26,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169152080] [2025-03-08 14:49:26,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:49:26,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:49:26,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:49:26,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:49:26,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:49:26,867 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 14:49:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:49:26,896 INFO L93 Difference]: Finished difference Result 192 states and 283 transitions. [2025-03-08 14:49:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:49:26,897 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 14:49:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:49:26,898 INFO L225 Difference]: With dead ends: 192 [2025-03-08 14:49:26,898 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 14:49:26,899 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 14:49:26,899 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 14:49:26,899 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 14:49:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 14:49:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2025-03-08 14:49:26,910 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 14:49:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 207 transitions. [2025-03-08 14:49:26,911 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 207 transitions. Word has length 101 [2025-03-08 14:49:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:49:26,912 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 207 transitions. [2025-03-08 14:49:26,912 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 14:49:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 207 transitions. [2025-03-08 14:49:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:49:26,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:49:26,913 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 14:49:26,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:49:26,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:49:26,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:49:26,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2089107076, now seen corresponding path program 1 times [2025-03-08 14:49:26,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:49:26,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864407286] [2025-03-08 14:49:26,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:26,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:49:26,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:49:26,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:49:26,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:26,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:49:30,939 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 14:49:30,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:49:30,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864407286] [2025-03-08 14:49:30,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864407286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:49:30,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:49:30,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 14:49:30,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607642677] [2025-03-08 14:49:30,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:49:30,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 14:49:30,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:49:30,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 14:49:30,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:49:30,943 INFO L87 Difference]: Start difference. First operand 142 states and 207 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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 14:49:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:49:33,346 INFO L93 Difference]: Finished difference Result 192 states and 265 transitions. [2025-03-08 14:49:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 14:49:33,347 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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 14:49:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:49:33,348 INFO L225 Difference]: With dead ends: 192 [2025-03-08 14:49:33,348 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 14:49:33,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2025-03-08 14:49:33,349 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 314 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 14:49:33,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 390 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 14:49:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 14:49:33,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 143. [2025-03-08 14:49:33,369 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 14:49:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 208 transitions. [2025-03-08 14:49:33,370 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 208 transitions. Word has length 102 [2025-03-08 14:49:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:49:33,371 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 208 transitions. [2025-03-08 14:49:33,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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 14:49:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 208 transitions. [2025-03-08 14:49:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:49:33,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:49:33,372 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 14:49:33,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 14:49:33,372 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:49:33,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:49:33,374 INFO L85 PathProgramCache]: Analyzing trace with hash 647069625, now seen corresponding path program 1 times [2025-03-08 14:49:33,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:49:33,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998193403] [2025-03-08 14:49:33,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:33,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:49:33,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:49:33,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:49:33,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:33,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:49:33,460 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 14:49:33,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:49:33,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998193403] [2025-03-08 14:49:33,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998193403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:49:33,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:49:33,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:49:33,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006088574] [2025-03-08 14:49:33,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:49:33,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:49:33,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:49:33,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:49:33,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:49:33,462 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 14:49:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:49:33,480 INFO L93 Difference]: Finished difference Result 247 states and 361 transitions. [2025-03-08 14:49:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:49:33,481 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 14:49:33,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:49:33,483 INFO L225 Difference]: With dead ends: 247 [2025-03-08 14:49:33,483 INFO L226 Difference]: Without dead ends: 151 [2025-03-08 14:49:33,484 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 14:49:33,485 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 14:49:33,485 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 14:49:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-08 14:49:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2025-03-08 14:49:33,499 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 14:49:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2025-03-08 14:49:33,501 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 102 [2025-03-08 14:49:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:49:33,501 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2025-03-08 14:49:33,502 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 14:49:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2025-03-08 14:49:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:49:33,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:49:33,503 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 14:49:33,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 14:49:33,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:49:33,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:49:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1534573306, now seen corresponding path program 1 times [2025-03-08 14:49:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:49:33,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454130719] [2025-03-08 14:49:33,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:33,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:49:33,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:49:33,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:49:33,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:33,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:49:37,860 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 14:49:37,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:49:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454130719] [2025-03-08 14:49:37,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454130719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:49:37,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:49:37,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 14:49:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252812187] [2025-03-08 14:49:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:49:37,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 14:49:37,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:49:37,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 14:49:37,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-08 14:49:37,861 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 14:49:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:49:40,567 INFO L93 Difference]: Finished difference Result 193 states and 261 transitions. [2025-03-08 14:49:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 14:49:40,567 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 14:49:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:49:40,568 INFO L225 Difference]: With dead ends: 193 [2025-03-08 14:49:40,568 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 14:49:40,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2025-03-08 14:49:40,573 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 191 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 14:49:40,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 454 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 14:49:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 14:49:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 143. [2025-03-08 14:49:40,582 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 14:49:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2025-03-08 14:49:40,583 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 102 [2025-03-08 14:49:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:49:40,583 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2025-03-08 14:49:40,583 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 14:49:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2025-03-08 14:49:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:49:40,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:49:40,584 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 14:49:40,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 14:49:40,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:49:40,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:49:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash 20518040, now seen corresponding path program 1 times [2025-03-08 14:49:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:49:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533362871] [2025-03-08 14:49:40,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:49:40,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:49:40,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:49:40,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:40,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:49:44,228 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 14:49:44,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:49:44,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533362871] [2025-03-08 14:49:44,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533362871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:49:44,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:49:44,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 14:49:44,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790359747] [2025-03-08 14:49:44,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:49:44,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 14:49:44,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:49:44,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 14:49:44,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-08 14:49:44,230 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 14:49:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:49:45,816 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2025-03-08 14:49:45,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 14:49:45,817 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 14:49:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:49:45,818 INFO L225 Difference]: With dead ends: 213 [2025-03-08 14:49:45,818 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 14:49:45,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 14:49:45,819 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 213 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:49:45,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 468 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 14:49:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 14:49:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 153. [2025-03-08 14:49:45,828 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 14:49:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2025-03-08 14:49:45,829 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102 [2025-03-08 14:49:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:49:45,830 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2025-03-08 14:49:45,830 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 14:49:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2025-03-08 14:49:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:49:45,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:49:45,831 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 14:49:45,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 14:49:45,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:49:45,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:49:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1786936423, now seen corresponding path program 1 times [2025-03-08 14:49:45,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:49:45,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065510218] [2025-03-08 14:49:45,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:45,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:49:45,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:49:45,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:49:45,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:45,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:49:51,342 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 14:49:51,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:49:51,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065510218] [2025-03-08 14:49:51,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065510218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:49:51,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:49:51,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 14:49:51,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569108769] [2025-03-08 14:49:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:49:51,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 14:49:51,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:49:51,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 14:49:51,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-08 14:49:51,343 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 14:49:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:49:56,374 INFO L93 Difference]: Finished difference Result 207 states and 278 transitions. [2025-03-08 14:49:56,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 14:49:56,375 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 14:49:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:49:56,377 INFO L225 Difference]: With dead ends: 207 [2025-03-08 14:49:56,377 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 14:49:56,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-03-08 14:49:56,378 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 183 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:49:56,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 472 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 14:49:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 14:49:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 153. [2025-03-08 14:49:56,391 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 14:49:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2025-03-08 14:49:56,392 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102 [2025-03-08 14:49:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:49:56,393 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2025-03-08 14:49:56,393 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 14:49:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2025-03-08 14:49:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 14:49:56,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:49:56,394 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 14:49:56,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 14:49:56,394 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:49:56,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:49:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash 677202278, now seen corresponding path program 1 times [2025-03-08 14:49:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:49:56,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064156633] [2025-03-08 14:49:56,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:56,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:49:56,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:49:56,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:49:56,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:56,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:50:07,814 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 14:50:07,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:50:07,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064156633] [2025-03-08 14:50:07,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064156633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:50:07,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:50:07,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 14:50:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475425278] [2025-03-08 14:50:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:50:07,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 14:50:07,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:50:07,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 14:50:07,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-08 14:50:07,816 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), 2 states have call successors, (15), 1 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 14:50:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:50:14,772 INFO L93 Difference]: Finished difference Result 218 states and 290 transitions. [2025-03-08 14:50:14,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 14:50:14,773 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), 2 states have call successors, (15), 1 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 103 [2025-03-08 14:50:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:50:14,774 INFO L225 Difference]: With dead ends: 218 [2025-03-08 14:50:14,775 INFO L226 Difference]: Without dead ends: 216 [2025-03-08 14:50:14,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=389, Invalid=1017, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 14:50:14,776 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 194 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 14:50:14,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 513 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 14:50:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-08 14:50:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 157. [2025-03-08 14:50:14,785 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 14:50:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 223 transitions. [2025-03-08 14:50:14,786 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 223 transitions. Word has length 103 [2025-03-08 14:50:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:50:14,786 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 223 transitions. [2025-03-08 14:50:14,786 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), 2 states have call successors, (15), 1 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 14:50:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 223 transitions. [2025-03-08 14:50:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 14:50:14,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:50:14,787 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 14:50:14,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 14:50:14,787 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:50:14,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:50:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1130252185, now seen corresponding path program 1 times [2025-03-08 14:50:14,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:50:14,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866626538] [2025-03-08 14:50:14,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:50:14,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:50:14,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:50:14,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:50:14,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:50:14,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:50:26,385 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 14:50:26,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:50:26,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866626538] [2025-03-08 14:50:26,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866626538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:50:26,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:50:26,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 14:50:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161581226] [2025-03-08 14:50:26,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:50:26,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 14:50:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:50:26,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 14:50:26,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-03-08 14:50:26,387 INFO L87 Difference]: Start difference. First operand 157 states and 223 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (15), 1 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 14:50:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:50:36,373 INFO L93 Difference]: Finished difference Result 212 states and 284 transitions. [2025-03-08 14:50:36,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 14:50:36,374 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), 2 states have call successors, (15), 1 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 103 [2025-03-08 14:50:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:50:36,376 INFO L225 Difference]: With dead ends: 212 [2025-03-08 14:50:36,376 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 14:50:36,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=384, Invalid=948, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 14:50:36,376 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 206 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:50:36,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 458 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 14:50:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 14:50:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 154. [2025-03-08 14:50:36,391 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 14:50:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 219 transitions. [2025-03-08 14:50:36,392 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 219 transitions. Word has length 103 [2025-03-08 14:50:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:50:36,392 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 219 transitions. [2025-03-08 14:50:36,393 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), 2 states have call successors, (15), 1 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 14:50:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 219 transitions. [2025-03-08 14:50:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 14:50:36,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:50:36,393 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 14:50:36,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 14:50:36,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:50:36,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:50:36,395 INFO L85 PathProgramCache]: Analyzing trace with hash 414928266, now seen corresponding path program 1 times [2025-03-08 14:50:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:50:36,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502591057] [2025-03-08 14:50:36,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:50:36,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:50:36,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:50:36,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:50:36,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:50:36,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:50:40,640 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 14:50:40,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:50:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502591057] [2025-03-08 14:50:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502591057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:50:40,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:50:40,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 14:50:40,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499666997] [2025-03-08 14:50:40,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:50:40,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 14:50:40,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:50:40,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 14:50:40,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-08 14:50:40,641 INFO L87 Difference]: Start difference. First operand 154 states and 219 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 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 14:50:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:50:44,074 INFO L93 Difference]: Finished difference Result 198 states and 268 transitions. [2025-03-08 14:50:44,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 14:50:44,075 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 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 103 [2025-03-08 14:50:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:50:44,076 INFO L225 Difference]: With dead ends: 198 [2025-03-08 14:50:44,076 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 14:50:44,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2025-03-08 14:50:44,077 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 142 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 14:50:44,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 473 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 14:50:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 14:50:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 151. [2025-03-08 14:50:44,085 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 14:50:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 215 transitions. [2025-03-08 14:50:44,086 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 215 transitions. Word has length 103 [2025-03-08 14:50:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:50:44,086 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 215 transitions. [2025-03-08 14:50:44,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 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 14:50:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 215 transitions. [2025-03-08 14:50:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 14:50:44,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:50:44,087 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 14:50:44,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 14:50:44,087 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:50:44,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:50:44,088 INFO L85 PathProgramCache]: Analyzing trace with hash 724778797, now seen corresponding path program 1 times [2025-03-08 14:50:44,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:50:44,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401333407] [2025-03-08 14:50:44,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:50:44,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:50:44,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:50:44,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:50:44,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:50:44,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat