./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.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_fillercodestructure_filler-pr-ci_file-66.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 0cbadd5c8de40e45d11c8c9bd5d5aa33e26bba45cb60181d9a1abcae7f03bb4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:06:49,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:06:49,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:06:49,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:06:49,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:06:49,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:06:49,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:06:49,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:06:49,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:06:49,545 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:06:49,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:06:49,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:06:49,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:06:49,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:06:49,547 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:06:49,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:06:49,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:06:49,547 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:06:49,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:06:49,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:06:49,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:06:49,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:06:49,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:06:49,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:06:49,548 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:06:49,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:06:49,548 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:06:49,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:06:49,548 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:06:49,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:06:49,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:06:49,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:06:49,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:06:49,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:06:49,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:06:49,549 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:06:49,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:06:49,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:06:49,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:06:49,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:06:49,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:06:49,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:06:49,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:06:49,550 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 -> 0cbadd5c8de40e45d11c8c9bd5d5aa33e26bba45cb60181d9a1abcae7f03bb4b [2025-03-03 21:06:49,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:06:49,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:06:49,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:06:49,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:06:49,809 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:06:49,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i [2025-03-03 21:06:50,951 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7dda0cf5/b0fe96e7079c467fb048117ac5b2a14d/FLAG5c5fcf6c4 [2025-03-03 21:06:51,193 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:06:51,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i [2025-03-03 21:06:51,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7dda0cf5/b0fe96e7079c467fb048117ac5b2a14d/FLAG5c5fcf6c4 [2025-03-03 21:06:51,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7dda0cf5/b0fe96e7079c467fb048117ac5b2a14d [2025-03-03 21:06:51,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:06:51,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:06:51,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:06:51,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:06:51,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:06:51,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51, skipping insertion in model container [2025-03-03 21:06:51,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:06:51,649 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_fillercodestructure_filler-pr-ci_file-66.i[919,932] [2025-03-03 21:06:51,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:06:51,724 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:06:51,732 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_fillercodestructure_filler-pr-ci_file-66.i[919,932] [2025-03-03 21:06:51,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:06:51,790 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:06:51,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51 WrapperNode [2025-03-03 21:06:51,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:06:51,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:06:51,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:06:51,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:06:51,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,836 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-03-03 21:06:51,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:06:51,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:06:51,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:06:51,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:06:51,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,864 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 21:06:51,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:06:51,884 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:06:51,885 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:06:51,885 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:06:51,885 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (1/1) ... [2025-03-03 21:06:51,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:06:51,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:06:51,912 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 21:06:51,918 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 21:06:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:06:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:06:51,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:06:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:06:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:06:51,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:06:52,004 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:06:52,006 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:06:52,289 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 21:06:52,289 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:06:52,297 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:06:52,298 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:06:52,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:06:52 BoogieIcfgContainer [2025-03-03 21:06:52,298 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:06:52,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:06:52,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:06:52,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:06:52,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:06:51" (1/3) ... [2025-03-03 21:06:52,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b81984e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:06:52, skipping insertion in model container [2025-03-03 21:06:52,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:51" (2/3) ... [2025-03-03 21:06:52,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b81984e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:06:52, skipping insertion in model container [2025-03-03 21:06:52,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:06:52" (3/3) ... [2025-03-03 21:06:52,307 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i [2025-03-03 21:06:52,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:06:52,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:06:52,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:06:52,379 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;@5ee6fb38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:06:52,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:06:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:06:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 21:06:52,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:52,397 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:06:52,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:52,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1479191098, now seen corresponding path program 1 times [2025-03-03 21:06:52,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:52,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941283362] [2025-03-03 21:06:52,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:52,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:52,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 21:06:52,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 21:06:52,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:52,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 21:06:52,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:52,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941283362] [2025-03-03 21:06:52,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941283362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:06:52,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002991631] [2025-03-03 21:06:52,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:52,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:06:52,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:06:52,698 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 21:06:52,722 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 21:06:52,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 21:06:52,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 21:06:52,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:52,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:52,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:06:52,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:06:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 21:06:52,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:06:52,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002991631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:52,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:06:52,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:06:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294079129] [2025-03-03 21:06:52,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:52,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:06:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:52,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:06:52,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:06:52,916 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:06:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:52,936 INFO L93 Difference]: Finished difference Result 154 states and 269 transitions. [2025-03-03 21:06:52,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:06:52,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-03-03 21:06:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:52,943 INFO L225 Difference]: With dead ends: 154 [2025-03-03 21:06:52,943 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 21:06:52,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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 21:06:52,948 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:52,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:06:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 21:06:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 21:06:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 53 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:06:52,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions. [2025-03-03 21:06:52,990 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 149 [2025-03-03 21:06:52,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:52,991 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 121 transitions. [2025-03-03 21:06:52,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:06:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 121 transitions. [2025-03-03 21:06:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 21:06:52,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:52,994 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:06:53,001 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 21:06:53,195 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 21:06:53,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:53,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2111041848, now seen corresponding path program 1 times [2025-03-03 21:06:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233847462] [2025-03-03 21:06:53,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:53,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 21:06:53,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 21:06:53,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:53,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:06:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233847462] [2025-03-03 21:06:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233847462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:53,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:53,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:06:53,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871948996] [2025-03-03 21:06:53,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:53,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:06:53,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:53,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:06:53,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:06:53,783 INFO L87 Difference]: Start difference. First operand 77 states and 121 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:54,168 INFO L93 Difference]: Finished difference Result 251 states and 405 transitions. [2025-03-03 21:06:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:06:54,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-03-03 21:06:54,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:54,170 INFO L225 Difference]: With dead ends: 251 [2025-03-03 21:06:54,170 INFO L226 Difference]: Without dead ends: 177 [2025-03-03 21:06:54,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:06:54,172 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 148 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:54,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 453 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:06:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-03 21:06:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 139. [2025-03-03 21:06:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 21:06:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 217 transitions. [2025-03-03 21:06:54,205 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 217 transitions. Word has length 149 [2025-03-03 21:06:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:54,205 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 217 transitions. [2025-03-03 21:06:54,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:54,206 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 217 transitions. [2025-03-03 21:06:54,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 21:06:54,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:54,207 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:06:54,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:06:54,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:54,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:54,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1266569977, now seen corresponding path program 1 times [2025-03-03 21:06:54,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:54,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500548498] [2025-03-03 21:06:54,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:54,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:54,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 21:06:54,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 21:06:54,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:54,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:06:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:55,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500548498] [2025-03-03 21:06:55,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500548498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:55,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:55,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:06:55,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406490952] [2025-03-03 21:06:55,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:55,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:06:55,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:55,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:06:55,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:06:55,038 INFO L87 Difference]: Start difference. First operand 139 states and 217 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:06:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:55,413 INFO L93 Difference]: Finished difference Result 263 states and 424 transitions. [2025-03-03 21:06:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:06:55,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-03-03 21:06:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:55,415 INFO L225 Difference]: With dead ends: 263 [2025-03-03 21:06:55,415 INFO L226 Difference]: Without dead ends: 189 [2025-03-03 21:06:55,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:06:55,417 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 161 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:55,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 412 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:06:55,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-03 21:06:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 144. [2025-03-03 21:06:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 96 states have (on average 1.4375) internal successors, (138), 96 states have internal predecessors, (138), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 21:06:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 226 transitions. [2025-03-03 21:06:55,445 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 226 transitions. Word has length 149 [2025-03-03 21:06:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:55,445 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 226 transitions. [2025-03-03 21:06:55,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:06:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 226 transitions. [2025-03-03 21:06:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:06:55,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:55,446 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:06:55,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:06:55,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:55,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash -884279417, now seen corresponding path program 1 times [2025-03-03 21:06:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:55,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805048908] [2025-03-03 21:06:55,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:55,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:55,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:06:55,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:06:55,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:55,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:06:58,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:58,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805048908] [2025-03-03 21:06:58,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805048908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:58,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:58,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:06:58,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065620498] [2025-03-03 21:06:58,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:58,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:06:58,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:58,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:06:58,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:06:58,495 INFO L87 Difference]: Start difference. First operand 144 states and 226 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:59,526 INFO L93 Difference]: Finished difference Result 388 states and 593 transitions. [2025-03-03 21:06:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:06:59,527 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 21:06:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:59,530 INFO L225 Difference]: With dead ends: 388 [2025-03-03 21:06:59,531 INFO L226 Difference]: Without dead ends: 314 [2025-03-03 21:06:59,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:06:59,532 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 238 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:59,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 735 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:06:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-03 21:06:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 222. [2025-03-03 21:06:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.4911242603550297) internal successors, (252), 170 states have internal predecessors, (252), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:06:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 348 transitions. [2025-03-03 21:06:59,552 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 348 transitions. Word has length 150 [2025-03-03 21:06:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:59,553 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 348 transitions. [2025-03-03 21:06:59,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 348 transitions. [2025-03-03 21:06:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:06:59,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:59,557 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:06:59,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:06:59,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:59,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash -883355896, now seen corresponding path program 1 times [2025-03-03 21:06:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:59,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227226520] [2025-03-03 21:06:59,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:59,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:06:59,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:06:59,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:59,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:03,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:03,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227226520] [2025-03-03 21:07:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227226520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:03,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:03,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:07:03,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619927340] [2025-03-03 21:07:03,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:03,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:07:03,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:03,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:07:03,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:07:03,368 INFO L87 Difference]: Start difference. First operand 222 states and 348 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:04,418 INFO L93 Difference]: Finished difference Result 314 states and 464 transitions. [2025-03-03 21:07:04,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:07:04,419 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 21:07:04,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:04,421 INFO L225 Difference]: With dead ends: 314 [2025-03-03 21:07:04,421 INFO L226 Difference]: Without dead ends: 312 [2025-03-03 21:07:04,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:07:04,422 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 266 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:04,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 639 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:07:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-03 21:07:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 222. [2025-03-03 21:07:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.4911242603550297) internal successors, (252), 170 states have internal predecessors, (252), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:07:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 348 transitions. [2025-03-03 21:07:04,446 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 348 transitions. Word has length 150 [2025-03-03 21:07:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:04,446 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 348 transitions. [2025-03-03 21:07:04,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 348 transitions. [2025-03-03 21:07:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:07:04,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:04,451 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:04,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:07:04,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:04,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:04,451 INFO L85 PathProgramCache]: Analyzing trace with hash -755196698, now seen corresponding path program 1 times [2025-03-03 21:07:04,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:04,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516773492] [2025-03-03 21:07:04,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:04,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:04,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:07:04,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:07:04,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:04,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516773492] [2025-03-03 21:07:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516773492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:07,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:07:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791259736] [2025-03-03 21:07:07,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:07:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:07,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:07:07,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:07:07,241 INFO L87 Difference]: Start difference. First operand 222 states and 348 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:08,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:08,235 INFO L93 Difference]: Finished difference Result 323 states and 475 transitions. [2025-03-03 21:07:08,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:07:08,235 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 21:07:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:08,237 INFO L225 Difference]: With dead ends: 323 [2025-03-03 21:07:08,237 INFO L226 Difference]: Without dead ends: 321 [2025-03-03 21:07:08,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:07:08,238 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 276 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:08,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 547 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:07:08,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-03 21:07:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 230. [2025-03-03 21:07:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 177 states have (on average 1.4915254237288136) internal successors, (264), 178 states have internal predecessors, (264), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:07:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 360 transitions. [2025-03-03 21:07:08,250 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 360 transitions. Word has length 150 [2025-03-03 21:07:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:08,251 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 360 transitions. [2025-03-03 21:07:08,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 360 transitions. [2025-03-03 21:07:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:07:08,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:08,252 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:08,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:07:08,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:08,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -754273177, now seen corresponding path program 1 times [2025-03-03 21:07:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:08,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698001769] [2025-03-03 21:07:08,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:08,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:08,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:07:08,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:07:08,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:08,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:12,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:12,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698001769] [2025-03-03 21:07:12,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698001769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:12,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:12,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:07:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934766904] [2025-03-03 21:07:12,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:12,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:07:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:12,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:07:12,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:07:12,094 INFO L87 Difference]: Start difference. First operand 230 states and 360 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:13,349 INFO L93 Difference]: Finished difference Result 321 states and 473 transitions. [2025-03-03 21:07:13,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:07:13,353 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 21:07:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:13,356 INFO L225 Difference]: With dead ends: 321 [2025-03-03 21:07:13,356 INFO L226 Difference]: Without dead ends: 319 [2025-03-03 21:07:13,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:07:13,357 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 290 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:13,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 628 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:07:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-03 21:07:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 222. [2025-03-03 21:07:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.4911242603550297) internal successors, (252), 170 states have internal predecessors, (252), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:07:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 348 transitions. [2025-03-03 21:07:13,374 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 348 transitions. Word has length 150 [2025-03-03 21:07:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:13,376 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 348 transitions. [2025-03-03 21:07:13,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 348 transitions. [2025-03-03 21:07:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:07:13,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:13,378 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:13,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:07:13,379 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:13,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash 469030280, now seen corresponding path program 1 times [2025-03-03 21:07:13,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:13,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703392737] [2025-03-03 21:07:13,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:13,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:13,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:07:13,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:07:13,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:13,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:13,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703392737] [2025-03-03 21:07:13,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703392737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:13,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:13,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:07:13,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218654963] [2025-03-03 21:07:13,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:13,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:07:13,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:13,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:07:13,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:07:13,423 INFO L87 Difference]: Start difference. First operand 222 states and 348 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:13,476 INFO L93 Difference]: Finished difference Result 494 states and 777 transitions. [2025-03-03 21:07:13,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:07:13,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 21:07:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:13,485 INFO L225 Difference]: With dead ends: 494 [2025-03-03 21:07:13,485 INFO L226 Difference]: Without dead ends: 348 [2025-03-03 21:07:13,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:07:13,487 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 101 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:13,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 316 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:07:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-03 21:07:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2025-03-03 21:07:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 265 states have (on average 1.441509433962264) internal successors, (382), 267 states have internal predecessors, (382), 74 states have call successors, (74), 6 states have call predecessors, (74), 6 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 21:07:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 530 transitions. [2025-03-03 21:07:13,519 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 530 transitions. Word has length 150 [2025-03-03 21:07:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:13,519 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 530 transitions. [2025-03-03 21:07:13,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 530 transitions. [2025-03-03 21:07:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:07:13,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:13,521 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:13,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:07:13,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:13,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1327921079, now seen corresponding path program 1 times [2025-03-03 21:07:13,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:13,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493820630] [2025-03-03 21:07:13,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:13,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:13,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:07:13,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:07:13,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:13,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:13,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:13,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493820630] [2025-03-03 21:07:13,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493820630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:13,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:13,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:07:13,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733993234] [2025-03-03 21:07:13,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:13,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:07:13,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:13,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:07:13,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:07:13,601 INFO L87 Difference]: Start difference. First operand 346 states and 530 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:13,778 INFO L93 Difference]: Finished difference Result 780 states and 1175 transitions. [2025-03-03 21:07:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:07:13,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 21:07:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:13,782 INFO L225 Difference]: With dead ends: 780 [2025-03-03 21:07:13,782 INFO L226 Difference]: Without dead ends: 527 [2025-03-03 21:07:13,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:07:13,785 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 101 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:13,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 400 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:07:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-03 21:07:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 476. [2025-03-03 21:07:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 366 states have (on average 1.4262295081967213) internal successors, (522), 369 states have internal predecessors, (522), 100 states have call successors, (100), 9 states have call predecessors, (100), 9 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:07:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 722 transitions. [2025-03-03 21:07:13,839 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 722 transitions. Word has length 150 [2025-03-03 21:07:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:13,839 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 722 transitions. [2025-03-03 21:07:13,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 722 transitions. [2025-03-03 21:07:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:07:13,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:13,841 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:13,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:07:13,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:13,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1198838360, now seen corresponding path program 1 times [2025-03-03 21:07:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:13,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534046888] [2025-03-03 21:07:13,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:13,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:07:13,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:07:13,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:13,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:15,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534046888] [2025-03-03 21:07:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534046888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:15,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 21:07:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477449475] [2025-03-03 21:07:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:15,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:07:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:15,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:07:15,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:07:15,400 INFO L87 Difference]: Start difference. First operand 476 states and 722 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:16,356 INFO L93 Difference]: Finished difference Result 646 states and 926 transitions. [2025-03-03 21:07:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:07:16,356 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 21:07:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:16,362 INFO L225 Difference]: With dead ends: 646 [2025-03-03 21:07:16,362 INFO L226 Difference]: Without dead ends: 644 [2025-03-03 21:07:16,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:07:16,364 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 326 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:16,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 682 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 21:07:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-03 21:07:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 548. [2025-03-03 21:07:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 427 states have (on average 1.405152224824356) internal successors, (600), 432 states have internal predecessors, (600), 108 states have call successors, (108), 12 states have call predecessors, (108), 12 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 21:07:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 816 transitions. [2025-03-03 21:07:16,425 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 816 transitions. Word has length 150 [2025-03-03 21:07:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:16,425 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 816 transitions. [2025-03-03 21:07:16,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 816 transitions. [2025-03-03 21:07:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:07:16,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:16,429 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:16,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:07:16,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:16,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1197914839, now seen corresponding path program 1 times [2025-03-03 21:07:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:16,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863169307] [2025-03-03 21:07:16,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:16,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:16,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:07:16,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:07:16,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:16,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:18,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863169307] [2025-03-03 21:07:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863169307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:18,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:18,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 21:07:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049351613] [2025-03-03 21:07:18,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:18,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:07:18,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:18,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:07:18,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:07:18,811 INFO L87 Difference]: Start difference. First operand 548 states and 816 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:20,170 INFO L93 Difference]: Finished difference Result 644 states and 924 transitions. [2025-03-03 21:07:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 21:07:20,170 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 21:07:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:20,173 INFO L225 Difference]: With dead ends: 644 [2025-03-03 21:07:20,173 INFO L226 Difference]: Without dead ends: 642 [2025-03-03 21:07:20,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:07:20,174 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 342 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:20,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 803 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:07:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-03 21:07:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 548. [2025-03-03 21:07:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 427 states have (on average 1.405152224824356) internal successors, (600), 432 states have internal predecessors, (600), 108 states have call successors, (108), 12 states have call predecessors, (108), 12 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 21:07:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 816 transitions. [2025-03-03 21:07:20,207 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 816 transitions. Word has length 150 [2025-03-03 21:07:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:20,207 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 816 transitions. [2025-03-03 21:07:20,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 816 transitions. [2025-03-03 21:07:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:07:20,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:20,209 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:20,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:07:20,209 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:20,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:20,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1293103642, now seen corresponding path program 1 times [2025-03-03 21:07:20,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:20,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761720278] [2025-03-03 21:07:20,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:20,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:20,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:07:20,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:07:20,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:20,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:20,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:20,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761720278] [2025-03-03 21:07:20,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761720278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:20,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:20,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:07:20,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969528354] [2025-03-03 21:07:20,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:20,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:07:20,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:20,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:07:20,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:07:20,440 INFO L87 Difference]: Start difference. First operand 548 states and 816 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:07:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:20,763 INFO L93 Difference]: Finished difference Result 1055 states and 1582 transitions. [2025-03-03 21:07:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:07:20,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 150 [2025-03-03 21:07:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:20,767 INFO L225 Difference]: With dead ends: 1055 [2025-03-03 21:07:20,768 INFO L226 Difference]: Without dead ends: 602 [2025-03-03 21:07:20,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:07:20,770 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 214 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:20,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 422 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:07:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-03 21:07:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 547. [2025-03-03 21:07:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 426 states have (on average 1.4014084507042253) internal successors, (597), 431 states have internal predecessors, (597), 108 states have call successors, (108), 12 states have call predecessors, (108), 12 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 21:07:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 813 transitions. [2025-03-03 21:07:20,806 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 813 transitions. Word has length 150 [2025-03-03 21:07:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:20,806 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 813 transitions. [2025-03-03 21:07:20,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:07:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 813 transitions. [2025-03-03 21:07:20,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:07:20,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:20,809 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:20,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:07:20,809 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:20,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:20,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1566006792, now seen corresponding path program 1 times [2025-03-03 21:07:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:20,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685538140] [2025-03-03 21:07:20,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:20,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:07:20,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:07:20,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:20,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:20,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:20,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685538140] [2025-03-03 21:07:20,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685538140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:20,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:20,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:07:20,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461538622] [2025-03-03 21:07:20,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:20,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:07:20,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:20,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:07:20,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:07:20,985 INFO L87 Difference]: Start difference. First operand 547 states and 813 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:07:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:21,181 INFO L93 Difference]: Finished difference Result 985 states and 1449 transitions. [2025-03-03 21:07:21,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:07:21,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-03-03 21:07:21,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:21,184 INFO L225 Difference]: With dead ends: 985 [2025-03-03 21:07:21,184 INFO L226 Difference]: Without dead ends: 528 [2025-03-03 21:07:21,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:07:21,186 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 198 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:21,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 223 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:07:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-03 21:07:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 519. [2025-03-03 21:07:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 392 states have (on average 1.3596938775510203) internal successors, (533), 397 states have internal predecessors, (533), 112 states have call successors, (112), 14 states have call predecessors, (112), 14 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 21:07:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 757 transitions. [2025-03-03 21:07:21,219 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 757 transitions. Word has length 150 [2025-03-03 21:07:21,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:21,219 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 757 transitions. [2025-03-03 21:07:21,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:07:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 757 transitions. [2025-03-03 21:07:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:07:21,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:21,221 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:21,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:07:21,221 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:21,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:21,221 INFO L85 PathProgramCache]: Analyzing trace with hash -5532117, now seen corresponding path program 1 times [2025-03-03 21:07:21,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:21,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717076883] [2025-03-03 21:07:21,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:21,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:21,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:07:21,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:07:21,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:21,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:22,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:22,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717076883] [2025-03-03 21:07:22,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717076883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:22,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:22,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 21:07:22,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615469193] [2025-03-03 21:07:22,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:22,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:07:22,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:22,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:07:22,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:07:22,476 INFO L87 Difference]: Start difference. First operand 519 states and 757 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:07:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:24,278 INFO L93 Difference]: Finished difference Result 1250 states and 1811 transitions. [2025-03-03 21:07:24,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:07:24,278 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 150 [2025-03-03 21:07:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:24,282 INFO L225 Difference]: With dead ends: 1250 [2025-03-03 21:07:24,282 INFO L226 Difference]: Without dead ends: 819 [2025-03-03 21:07:24,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-03-03 21:07:24,284 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 367 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:24,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 989 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:07:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-03 21:07:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 623. [2025-03-03 21:07:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 484 states have (on average 1.3553719008264462) internal successors, (656), 493 states have internal predecessors, (656), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 111 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-03 21:07:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 896 transitions. [2025-03-03 21:07:24,329 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 896 transitions. Word has length 150 [2025-03-03 21:07:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:24,329 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 896 transitions. [2025-03-03 21:07:24,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:07:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 896 transitions. [2025-03-03 21:07:24,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:07:24,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:24,331 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:24,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 21:07:24,331 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:24,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:24,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1486608171, now seen corresponding path program 1 times [2025-03-03 21:07:24,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:24,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135415427] [2025-03-03 21:07:24,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:24,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:24,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:07:24,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:07:24,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:24,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:07:24,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:24,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135415427] [2025-03-03 21:07:24,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135415427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:07:24,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915141139] [2025-03-03 21:07:24,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:24,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:07:24,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:07:24,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:07:24,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:07:24,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:07:24,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:07:24,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:24,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:24,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:07:24,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:07:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 211 proven. 6 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2025-03-03 21:07:24,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:07:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:07:24,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915141139] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:07:24,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:07:24,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2025-03-03 21:07:24,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468652908] [2025-03-03 21:07:24,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:07:24,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:07:24,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:24,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:07:24,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:07:24,926 INFO L87 Difference]: Start difference. First operand 623 states and 896 transitions. Second operand has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) [2025-03-03 21:07:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:25,437 INFO L93 Difference]: Finished difference Result 1403 states and 2009 transitions. [2025-03-03 21:07:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 21:07:25,437 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) Word has length 151 [2025-03-03 21:07:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:25,441 INFO L225 Difference]: With dead ends: 1403 [2025-03-03 21:07:25,441 INFO L226 Difference]: Without dead ends: 972 [2025-03-03 21:07:25,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:07:25,444 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 297 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:25,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 534 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:07:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-03-03 21:07:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 945. [2025-03-03 21:07:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 724 states have (on average 1.3232044198895028) internal successors, (958), 740 states have internal predecessors, (958), 192 states have call successors, (192), 28 states have call predecessors, (192), 28 states have return successors, (192), 176 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-03 21:07:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1342 transitions. [2025-03-03 21:07:25,513 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1342 transitions. Word has length 151 [2025-03-03 21:07:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:25,513 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1342 transitions. [2025-03-03 21:07:25,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) [2025-03-03 21:07:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1342 transitions. [2025-03-03 21:07:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:07:25,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:25,515 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:25,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 21:07:25,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 21:07:25,719 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:25,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:25,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1246469363, now seen corresponding path program 1 times [2025-03-03 21:07:25,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:25,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319158063] [2025-03-03 21:07:25,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:25,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:25,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:07:25,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:07:25,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:25,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:07:25,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:25,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319158063] [2025-03-03 21:07:25,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319158063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:07:25,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548505620] [2025-03-03 21:07:25,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:25,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:07:25,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:07:25,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:07:25,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 21:07:25,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:07:25,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:07:25,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:25,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:25,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:07:25,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:07:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-03 21:07:25,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:07:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:07:26,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548505620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:07:26,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:07:26,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 21:07:26,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130824660] [2025-03-03 21:07:26,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:07:26,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:07:26,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:26,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:07:26,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:07:26,096 INFO L87 Difference]: Start difference. First operand 945 states and 1342 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-03-03 21:07:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:26,268 INFO L93 Difference]: Finished difference Result 1737 states and 2444 transitions. [2025-03-03 21:07:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:07:26,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 151 [2025-03-03 21:07:26,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:26,274 INFO L225 Difference]: With dead ends: 1737 [2025-03-03 21:07:26,274 INFO L226 Difference]: Without dead ends: 987 [2025-03-03 21:07:26,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:07:26,277 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 182 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:26,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 220 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:07:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-03-03 21:07:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 973. [2025-03-03 21:07:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 745 states have (on average 1.2993288590604026) internal successors, (968), 761 states have internal predecessors, (968), 192 states have call successors, (192), 35 states have call predecessors, (192), 35 states have return successors, (192), 176 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-03 21:07:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1352 transitions. [2025-03-03 21:07:26,355 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1352 transitions. Word has length 151 [2025-03-03 21:07:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:26,355 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1352 transitions. [2025-03-03 21:07:26,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-03-03 21:07:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1352 transitions. [2025-03-03 21:07:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:07:26,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:26,357 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:26,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 21:07:26,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:07:26,561 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:26,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash 401997492, now seen corresponding path program 1 times [2025-03-03 21:07:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:26,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152386732] [2025-03-03 21:07:26,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:26,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:26,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:07:26,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:07:26,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:26,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:26,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:26,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152386732] [2025-03-03 21:07:26,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152386732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:26,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:26,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:07:26,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757847046] [2025-03-03 21:07:26,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:26,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:07:26,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:26,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:07:26,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:07:26,824 INFO L87 Difference]: Start difference. First operand 973 states and 1352 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:27,177 INFO L93 Difference]: Finished difference Result 1615 states and 2237 transitions. [2025-03-03 21:07:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:07:27,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 21:07:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:27,182 INFO L225 Difference]: With dead ends: 1615 [2025-03-03 21:07:27,183 INFO L226 Difference]: Without dead ends: 993 [2025-03-03 21:07:27,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:07:27,184 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 118 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:27,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 439 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:07:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-03-03 21:07:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 973. [2025-03-03 21:07:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 744 states have (on average 1.2956989247311828) internal successors, (964), 760 states have internal predecessors, (964), 192 states have call successors, (192), 36 states have call predecessors, (192), 36 states have return successors, (192), 176 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-03 21:07:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1348 transitions. [2025-03-03 21:07:27,256 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1348 transitions. Word has length 151 [2025-03-03 21:07:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:27,256 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1348 transitions. [2025-03-03 21:07:27,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1348 transitions. [2025-03-03 21:07:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:07:27,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:27,258 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:27,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 21:07:27,258 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:27,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash 197299414, now seen corresponding path program 1 times [2025-03-03 21:07:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:27,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608170722] [2025-03-03 21:07:27,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:27,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:27,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:07:27,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:07:27,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:27,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:29,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608170722] [2025-03-03 21:07:29,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608170722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:29,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:29,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 21:07:29,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183417095] [2025-03-03 21:07:29,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:29,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 21:07:29,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:29,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 21:07:29,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:07:29,747 INFO L87 Difference]: Start difference. First operand 973 states and 1348 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:30,743 INFO L93 Difference]: Finished difference Result 1491 states and 2070 transitions. [2025-03-03 21:07:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 21:07:30,744 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 21:07:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:30,749 INFO L225 Difference]: With dead ends: 1491 [2025-03-03 21:07:30,749 INFO L226 Difference]: Without dead ends: 1182 [2025-03-03 21:07:30,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-03-03 21:07:30,750 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 439 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:30,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 822 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:07:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-03-03 21:07:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1023. [2025-03-03 21:07:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 789 states have (on average 1.2978453738910012) internal successors, (1024), 806 states have internal predecessors, (1024), 196 states have call successors, (196), 37 states have call predecessors, (196), 37 states have return successors, (196), 179 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-03 21:07:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1416 transitions. [2025-03-03 21:07:30,837 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1416 transitions. Word has length 151 [2025-03-03 21:07:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:30,837 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1416 transitions. [2025-03-03 21:07:30,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1416 transitions. [2025-03-03 21:07:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:07:30,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:30,839 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:30,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 21:07:30,839 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:30,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash 198222935, now seen corresponding path program 1 times [2025-03-03 21:07:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:30,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452417505] [2025-03-03 21:07:30,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:30,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:30,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:07:30,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:07:30,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:30,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:07:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:07:34,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:07:34,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452417505] [2025-03-03 21:07:34,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452417505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:07:34,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:07:34,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 21:07:34,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953688574] [2025-03-03 21:07:34,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:07:34,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 21:07:34,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:07:34,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 21:07:34,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-03 21:07:34,573 INFO L87 Difference]: Start difference. First operand 1023 states and 1416 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:07:38,329 INFO L93 Difference]: Finished difference Result 1174 states and 1607 transitions. [2025-03-03 21:07:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 21:07:38,330 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 21:07:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:07:38,334 INFO L225 Difference]: With dead ends: 1174 [2025-03-03 21:07:38,334 INFO L226 Difference]: Without dead ends: 1172 [2025-03-03 21:07:38,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=268, Invalid=1138, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 21:07:38,335 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 374 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:07:38,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1060 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 21:07:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-03-03 21:07:38,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1034. [2025-03-03 21:07:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 800 states have (on average 1.30125) internal successors, (1041), 817 states have internal predecessors, (1041), 196 states have call successors, (196), 37 states have call predecessors, (196), 37 states have return successors, (196), 179 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-03 21:07:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1433 transitions. [2025-03-03 21:07:38,411 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1433 transitions. Word has length 151 [2025-03-03 21:07:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:07:38,412 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1433 transitions. [2025-03-03 21:07:38,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:07:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1433 transitions. [2025-03-03 21:07:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:07:38,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:07:38,413 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:38,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 21:07:38,413 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:07:38,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:07:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash 326382133, now seen corresponding path program 1 times [2025-03-03 21:07:38,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:07:38,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12578471] [2025-03-03 21:07:38,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:07:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:07:38,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:07:38,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:07:38,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:07:38,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:08:06,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:06,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12578471] [2025-03-03 21:08:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12578471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:06,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:06,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 21:08:06,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219602039] [2025-03-03 21:08:06,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:06,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 21:08:06,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:06,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 21:08:06,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-03-03 21:08:06,083 INFO L87 Difference]: Start difference. First operand 1034 states and 1433 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:08:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:11,442 INFO L93 Difference]: Finished difference Result 1185 states and 1620 transitions. [2025-03-03 21:08:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 21:08:11,444 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 21:08:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:11,448 INFO L225 Difference]: With dead ends: 1185 [2025-03-03 21:08:11,448 INFO L226 Difference]: Without dead ends: 1183 [2025-03-03 21:08:11,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 21:08:11,449 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 384 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:11,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 933 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 21:08:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-03 21:08:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1034. [2025-03-03 21:08:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 800 states have (on average 1.30125) internal successors, (1041), 817 states have internal predecessors, (1041), 196 states have call successors, (196), 37 states have call predecessors, (196), 37 states have return successors, (196), 179 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-03 21:08:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1433 transitions. [2025-03-03 21:08:11,527 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1433 transitions. Word has length 151 [2025-03-03 21:08:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:11,528 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1433 transitions. [2025-03-03 21:08:11,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:08:11,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1433 transitions. [2025-03-03 21:08:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:08:11,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:11,529 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:11,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 21:08:11,529 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:11,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:11,530 INFO L85 PathProgramCache]: Analyzing trace with hash 327305654, now seen corresponding path program 1 times [2025-03-03 21:08:11,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:11,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313747890] [2025-03-03 21:08:11,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:11,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:11,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:08:11,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:08:11,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:11,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat