./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.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 5f70a8d930c5557b68c07ef577122d328ec387effee8f919b747045b88161608 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:12:25,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:12:25,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:12:25,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:12:25,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:12:25,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:12:25,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:12:25,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:12:25,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:12:25,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:12:25,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:12:25,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:12:25,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:12:25,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:12:25,975 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:12:25,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:12:25,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:12:25,975 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:12:25,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:12:25,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:12:25,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:12:25,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:12:25,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:12:25,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:12:25,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:12:25,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:12:25,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:12:25,977 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 -> 5f70a8d930c5557b68c07ef577122d328ec387effee8f919b747045b88161608 [2025-03-03 19:12:26,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:12:26,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:12:26,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:12:26,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:12:26,229 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:12:26,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i [2025-03-03 19:12:27,359 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19fccbcf3/958950cfc09944d8816c75bc6b8c72cb/FLAG1642d6f1f [2025-03-03 19:12:27,566 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:12:27,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i [2025-03-03 19:12:27,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19fccbcf3/958950cfc09944d8816c75bc6b8c72cb/FLAG1642d6f1f [2025-03-03 19:12:27,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19fccbcf3/958950cfc09944d8816c75bc6b8c72cb [2025-03-03 19:12:27,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:12:27,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:12:27,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:12:27,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:12:27,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:12:27,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27, skipping insertion in model container [2025-03-03 19:12:27,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:12:27,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i[913,926] [2025-03-03 19:12:27,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:12:27,770 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:12:27,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i[913,926] [2025-03-03 19:12:27,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:12:27,828 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:12:27,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27 WrapperNode [2025-03-03 19:12:27,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:12:27,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:12:27,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:12:27,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:12:27,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,874 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-03-03 19:12:27,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:12:27,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:12:27,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:12:27,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:12:27,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,908 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:12:27,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:12:27,918 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:12:27,918 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:12:27,918 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:12:27,918 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (1/1) ... [2025-03-03 19:12:27,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:12:27,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:12:27,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:12:27,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:12:27,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:12:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:12:27,973 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:12:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:12:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:12:27,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:12:28,030 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:12:28,032 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:12:28,282 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~bitwise13#1;havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2025-03-03 19:12:28,313 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-03 19:12:28,313 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:12:28,329 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:12:28,329 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:12:28,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:12:28 BoogieIcfgContainer [2025-03-03 19:12:28,329 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:12:28,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:12:28,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:12:28,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:12:28,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:12:27" (1/3) ... [2025-03-03 19:12:28,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0a0c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:12:28, skipping insertion in model container [2025-03-03 19:12:28,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:27" (2/3) ... [2025-03-03 19:12:28,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0a0c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:12:28, skipping insertion in model container [2025-03-03 19:12:28,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:12:28" (3/3) ... [2025-03-03 19:12:28,339 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-34.i [2025-03-03 19:12:28,351 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:12:28,352 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-34.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:12:28,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:12:28,405 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;@7af626d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:12:28,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:12:28,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 19:12:28,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 19:12:28,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:12:28,416 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:12:28,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:12:28,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:12:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash -651424101, now seen corresponding path program 1 times [2025-03-03 19:12:28,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:12:28,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155541172] [2025-03-03 19:12:28,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:12:28,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:12:28,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 19:12:28,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 19:12:28,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:12:28,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:12:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 19:12:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:12:28,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155541172] [2025-03-03 19:12:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155541172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:12:28,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258781821] [2025-03-03 19:12:28,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:12:28,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:12:28,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:12:28,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:12:28,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:12:28,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 19:12:28,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 19:12:28,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:12:28,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:12:28,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:12:28,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:12:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 19:12:28,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:12:28,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258781821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:12:28,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:12:28,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:12:28,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687822166] [2025-03-03 19:12:28,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:12:28,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:12:28,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:12:28,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:12:28,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:12:28,807 INFO L87 Difference]: Start difference. First operand has 70 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 19:12:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:12:28,836 INFO L93 Difference]: Finished difference Result 134 states and 220 transitions. [2025-03-03 19:12:28,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:12:28,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2025-03-03 19:12:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:12:28,843 INFO L225 Difference]: With dead ends: 134 [2025-03-03 19:12:28,843 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 19:12:28,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:12:28,853 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:12:28,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:12:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 19:12:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-03 19:12:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 19:12:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-03-03 19:12:28,887 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 94 [2025-03-03 19:12:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:12:28,889 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-03-03 19:12:28,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 19:12:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-03-03 19:12:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 19:12:28,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:12:28,891 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:12:28,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:12:29,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:12:29,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:12:29,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:12:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1432194012, now seen corresponding path program 1 times [2025-03-03 19:12:29,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:12:29,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242293481] [2025-03-03 19:12:29,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:12:29,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:12:29,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 19:12:29,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 19:12:29,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:12:29,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:12:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 19:12:29,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:12:29,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242293481] [2025-03-03 19:12:29,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242293481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:12:29,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:12:29,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:12:29,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71540747] [2025-03-03 19:12:29,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:12:29,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:12:29,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:12:29,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:12:29,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:12:29,460 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:12:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:12:29,596 INFO L93 Difference]: Finished difference Result 225 states and 342 transitions. [2025-03-03 19:12:29,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:12:29,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-03-03 19:12:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:12:29,598 INFO L225 Difference]: With dead ends: 225 [2025-03-03 19:12:29,598 INFO L226 Difference]: Without dead ends: 161 [2025-03-03 19:12:29,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:12:29,599 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 129 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:12:29,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 307 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:12:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-03 19:12:29,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 131. [2025-03-03 19:12:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 102 states have internal predecessors, (147), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:12:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2025-03-03 19:12:29,626 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 94 [2025-03-03 19:12:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:12:29,626 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2025-03-03 19:12:29,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:12:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2025-03-03 19:12:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 19:12:29,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:12:29,631 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:12:29,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:12:29,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:12:29,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:12:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 591507331, now seen corresponding path program 1 times [2025-03-03 19:12:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:12:29,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889345509] [2025-03-03 19:12:29,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:12:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:12:29,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 19:12:29,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 19:12:29,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:12:29,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:12:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 19:12:29,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:12:29,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889345509] [2025-03-03 19:12:29,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889345509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:12:29,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:12:29,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:12:29,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318227944] [2025-03-03 19:12:29,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:12:29,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:12:29,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:12:29,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:12:29,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:12:29,868 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:12:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:12:30,049 INFO L93 Difference]: Finished difference Result 382 states and 580 transitions. [2025-03-03 19:12:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:12:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2025-03-03 19:12:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:12:30,052 INFO L225 Difference]: With dead ends: 382 [2025-03-03 19:12:30,053 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 19:12:30,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:12:30,056 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 134 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:12:30,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 384 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:12:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 19:12:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 135. [2025-03-03 19:12:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 106 states have internal predecessors, (151), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:12:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2025-03-03 19:12:30,081 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 203 transitions. Word has length 95 [2025-03-03 19:12:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:12:30,082 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 203 transitions. [2025-03-03 19:12:30,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:12:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 203 transitions. [2025-03-03 19:12:30,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 19:12:30,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:12:30,083 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:12:30,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:12:30,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:12:30,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:12:30,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1218992728, now seen corresponding path program 1 times [2025-03-03 19:12:30,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:12:30,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304800532] [2025-03-03 19:12:30,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:12:30,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:12:30,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 19:12:30,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 19:12:30,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:12:30,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:12:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 19:12:30,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:12:30,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304800532] [2025-03-03 19:12:30,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304800532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:12:30,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:12:30,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:12:30,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778453298] [2025-03-03 19:12:30,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:12:30,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:12:30,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:12:30,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:12:30,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:12:30,468 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:12:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:12:30,671 INFO L93 Difference]: Finished difference Result 364 states and 547 transitions. [2025-03-03 19:12:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:12:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-03 19:12:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:12:30,674 INFO L225 Difference]: With dead ends: 364 [2025-03-03 19:12:30,676 INFO L226 Difference]: Without dead ends: 232 [2025-03-03 19:12:30,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:12:30,677 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 82 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:12:30,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 228 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:12:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-03 19:12:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 176. [2025-03-03 19:12:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 133 states have internal predecessors, (186), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:12:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 264 transitions. [2025-03-03 19:12:30,702 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 264 transitions. Word has length 96 [2025-03-03 19:12:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:12:30,702 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 264 transitions. [2025-03-03 19:12:30,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:12:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 264 transitions. [2025-03-03 19:12:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 19:12:30,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:12:30,705 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:12:30,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:12:30,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:12:30,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:12:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1724551353, now seen corresponding path program 1 times [2025-03-03 19:12:30,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:12:30,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125598353] [2025-03-03 19:12:30,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:12:30,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:12:30,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 19:12:30,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 19:12:30,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:12:30,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:12:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 19:12:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:12:32,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125598353] [2025-03-03 19:12:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125598353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:12:32,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:12:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:12:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925697733] [2025-03-03 19:12:32,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:12:32,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:12:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:12:32,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:12:32,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:12:32,071 INFO L87 Difference]: Start difference. First operand 176 states and 264 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:12:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:12:32,434 INFO L93 Difference]: Finished difference Result 372 states and 557 transitions. [2025-03-03 19:12:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:12:32,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-03 19:12:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:12:32,436 INFO L225 Difference]: With dead ends: 372 [2025-03-03 19:12:32,436 INFO L226 Difference]: Without dead ends: 240 [2025-03-03 19:12:32,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:12:32,437 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 148 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:12:32,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 287 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:12:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-03 19:12:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 182. [2025-03-03 19:12:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 139 states have (on average 1.39568345323741) internal successors, (194), 139 states have internal predecessors, (194), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:12:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 272 transitions. [2025-03-03 19:12:32,459 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 272 transitions. Word has length 96 [2025-03-03 19:12:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:12:32,459 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 272 transitions. [2025-03-03 19:12:32,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:12:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 272 transitions. [2025-03-03 19:12:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 19:12:32,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:12:32,460 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:12:32,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:12:32,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:12:32,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:12:32,461 INFO L85 PathProgramCache]: Analyzing trace with hash 174976660, now seen corresponding path program 1 times [2025-03-03 19:12:32,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:12:32,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031949209] [2025-03-03 19:12:32,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:12:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:12:32,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 19:12:32,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 19:12:32,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:12:32,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:12:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 19:12:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:12:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031949209] [2025-03-03 19:12:40,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031949209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:12:40,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:12:40,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 19:12:40,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390687431] [2025-03-03 19:12:40,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:12:40,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 19:12:40,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:12:40,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 19:12:40,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:12:40,946 INFO L87 Difference]: Start difference. First operand 182 states and 272 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:12:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:12:42,628 INFO L93 Difference]: Finished difference Result 522 states and 758 transitions. [2025-03-03 19:12:42,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:12:42,629 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-03 19:12:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:12:42,630 INFO L225 Difference]: With dead ends: 522 [2025-03-03 19:12:42,630 INFO L226 Difference]: Without dead ends: 373 [2025-03-03 19:12:42,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-03-03 19:12:42,631 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 457 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:12:42,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 545 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 19:12:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-03 19:12:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 248. [2025-03-03 19:12:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 205 states have (on average 1.395121951219512) internal successors, (286), 205 states have internal predecessors, (286), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:12:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 364 transitions. [2025-03-03 19:12:42,664 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 364 transitions. Word has length 96 [2025-03-03 19:12:42,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:12:42,664 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 364 transitions. [2025-03-03 19:12:42,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:12:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 364 transitions. [2025-03-03 19:12:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 19:12:42,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:12:42,666 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:12:42,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:12:42,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:12:42,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:12:42,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1062480341, now seen corresponding path program 1 times [2025-03-03 19:12:42,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:12:42,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525664508] [2025-03-03 19:12:42,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:12:42,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:12:42,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 19:12:42,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 19:12:42,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:12:42,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:12:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 19:12:44,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:12:44,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525664508] [2025-03-03 19:12:44,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525664508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:12:44,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:12:44,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:12:44,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149786861] [2025-03-03 19:12:44,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:12:44,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:12:44,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:12:44,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:12:44,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:12:44,228 INFO L87 Difference]: Start difference. First operand 248 states and 364 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:12:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:12:45,037 INFO L93 Difference]: Finished difference Result 551 states and 810 transitions. [2025-03-03 19:12:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:12:45,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-03 19:12:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:12:45,039 INFO L225 Difference]: With dead ends: 551 [2025-03-03 19:12:45,039 INFO L226 Difference]: Without dead ends: 403 [2025-03-03 19:12:45,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:12:45,040 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 301 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:12:45,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 392 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:12:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-03 19:12:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 289. [2025-03-03 19:12:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 246 states have (on average 1.3780487804878048) internal successors, (339), 246 states have internal predecessors, (339), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:12:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 417 transitions. [2025-03-03 19:12:45,064 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 417 transitions. Word has length 96 [2025-03-03 19:12:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:12:45,064 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 417 transitions. [2025-03-03 19:12:45,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:12:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 417 transitions. [2025-03-03 19:12:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 19:12:45,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:12:45,067 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:12:45,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:12:45,067 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:12:45,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:12:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1632477803, now seen corresponding path program 1 times [2025-03-03 19:12:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:12:45,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047132376] [2025-03-03 19:12:45,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:12:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:12:45,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 19:12:45,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 19:12:45,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:12:45,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:12:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 19:12:45,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:12:45,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047132376] [2025-03-03 19:12:45,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047132376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:12:45,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:12:45,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 19:12:45,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097159034] [2025-03-03 19:12:45,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:12:45,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:12:45,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:12:45,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:12:45,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:12:45,984 INFO L87 Difference]: Start difference. First operand 289 states and 417 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 19:12:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:12:46,719 INFO L93 Difference]: Finished difference Result 569 states and 818 transitions. [2025-03-03 19:12:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 19:12:46,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2025-03-03 19:12:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:12:46,722 INFO L225 Difference]: With dead ends: 569 [2025-03-03 19:12:46,722 INFO L226 Difference]: Without dead ends: 423 [2025-03-03 19:12:46,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:12:46,723 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 349 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:12:46,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 409 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:12:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-03 19:12:46,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 333. [2025-03-03 19:12:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 290 states have (on average 1.396551724137931) internal successors, (405), 290 states have internal predecessors, (405), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:12:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 483 transitions. [2025-03-03 19:12:46,750 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 483 transitions. Word has length 96 [2025-03-03 19:12:46,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:12:46,751 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 483 transitions. [2025-03-03 19:12:46,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 19:12:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 483 transitions. [2025-03-03 19:12:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 19:12:46,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:12:46,752 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:12:46,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:12:46,753 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:12:46,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:12:46,754 INFO L85 PathProgramCache]: Analyzing trace with hash -335557517, now seen corresponding path program 1 times [2025-03-03 19:12:46,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:12:46,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387507020] [2025-03-03 19:12:46,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:12:46,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:12:46,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 19:12:46,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 19:12:46,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:12:46,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 19:13:13,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:13:13,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387507020] [2025-03-03 19:13:13,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387507020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:13:13,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:13:13,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 19:13:13,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147418394] [2025-03-03 19:13:13,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:13:13,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:13:13,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:13:13,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:13:13,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:13:13,631 INFO L87 Difference]: Start difference. First operand 333 states and 483 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:13:15,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:15,302 INFO L93 Difference]: Finished difference Result 457 states and 653 transitions. [2025-03-03 19:13:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 19:13:15,303 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-03 19:13:15,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:15,304 INFO L225 Difference]: With dead ends: 457 [2025-03-03 19:13:15,304 INFO L226 Difference]: Without dead ends: 391 [2025-03-03 19:13:15,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2025-03-03 19:13:15,305 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 270 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:15,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 852 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:13:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-03 19:13:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 322. [2025-03-03 19:13:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 279 states have (on average 1.4050179211469533) internal successors, (392), 279 states have internal predecessors, (392), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:13:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 470 transitions. [2025-03-03 19:13:15,332 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 470 transitions. Word has length 96 [2025-03-03 19:13:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:15,332 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 470 transitions. [2025-03-03 19:13:15,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:13:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 470 transitions. [2025-03-03 19:13:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 19:13:15,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:15,334 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:15,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:13:15,334 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:15,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1540719902, now seen corresponding path program 1 times [2025-03-03 19:13:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:13:15,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815954193] [2025-03-03 19:13:15,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:15,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:13:15,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 19:13:15,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 19:13:15,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:15,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 19:13:37,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:13:37,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815954193] [2025-03-03 19:13:37,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815954193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:13:37,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:13:37,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:13:37,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784721813] [2025-03-03 19:13:37,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:13:37,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:13:37,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:13:37,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:13:37,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:13:37,175 INFO L87 Difference]: Start difference. First operand 322 states and 470 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:13:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:37,622 INFO L93 Difference]: Finished difference Result 772 states and 1117 transitions. [2025-03-03 19:13:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:13:37,622 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2025-03-03 19:13:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:37,624 INFO L225 Difference]: With dead ends: 772 [2025-03-03 19:13:37,624 INFO L226 Difference]: Without dead ends: 640 [2025-03-03 19:13:37,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:13:37,626 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 261 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:37,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 704 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:13:37,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-03 19:13:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 474. [2025-03-03 19:13:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 424 states have (on average 1.3891509433962264) internal successors, (589), 425 states have internal predecessors, (589), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 19:13:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 677 transitions. [2025-03-03 19:13:37,656 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 677 transitions. Word has length 97 [2025-03-03 19:13:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:37,656 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 677 transitions. [2025-03-03 19:13:37,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:13:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 677 transitions. [2025-03-03 19:13:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 19:13:37,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:37,659 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:37,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:13:37,660 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:37,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:37,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1400937697, now seen corresponding path program 1 times [2025-03-03 19:13:37,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:13:37,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131178718] [2025-03-03 19:13:37,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:37,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:13:37,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 19:13:37,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 19:13:37,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:37,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 19:13:59,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:13:59,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131178718] [2025-03-03 19:13:59,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131178718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:13:59,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:13:59,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:13:59,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898690765] [2025-03-03 19:13:59,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:13:59,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:13:59,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:13:59,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:13:59,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:13:59,170 INFO L87 Difference]: Start difference. First operand 474 states and 677 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:13:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:59,687 INFO L93 Difference]: Finished difference Result 739 states and 1062 transitions. [2025-03-03 19:13:59,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:13:59,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2025-03-03 19:13:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:59,690 INFO L225 Difference]: With dead ends: 739 [2025-03-03 19:13:59,690 INFO L226 Difference]: Without dead ends: 623 [2025-03-03 19:13:59,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:13:59,690 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 233 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:59,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1129 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:13:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-03 19:13:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 522. [2025-03-03 19:13:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 463 states have (on average 1.3844492440604752) internal successors, (641), 463 states have internal predecessors, (641), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 19:13:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 745 transitions. [2025-03-03 19:13:59,713 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 745 transitions. Word has length 97 [2025-03-03 19:13:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:59,714 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 745 transitions. [2025-03-03 19:13:59,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:13:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 745 transitions. [2025-03-03 19:13:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 19:13:59,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:59,717 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:59,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 19:13:59,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:59,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:59,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2009973688, now seen corresponding path program 1 times [2025-03-03 19:13:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:13:59,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982083515] [2025-03-03 19:13:59,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:13:59,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 19:13:59,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 19:13:59,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:59,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat